oj.uz

Submission #314636

# Submission time Handle Problem Language Result Execution time Memory
314636 2020-10-20T13:52:08 Z kostia244 Comparing Plants (IOI20_plants) C++17
14 / 100
 4000 ms 5064 KB 
#include "plants.h"
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const int maxn = 1<<17;
int n, k, ord[maxn], oh[maxn];
int in(int l, int r, int x) {
	if(l >= n) l%=n;
	if(r >= n) r%=n;
	if(l > r) {
		return in(l, n-1, x) || in(0, r, x);
	}
	return l <= x && x <= r;
}
void ah(int i, int x) {
	for(int j = 1; j < k; j++) oh[(i+j)%n]+=x;
}
void init(int K, std::vector<int> r) {
	k = K;
	n = r.size();
	for(int i = 0; i < n; i++) if(r[i] == 0) ah(i, 1);
	for(int L = n; L; L--) {
		int f = 1;
		for(int i = 0; f && i < n; i++) if(!oh[i] && r[i] == 0 && !ord[i]) {
			ord[i] = L;
			ah(i, -1);
			for(int j = 1; j < k; j++) {
				int pos = (n-j+i)%n;
				if(--r[pos] == 0) ah(pos, 1);
			}
			f = 0;
		}
	}
	return;
}

int compare_plants(int x, int y) {
	return (ord[x] > ord[y]) - (ord[x] < ord[y]);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 458 ms 3320 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 456 ms 3320 KB Output is correct
11 Correct 319 ms 3192 KB Output is correct
12 Correct 316 ms 3516 KB Output is correct
13 Correct 554 ms 3320 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 458 ms 3320 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 456 ms 3320 KB Output is correct
11 Correct 319 ms 3192 KB Output is correct
12 Correct 316 ms 3516 KB Output is correct
13 Correct 554 ms 3320 KB Output is correct
14 Execution timed out 4089 ms 2936 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 69 ms 3192 KB Output is correct
4 Execution timed out 4056 ms 5064 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -