Submission #769040

#	Time	Username	Problem	Language	Result	Execution time	Memory
769040		ono_de206	식물 비교 (IOI20_plants)	C++14	14 / 100	4049 ms	4940 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

vector<int> a;
set<int> s;
int n, k;

bool check(int i) {
	if(s.size() == 1) return 1;
	s.erase(i);
	auto l = s.lower_bound(i);
	if(l == s.begin()) l = s.end();
	l--;
	if((i - (*l) + n) % n < k) {
		s.in(i);
		return 0;
	}
	s.in(i);
	return 1;
}

void init(int _k, vector<int> r) {
	k = _k;
	n = r.size();
	a.resize(n);
	for(int i = 0; i < n; i++) {
		if(r[i] == 0) s.in(i);
	}
	int now;
	for(int i = 0; i < n; i++) {
		if(r[i] == 0 && check(i)) now = i;
	}
	for(int i = n; i >= 1; i--) {
		a[now] = i;
		r[now] = -1;
		s.erase(now);
		for(int j = 1; j < k; j++) {
			int id = (now - j + n) % n;
			r[id]--;
			if(r[id] == 0) s.in(id);
		}
		for(int j = 1; j < k; j++) {
			int id = (now - j + n) % n;
			if(r[id] == 0 && check(id)) {
				now = id;
				break;
			}
			id = (now + j) % n;
			if(r[id] == 0 && check(id)) {
				now = id;
				break;
			}
		}
	}
}

int compare_plants(int x, int y) {
	if(a[x] > a[y]) return 1;
	else return -1;
	return 0;
}

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