제출 #412685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412685		dynam1c	Comparing Plants (IOI20_plants)	C++17	5 / 100	107 ms	6084 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(x) x.begin(),x.end()

int n, k;
vector<int> r;
vector<int> pref;

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

int compare_plants(int x, int y) {
	if (x > y)
		return -compare_plants(y, x);
	if (pref[y]-pref[x] == y-x or pref[x] + pref[n] - pref[y] == 0)
		return -1;
	if (pref[y]-pref[x] == 0 or pref[x] + pref[n] - pref[y] == n-(y-x))
		return 1;
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25