Submission #521724

#TimeUsernameProblemLanguageResultExecution timeMemory
521724A_DComparing Plants (IOI20_plants)C++14
5 / 100
70 ms8004 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; const int NN=2e5+100; int pre[NN]; int nn; void init(int k,vector<int> r){ nn=r.size(); for(int i=1;i<=nn;i++){ pre[i]=pre[i-1]+r[i-1]; } } int compare_plants(int x, int y){ x++;y++; if(pre[y-1]-pre[x-1]==0)return 1; if(pre[y-1]-pre[x-1]==y-x)return -1; if(pre[x-1]+pre[nn]-pre[y-1]==0){ return -1; } if(pre[x-1]+pre[nn]-pre[y-1]==x-1+nn-y+1){ 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...