题目描述:
有一条长为n的路。端点分别为0和n。共有m次植树操作,每次将l到r之间的整点种上树。问你每次植树后有多少个整点有树?
输入格式:
第一行一个整数n,表示路的长度。
第二行一个整数m,表示植树操作次数。
接下来m行每行两个整数l,r。若l>r则表示不种树。
输出格式:
共m行,每行一个整数,表示每次植树后有多少个整点有树。
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,sz[101]={},ans[101],cnt=0,sum=0;
cin>>n>>m;
for(int i=0 ; i<m ; i++){
int a,b;
cin>>a>>b;
for(int j=a-1 ; j<=b-1 ; j++){
if(sz[j]!=1){
sum++;
sz[j]=1;
}
}
ans[cnt]=sum;
sum=0;
cnt++;
}
for(int i=0 ; i<cnt ; i++){
cout<<ans[i]<<endl;
}
return 0;
}
compiled successfully time: 53ms, memory: 360kb, score: 0, status: Runtime Error
test 1: time: 3ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 2: time: 13ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 3: time: 1ms, memory: 356kb, points: 0, status: Wrong Answer
test 4: time: 4ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 5: time: 5ms, memory:360kb, points: 0, status: Dangerous Syscall
test 6: time: 5ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 7: time: 8ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 8: time: 9ms, memory: 360kb, points: 0, status: Dangerous Syscall
test 9: time: 2ms, memory: 356kb, points: 0, status: Runtime Error
test 10: time: 3ms, memory: 360kb, points: 0, status: Dangerous Syscall