제출 #1051465

#제출 시각아이디문제언어결과실행 시간메모리
1051465LittleOrangeComparing Plants (IOI20_plants)C++17
0 / 100
1 ms348 KiB
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
namespace{
	vector<ll> a;
	ll n;
}

void init(int k, std::vector<int> r) {
	n = r.size();
	a.resize(n+1,0);
	for(ll i = 0;i<n;i++) a[i+1] = a[i]+(r[i]>r[(i+1)%n]);
}

int compare_plants(int x, int y) {
	if (a[y]-a[x]==y-x) return -1;
	if (a[y]-a[x]==0) return 1;
	if (a[n]-a[y]+a[x]==0) return -1;
	if (a[n]-a[y]+a[x]==n-y+x) 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...