Submission #306505

#TimeUsernameProblemLanguageResultExecution timeMemory
306505giorgikobComparing Plants (IOI20_plants)C++14
0 / 100
1 ms384 KiB
#include "plants.h" #include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define pb push_back using namespace std; vector<int>v; int n; void init(int k, std::vector<int> r) { n = r.size(); v = r; return; } bool check(int x,int y){ for(int i = x; i != y; i = (i+1)%n){ if(v[i] != 1){ return false; } } return true; } int compare_plants(int x, int y) { if(check(y,x)) return 1; if(check(x,y)) 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...