| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1078130 | mindiyak | Carnival Tickets (IOI20_tickets) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "plants.h"
#include <iostream>
using namespace std;
vector<int> R;
void init(int k, std::vector<int> r) {
R = r;
return;
}
int compare_plants(int x, int y) {
int a=x;
int n = R.size();
// cerr << x << " " << y << endl;
a = x;
if(R[a] == 0){
a += 1;
while((a%n) != y && R[(a%n)] == 0)a++;
// cerr << "X - " << (a%n) << " -1" << endl;
if((a%n) == y) return 1;
}
a = y;
if(R[a] == 1){
a += 1;
while((a%n) != x && R[(a%n)] == 1)a++;
// cerr << "X - " << (a%n) << " -1" << endl;
if((a%n) == x) return 1;
}
a = y;
if(R[a] == 0){
a += 1;
while((a%n) != x && R[(a%n)] == 0)a++;
// cerr << "X - " << (a%n) << " -1" << endl;
if((a%n) == x) return -1;
}
a = x;
if(R[a] == 1){
a += 1;
while((a%n) != y && R[(a%n)] == 1)a++;
// cerr << "X - " << (a%n) << " -1" << endl;
if((a%n) == y) return -1;
}
return 0;
}