U216875 麓山南路上的树(求调必关)
  • 板块学术版
  • 楼主HOYOMIX_2D
  • 当前回复6
  • 已保存回复6
  • 发布时间2024/10/7 09:15
  • 上次更新2024/10/7 10:49:55
查看原帖
U216875 麓山南路上的树(求调必关)
1387871
HOYOMIX_2D楼主2024/10/7 09:15
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
int a[maxn],b[maxn],L,m,ans=0;
bool c[maxn]=0;

int main(){

    cin >> L >> m;
    memset(c,true,sizeof(0));
    for (int i = 1; i <= m; i ++)
        cin >> a[i];
    for (int i = 1; i <= m; i ++)
        cin >> b[i];
    for (int i = 1; i <= m; i ++){
        for (int j = a[i]; j <= b[i]; j ++){
            c[j] = false;
        }
    }
    ans = 0;
    for (int i=0; i <= L; i++){ 
        if(c[i])ans ++;
    }
    cout << ans;
    return 0;
}
2024/10/7 09:15
加载中...