Submission #303315

#TimeUsernameProblemLanguageResultExecution timeMemory
303315Utaha식물 비교 (IOI20_plants)C++14
0 / 100
1 ms256 KiB
#include "plants.h" #include<bits/stdc++.h> using namespace std; int n,k; vector<int> v; void init(int _k, std::vector<int> r) { v = r; k = _k; return; } bool between(int idx,int l,int r){ if(l<=idx&&idx<r) return 1; if(l<=idx+n&&idx+n<r) return 1; return 0; } int compare_plants(int x, int y) { if(between(y,x,x+k)){ if(v[x]==0) return 1; else if(v[x] == k-1) return -1; } if(between(x,y,y+k)){ if(v[y]==0) return -1; else if(v[y] == k-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...