Submission #1239574

#TimeUsernameProblemLanguageResultExecution timeMemory
1239574MuhammadSaramComparing Plants (IOI20_plants)C++20
0 / 100
0 ms328 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; const int M = 2e5 + 1; int pre[M]; void init(int k, vector<int> r) { for (int i=0;i<r.size();i++) pre[i+1]=pre[i]+r[i]; return; } int compare_plants(int x, int y) { int len=y-x, val = pre[y]-pre[x]; if (val%len) return 0; return (val==len?-1:1); }
#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...