oj.uz

Submission #682208

# Submission time Handle Problem Language Result Execution time Memory
682208 2023-01-16T04:33:02 Z mansur Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 312 KB 
#include "plants.h"
#include <bits/stdc++.h>

#define rall(s) s.end(), s.begin()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define vt vector
#define s second
#define f first
#define nl '\n'

using ll = long long;
//using pii = pair<int, int>;
//using pll = pair<ll, ll>;

using namespace std;

const int N = 2e5 + 5;

int n, tl, tr, pr[N];

void init(int k, vt<int> r) {
	n = sz(r);
	tl = n, tr = -1;
	for (int i = 0; i < n; i++) {
		if (!r[i]) {
			tl = i;
			break;
		}
	}
	for (int i = n - 1; i >= 0; i--) {
		if (!r[i]) {
			tr = i;
			break;
		}
	}
	for (int i = 0; i < n; i++) {
		if (i) pr[i] = pr[i - 1];
		pr[i] += r[i];
	}
	return;
}

int compare_plants(int x, int y) {
	if (tr < y && x <= tl) return 1;
	if (pr[y - 1] - (x ? pr[x - 1] : 0) == y - x) return -1;
	return 0;
}

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

Subtask #2
0 / 14.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 Incorrect 0 ms 312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 Incorrect 0 ms 312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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