제출 #300828

#제출 시각아이디문제언어결과실행 시간메모리
300828IgorIComparing Plants (IOI20_plants)C++17
0 / 100
1 ms256 KiB
#include <bits/stdc++.h> using namespace std; const int N = 500000; int n, k; vector<int> r; int p[N]; void init(int _k, vector<int> _r) { n = _r.size(); r = _r; k = _k; for (int i = 0; i < n; i++) { p[i] = p[i - 1] + r[i]; } } int compare_plants(int x, int y) { if (x < y) { if (p[y - 1] - p[x - 1] == 0) { return -1; } if (p[y - 1] - p[x - 1] == y - x) { return 1; } if (p[n - 1] - p[y - 1] + p[x - 1] == 0) { return 1; } if (p[n - 1] - p[y - 1] + p[x - 1] == 0) { return -1; } return 0; } return -2; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...