Submission #815457

#TimeUsernameProblemLanguageResultExecution timeMemory
815457vjudge1Comparing Plants (IOI20_plants)C++17
5 / 100
60 ms8676 KiB
#include <iostream> #include <vector> #include "plants.h" using namespace std; int n, h, i; vector<int> v, s; void init(int k, vector<int> r) { v = r; n = r.size(); h = k; s.resize(n + 1); s[0] = 0; for (i = 0; i < n; i++) s[i + 1] = s[i] + r[i]; } int compare_plants(int x, int y) { if (s[y] - s[x] == y - x) return -1; if (s[y] - s[x] == 0) return 1; if (s[x] + s[n] - s[y] == x + n - y) return 1; if (s[x] + s[n] - s[y] == 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...