Submission #1050299

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1050299	2024-08-09T08:36:12 Z	aykhn	Comparing Plants (IOI20_plants)	C++17	11 / 100	4000 ms	122692 KB

plants

#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 5e3 + 5;

int n;
int a[MXN], cnt[MXN], f[MXN];
vector<int> adj[MXN];
int big[MXN][MXN], used[MXN];

void dfs(int a, int s)
{
	big[s][a] = 1;
	used[a] = 1;
	for (int &v : adj[a])
	{
		if (!used[v]) dfs(v, s);
	}
}

void init(int k, vector<int> r) 
{
	n = r.size();
	for (int i = 0; i < n; i++) cnt[i] = k - 1;
	int cur = -1;
	while (cur < n)
	{
		vector<int> idx;
		for (int i = 0; i < n; i++)
		{
			if (f[i]) continue;
			if (r[i] == cnt[i]) idx.push_back(i);
		}
		if (idx.empty()) break;
		int ind = -1;
		int sz = idx.size();
		if (sz == 1) ind = 0;
		else 
		{
			for (int i = 0; i < sz; i++)
			{
				if ((idx[(i + 1) % sz] - idx[i] + n) % n >= k) 
				{
					ind = (i + 1) % sz;
					break;
				}
			}
		}
		assert(!idx.empty());
		// for (int i = (idx[ind] - 1 + n) % n; i != idx[(ind - 1 + sz) % sz]; i = (i - 1 + n) % n)
		// {
		// 	if (!f[i]) adj[idx[ind]].push_back(i);
		// }
		for (int i = (idx[ind] + 1) % n; i != (idx[ind] + k) % n; i = (i + 1) % n)
		{
			if (!f[i]) adj[idx[ind]].push_back(i);
		}
		for (int i = (idx[ind] - 1 + n) % n; i != (idx[ind] - k + n) % n; i = (i - 1 + n) % n)
		{
			if (!f[i]) adj[idx[ind]].push_back(i);
			cnt[i]--;
		}
		f[idx[ind]] = 1;
	}
	for (int i = 0; i < n; i++)
	{
		fill(used, used + n, 0);
		dfs(i, i);
	}
}

int compare_plants(int x, int y) 
{
	if (big[x][y]) return -1;
	if (big[y][x]) return 1;
	return 0;
	// return (a[x] > a[y] ? 1 : -1);
}

Subtask #1

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	2652 KB	Output is correct
6	Correct	25 ms	5228 KB	Output is correct
7	Runtime error	22 ms	5980 KB	Execution killed with signal 11
8	Halted	0 ms	0 KB	-

Subtask #2

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	118 ms	25776 KB	Output is correct
7	Execution timed out	4075 ms	122692 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	118 ms	25776 KB	Output is correct
7	Execution timed out	4075 ms	122692 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	2652 KB	Output is correct
3	Correct	50 ms	44672 KB	Output is correct
4	Runtime error	32 ms	8784 KB	Execution killed with signal 11
5	Halted	0 ms	0 KB	-

Subtask #5

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2676 KB	Output is correct
7	Correct	7 ms	7260 KB	Output is correct
8	Correct	9 ms	7496 KB	Output is correct
9	Correct	7 ms	7256 KB	Output is correct
10	Correct	9 ms	7516 KB	Output is correct
11	Correct	7 ms	7260 KB	Output is correct
12	Correct	7 ms	7260 KB	Output is correct
13	Correct	12 ms	7772 KB	Output is correct

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	2652 KB	Output is correct
5	Correct	23 ms	21756 KB	Output is correct
6	Runtime error	29 ms	8784 KB	Execution killed with signal 11
7	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	2652 KB	Output is correct
6	Correct	25 ms	5228 KB	Output is correct
7	Runtime error	22 ms	5980 KB	Execution killed with signal 11
8	Halted	0 ms	0 KB	-