#include"plants.h"
using namespace std;
int pref[200005],n;
void init(int k,vector<int>r){
n=r.size();
for(int i=0;i<n+3;i++)pref[i]=0;
for(int i=0;i<n;i++)pref[i+1]=pref[i]+r[i];
}
int compare_plants(int x, int y){
if(pref[y]-pref[x]==0)return 1;
else if(pref[y]-pref[x]==y-x)return -1;
else if(pref[n]-pref[y]+pref[x]==0)return -1;
else if(pref[n]-pref[y]+pref[x]==n-y+x)return 1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
59 ms |
4076 KB |
Output is correct |
7 |
Correct |
70 ms |
5484 KB |
Output is correct |
8 |
Correct |
93 ms |
7916 KB |
Output is correct |
9 |
Correct |
96 ms |
7916 KB |
Output is correct |
10 |
Correct |
93 ms |
8044 KB |
Output is correct |
11 |
Correct |
93 ms |
7916 KB |
Output is correct |
12 |
Correct |
90 ms |
8044 KB |
Output is correct |
13 |
Correct |
87 ms |
7916 KB |
Output is correct |
14 |
Correct |
87 ms |
7916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
59 ms |
4076 KB |
Output is correct |
7 |
Correct |
70 ms |
5484 KB |
Output is correct |
8 |
Correct |
93 ms |
7916 KB |
Output is correct |
9 |
Correct |
96 ms |
7916 KB |
Output is correct |
10 |
Correct |
93 ms |
8044 KB |
Output is correct |
11 |
Correct |
93 ms |
7916 KB |
Output is correct |
12 |
Correct |
90 ms |
8044 KB |
Output is correct |
13 |
Correct |
87 ms |
7916 KB |
Output is correct |
14 |
Correct |
87 ms |
7916 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
0 ms |
364 KB |
Output is correct |
17 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |