# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310322 | 2020-10-06T16:28:00 Z | APROHACK | Comparing Plants (IOI20_plants) | C++14 | 141 ms | 7280 KB |
#include "plants.h" #include <bits/stdc++.h> using namespace std; vector<int>globalr; long long gk, gn; vector<int>acum; void init(int k, vector<int> r) { globalr=r; gk=k; gn=r.size(); acum.push_back(0); long long cur=0; for(int i = 0 ; i < r.size() ; i ++){ if(r[i])cur++; acum.push_back(cur); } for(int i = 0 ; i < r.size() ; i ++){ if(r[i])cur++; acum.push_back(cur); } return; } int compare_plants(int x, int y) { long long rta1, rta2; rta1=acum[y]-acum[x]; if(rta1==0){ return 1; }else if(rta1==y-x)return -1; else { rta2=acum[(x+gn)]-acum[(y)]; if(rta2==0){ return -1; }else if(rta2==(x+gn)-y){ return 1; }else return 0; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 64 ms | 3192 KB | Output is correct |
7 | Correct | 116 ms | 3700 KB | Output is correct |
8 | Correct | 121 ms | 7148 KB | Output is correct |
9 | Correct | 113 ms | 7276 KB | Output is correct |
10 | Correct | 111 ms | 7244 KB | Output is correct |
11 | Correct | 128 ms | 7148 KB | Output is correct |
12 | Correct | 106 ms | 7148 KB | Output is correct |
13 | Correct | 126 ms | 7276 KB | Output is correct |
14 | Correct | 141 ms | 7280 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Incorrect | 1 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Incorrect | 1 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 1 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Incorrect | 1 ms | 256 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Incorrect | 0 ms | 384 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 64 ms | 3192 KB | Output is correct |
7 | Correct | 116 ms | 3700 KB | Output is correct |
8 | Correct | 121 ms | 7148 KB | Output is correct |
9 | Correct | 113 ms | 7276 KB | Output is correct |
10 | Correct | 111 ms | 7244 KB | Output is correct |
11 | Correct | 128 ms | 7148 KB | Output is correct |
12 | Correct | 106 ms | 7148 KB | Output is correct |
13 | Correct | 126 ms | 7276 KB | Output is correct |
14 | Correct | 141 ms | 7280 KB | Output is correct |
15 | Correct | 0 ms | 256 KB | Output is correct |
16 | Correct | 1 ms | 256 KB | Output is correct |
17 | Incorrect | 1 ms | 256 KB | Output isn't correct |
18 | Halted | 0 ms | 0 KB | - |