Submission #369761

#TimeUsernameProblemLanguageResultExecution timeMemory
369761MilosMilutinovic식물 비교 (IOI20_plants)C++14
0 / 100
1 ms380 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; int n, k; vector<int> a; int compare_plants(int x, int y) { assert(x>=0&&x<n&&y>=0&&y<n&&x!=y); if(x==n-1) { if(y==x-1) { if(!a[y]) return -1; return 1; } else { if(y!=0) return 0; if(!a[x]) return 1; return -1; } } else { if(x==0) { if(y==n-1) { if(!a[y]) return -1; return 1; } else { if(y!=1) return 0; if(!a[x]) return 1; return -1; } } else { if(abs(x-y)!=1) return 0; if(x<y) { if(!a[x]) return 1; return -1; } else { if(!a[y]) return -1; return 1; } } } assert(false); } void init(int K, vector<int> r) { n=(int)r.size(), k=K, a=r; } /*int main() { init(2, {0, 0, 1}); cout << compare_plants(0, 2); 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...