제출 #800296

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
800296		I_Love_EliskaM_	Comparing Plants (IOI20_plants)	C++14	14 / 100	4038 ms	5380 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,_n) for(int i=0;i<_n;++i)
#define all(x) x.begin(),x.end()
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second
using ll = long long;

const int N=2e5+55;
int p[N];
int n;
int k;
void init(int _k, vector<int> r) {
	k=_k;
	n=r.size();
	if (2*k<=n) exit(0);
	//if (n>5000) exit(0);
	vector<int> pos(k,-1);

	forn(i,n) {

		int z=0;
		forn(j,n) if (r[j]==k-1) z=j;
		int d=0;
		int j=z;
		while (d<k) {
			if (r[j]==k-1) {
				d=0, z=j;
			}
			++d;
			j=(j-1+n)%n;
		}
		p[z]=i;
		d=0;
		j=z;
		while (d<k) {
			r[j]++;
			++d;
			j=(j-1+n)%n;
		}

	}

}

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

• 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