oj.uz

Submission #120008

# Submission time Handle Problem Language Result Execution time Memory
120008 2019-06-22T23:56:06 Z E869120 Editor (BOI15_edi) C++14
20 / 100
 3000 ms 2176 KB 
#include <iostream>
using namespace std;

int N, A[300009], P[300009], par[300009];

int main() {
	cin >> N;
	for (int i = 1; i <= N; i++) cin >> A[i];
	for (int i = 1; i <= N; i++) {
		if (A[i] >= 0) {
			P[i] = 1;
		}
		else {
			P[i] = 1;
			for (int j = i - 1; j >= 1; j--) {
				int level = 0; if (A[j] < 0) level = -A[j];
				if (level < -A[i] && P[j] == 1) { par[i] = j; break; }
			}
			int cx = i;
			while (A[cx] < 0) {
				cx = par[cx];
				P[cx] ^= 1;
			}
		}

		int ans = 0;
		for (int j = 1; j <= i; j++) {
			if (P[j] == 1 && A[j] >= 1) ans = A[j];
		}
		cout << ans << endl;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 21 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 30 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 46 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 38 ms 384 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3022 ms 2176 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3059 ms 1912 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 21 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 30 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 46 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 38 ms 384 KB Output is correct
10 Execution timed out 3022 ms 2176 KB Time limit exceeded
11 Halted 0 ms 0 KB -