Submission #345479

#TimeUsernameProblemLanguageResultExecution timeMemory
345479maskoffComparing Plants (IOI20_plants)C++14
0 / 100
1 ms364 KiB
#include "plants.h" #include<bits/stdc++.h> using namespace std; int k; vector<int> r; void init(int K, vector<int> v) { r = v; k = K; return; } int compare_plants(int x, int y) { int mx = 0, mn = 1; for (int i = x; i < y; ++i) { mn = min(mn, r[i]); mx = max(mx, r[i]); } if (mn == mx) { if (mn == 0) { return -1; } else { 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...