oj.uz

Submission #1086134

# Submission time Handle Problem Language Result Execution time Memory
1086134 2024-09-09T15:47:56 Z duytuandao21 Po (COCI21_po) C++17
30 / 70
 1000 ms 1628 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 1e6;
const int inf = 1e9 + 7;

int n, a[N];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	a[n + 1] = inf;
	int res = 0;
	for (int time = 1; time <= n; time++) {
		int minValue = inf;
		int i = 1;
		for (int j = 1; j <= n + 1; j++) {
			minValue = min(minValue, a[j]);
			if (a[j] == inf) {
				if (i + 1 < j) res++;
				while (i < j) {
					if (a[i] == minValue) a[i] = inf;
					i++;
				}
				minValue = inf;
			}
		}
		bool stop = true;
		for (int i = 1; i <= n; i++) {
			// cout << a[i] << ' ';
			if (a[i] != inf) stop = false;
		}
		// cout << '\n';
		if (stop == true) break;
	}
	cout << res;
    return 0;
}

Subtask #1
30.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 4 ms 604 KB Output isn't correct
5 Correct 11 ms 860 KB Output is correct
6 Execution timed out 1095 ms 1628 KB Time limit exceeded
7 Execution timed out 1018 ms 1624 KB Time limit exceeded