Submission #420973

#TimeUsernameProblemLanguageResultExecution timeMemory
420973MonchitoComparing Plants (IOI20_plants)C++14
0 / 100
1 ms204 KiB
#include <iostream>
#include <vector>
using namespace std;
 
int K, N;
vector<int> R;
 
void init(int k, vector<int> r){
    K = k;
    R = r;
    N = (int)r.size();
}
 
int compare_plants(int x, int y){
    if((x+1)%N == y)
        return (R[x] == 1)? -1 : 1; 
    
    if((y+1)%N == x)
        return (R[y] == 1)? 1 : -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...