Submission #603613

#	Time	Username	Problem	Language	Result	Execution time	Memory
603613		Tigryonochekk	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	212 KiB

plants

#include <iostream>
#include "plants.h"
#include <vector>
using namespace std;
const int N = 5002;

int n;
int k;
vector<int> r;
int ans[N][N];

void init(int kip, vector<int> rib) {
	k = kip;
	r = rib;
	n = r.size();
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < i + k; j++) {
			if (r[i] + i >= r[j % n] + j) {
				ans[i][j % n] = -1;
				ans[j % n][i] = 1;
			}
			else if (r[i] - i <= r[j % n] - j) {
				ans[i][j % n] = 1;
				ans[j % n][i] = -1;
			}
		}
	}
	return;
}

int compare_plants(int x, int y) {
	if (n <= 5000 && 2 * k > n) 
		return ans[x][y];
	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