oj.uz

Submission #768977

# Submission time Handle Problem Language Result Execution time Memory
768977 2023-06-29T03:54:59 Z t6twotwo Comparing Plants (IOI20_plants) C++17
0 / 100
 2 ms 212 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K;
vector<int> H, pfs;
void init(int k, std::vector<int> r) {
	K = k, H = r; N = H.size();
	pfs.resize(N + 1);
	for (int i = 0; i < N; i++) {
		pfs[i + 1] = pfs[i] + H[i];
	}
}

int compare_plants(int x, int y) {
	if (pfs[y + 1] - pfs[x + 1] == 0) {
		return 1;
	}
	if (pfs[y + 1] - pfs[x + 1] == y - x) {
		return -1;
	}
	if (pfs[N] - pfs[y] + pfs[x] == 0) {
		return -1;
	}
	if (pfs[N] - pfs[y] + pfs[x] == N - y + x) {
		return 1;
	}
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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