oj.uz

Submission #823669

# Submission time Handle Problem Language Result Execution time Memory
823669 2023-08-12T23:53:05 Z GusterGoose27 Comparing Plants (IOI20_plants) C++17
5 / 100
 85 ms 6380 KB 
#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5+5;
bool lt[MAXN];
int pre[2*MAXN];
int n;

void init(int k, vector<int> r) {
	n = r.size();
	for (int i = 0; i < n; i++) {
		lt[i] = r[i];
	}
	for (int i = 1; i < 2*n; i++) pre[i] = pre[i-1]+lt[(i-1)%n];
	return;
}

int compare_plants(int x, int y) {
	// if (x != (y+1)%n && y != (x+1)%n) return 0;
	// if (x == (y+1)%n) return 2*(!lt[y])-1;
	// return 2*lt[x]-1;
	// if (x < y) {
		if (pre[y]-pre[x] == y-x) return -1;
		if (pre[x+n]-pre[y] == x+n-y) return 1;
		if (pre[y]-pre[x] == 0) return 1;
		if (pre[x+n]-pre[y] == 0) return -1;
		return 0;
	// }
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 40 ms 3472 KB Output is correct
7 Correct 45 ms 3812 KB Output is correct
8 Correct 61 ms 6296 KB Output is correct
9 Correct 60 ms 6296 KB Output is correct
10 Correct 85 ms 6304 KB Output is correct
11 Correct 73 ms 6304 KB Output is correct
12 Correct 62 ms 6380 KB Output is correct
13 Correct 59 ms 6372 KB Output is correct
14 Correct 58 ms 6308 KB Output is correct

Subtask #2
0 / 14.0

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

Subtask #4
0 / 17.0

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

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 40 ms 3472 KB Output is correct
7 Correct 45 ms 3812 KB Output is correct
8 Correct 61 ms 6296 KB Output is correct
9 Correct 60 ms 6296 KB Output is correct
10 Correct 85 ms 6304 KB Output is correct
11 Correct 73 ms 6304 KB Output is correct
12 Correct 62 ms 6380 KB Output is correct
13 Correct 59 ms 6372 KB Output is correct
14 Correct 58 ms 6308 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -