Submission #394290

#TimeUsernameProblemLanguageResultExecution timeMemory
394290snasibov05Comparing Plants (IOI20_plants)C++14
5 / 100
101 ms7984 KiB
#include "plants.h" using namespace std; vector<int> sum; int sm = 0; int n; void init(int k, vector<int> r) { n = r.size(); sum.resize(n); sum[0] = r[0]; sm += r[0]; for (int i = 1; i < n; ++i) { sum[i] = sum[i-1] + r[i]; sm += r[i]; } } int compare_plants(int x, int y) { if (x > y) swap(x, y); int k = sum[y-1]; if (x != 0) k -= sum[x-1]; if (k == y - x) return -1; if (k == 0) return 1; k = sm - k; if (k == (n - y) + x) return 1; if (k == 0) return -1; return 0; }
#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...