# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421313 | 2021-06-09T02:26:50 Z | JUANDI321 | Comparing Plants (IOI20_plants) | C++17 | 1 ms | 300 KB |
#include "plants.h" #include <vector> #include <iostream> using namespace std; int sumpf[200010], copyr[20010]; int n; void init(int k, vector<int> r) { n = r.size(); sumpf[0] = 200010; //cout<<sumpf[1]<<" "; copyr[0] = r[0]; for(int i = 1; i < r.size(); i++) { sumpf[i] = sumpf[i-1] + r[i-1]; if(r[i-1] == 0) sumpf[i]--; copyr[i] = r[i]; // cout<<sumpf[i+1]<<" "; } //cout<<endl; return; } int compare_plants(int x, int y) { if(x == 0 && y == n-1) { if(copyr[n-1] == 1) return 1; return -1; } int dis = y-x+1; //cout<<dis<<endl; //cout<<sumpf[y]-sumpf[x-1]<<endl; int sum = sumpf[y] - sumpf[x-1]; if(x == 0)sum = sumpf[y]; if(sum == dis) return 1; if(sum == -1 * dis) return -1; int sb = x; x = y; y = sb; dis = y-x+1; //cout<<dis<<endl; //cout<<sumpf[y]-sumpf[x-1]<<endl; sum = sumpf[y] - sumpf[x-1]; if(x == 0)sum = sumpf[y]; if(sum == dis) return 1; if(sum == -1 * dis) return -1; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 300 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 300 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 300 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 300 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |