oj.uz

Submission #384196

# Submission time Handle Problem Language Result Execution time Memory
384196 2021-03-31T17:53:13 Z alexxela12345 Comparing Plants (IOI20_plants) C++17
0 / 100
 4000 ms 384 KB 
#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

int n;
int k;
vector<int> r;

void init(int k_, std::vector<int> r_) {
	k = k_;
	r = r_;
	n = r.size();
	return;
}

int compare_plants(int x, int y) {
	bool gr, le;
	gr = le = false;
	vector<int> arr(n);
	iota(arr.begin(), arr.end(), 0);
	do {
		vector<int> r2(n);
		for (int i = 0; i < n; i++) {
			for (int j = 1; j < k; j++) {
				if (arr[i] < arr[(i + j) % n]) {
					r2[i]++;
				}
			}
		}
		if (r2 == r) {
			if (arr[x] < arr[y])
				le = 1;
			else
				gr = 1;
		}
	} while (next_permutation(arr.begin(), arr.end()));
	if (!le)
		return 1;
	if (!gr)
		return -1;
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 5 ms 364 KB Output is correct
5 Execution timed out 4091 ms 364 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Execution timed out 4093 ms 384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Execution timed out 4093 ms 384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Execution timed out 4083 ms 364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Execution timed out 4077 ms 364 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Execution timed out 4093 ms 364 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 5 ms 364 KB Output is correct
5 Execution timed out 4091 ms 364 KB Time limit exceeded
6 Halted 0 ms 0 KB -