oj.uz

Submission #769030

# Submission time Handle Problem Language Result Execution time Memory
769030 2023-06-29T05:20:32 Z t6twotwo Comparing Plants (IOI20_plants) C++17
14 / 100
 4000 ms 6348 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K;
vector<int> R, A;
int dis(int x, int y) {
	if (x < y) {
		return y - x;
	} else {
		return N - y + x;
	}
}
void init(int k, std::vector<int> r) {
	K = k, R = r; N = R.size();
	A.resize(N, -1);
	for (int i = 0; i < N; i++) {
		vector<int> v;
		for (int j = 0; j < N; j++) {
			if (A[j] == -1 && R[j] == K - 1) {
				v.push_back(j);
			}
		}
		int m = v.size(), p;
		vector<int> c;
		if (m == 1) {
			c = {v[0]};
		} else {
			for (int j = 0; j + 1 < m; j++) {
				assert(dis(v[j], v[(j + 1) % m]) == v[j + 1] - v[j]);
				if (v[j + 1] - v[j] >= K) {
					c.push_back(v[j + 1]);
				}
			}
			assert(v[m - 1] > v[0]);
			// assert(dis(v[m - 1], v[0]) == N - v[m - 1] + v[0]);
			if (N - (v[m - 1] - v[0]) >= K) {
				c.push_back(v[0]);
			}
		}
		assert(i || c.size() == 1);
		p = c[0];
		A[p] = i;
		for (int j = 1; j < K; j++) {
			R[(p - j + N) % N]++;
		}
	}
}
 
int compare_plants(int x, int y) {
	return A[x] > A[y] ? 1 : -1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 1 ms 340 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 308 KB Output is correct
7 Correct 175 ms 3768 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 8 ms 312 KB Output is correct
10 Correct 158 ms 3756 KB Output is correct
11 Correct 132 ms 3760 KB Output is correct
12 Correct 161 ms 3972 KB Output is correct
13 Correct 187 ms 3764 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 308 KB Output is correct
7 Correct 175 ms 3768 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 8 ms 312 KB Output is correct
10 Correct 158 ms 3756 KB Output is correct
11 Correct 132 ms 3760 KB Output is correct
12 Correct 161 ms 3972 KB Output is correct
13 Correct 187 ms 3764 KB Output is correct
14 Correct 2033 ms 4008 KB Output is correct
15 Execution timed out 4033 ms 6348 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 1 ms 340 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 1 ms 340 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 1 ms 340 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -