oj.uz

Submission #1051351

# Submission time Handle Problem Language Result Execution time Memory
1051351 2024-08-10T05:07:16 Z Gromp15 Comparing Plants (IOI20_plants) C++17
0 / 100
 30 ms 3200 KB 
#include <bits/stdc++.h>
#include "plants.h"
#define sz(x) (int)x.size()
using namespace std;

int n;
vector<int> ord;

void init(int k, std::vector<int> r) {
	n = sz(r);
	ord.resize(n, -1);
	for (int i = 0; i < n; i++) {
		int mn = -1;
		for (int j = 0; j < n; j++) if (!~ord[j]) {
			if (!~mn || r[j] < r[mn]) mn = j;
		}
		if (!~mn) break;
		vector<bool> use(n);
		for (int j = 0; j < n; j++) if (r[j] == r[mn]) use[j] = 1;
		for (int j = 0; j < n; j++) if (!~ord[j] && use[j]) {
			ord[j] = n - i;
			for (int z = 1; z <= k-1; z++) {
				int idx = j - z;
				if (idx < 0) idx += n;
				r[idx]--;
			}
		}
	}
}

int compare_plants(int x, int y) {
	return ord[x] > ord[y] ? 1 : ord[x] == ord[y] ? 0 : -1;
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 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 Incorrect 0 ms 348 KB Output isn't correct
4 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 Incorrect 0 ms 348 KB Output isn't correct
4 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 348 KB Output is correct
3 Incorrect 30 ms 3200 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.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 Incorrect 0 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -