Submission #768995

#	Time	Username	Problem	Language	Result	Execution time	Memory
768995		ono_de206	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	212 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, pre, dp;
int n, k;

void init(int _k, vector<int> r) {
	k = _k;
	n = r.size();
	pre.resize(n * 3);
	dp.resize(n * 3);
	for(int i = 0; i < 3; i++) {
		a.in(a.end(), all(r));
	}
	int ls = -1;
	for(int i = n * 3 - 1; i >= 0; i--) {
		if(a[i] == 0) {
			if(ls != -1 && ls - i < k) dp[i] = dp[ls];
			else dp[i] = i;
		}
	}
}

int compare_plants(int x, int y) {
	if(x < y) {
		if(a[x] == 0 && dp[x] + k - 1 >= y) return 1;
		if(a[y] == 0 && dp[y] + k - 1 >= x + n) return -1;
	} else {
		if(a[x] == 0 && dp[x] + k - 1 >= y + n) return 1;
		if(a[y] == 0 && dp[y] + k - 1 >= x) return -1;
	}
	return 0;
}

• Subtask 1: 0 / 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