oj.uz

답안 #1115323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115323 2024-11-20T10:34:18 Z vjudge1 Money (IZhO17_money) C++17
0 / 100
 2 ms 2552 KB 
#include "bits/stdc++.h"

using namespace std;

const int mxN = 1000006;
int N;

struct fwtree {
	int ar[mxN];

	void add(int i, int x) {
		for (++ i; i <= N; i += i & -i) {
			ar[i] += x;
		}
	}

	int qry(int i) {
		int r = 0;
		for (++ i; i; i -= i & -i) {
			r += ar[i];
		}
		return r;
	}

	int qry(int i, int j) {
		return qry(j) - qry(i - 1);
	}
} fw;

int a[mxN];

void solve() {
	cin >> N;

	for (int i = 0; i < N; i ++) {
		cin >> a[i];
	}

	int ans = 0;
	for (int i = 0; i < N; i ++) {
		int d = a[i];
		int c = i;
		fw.add(d, 1);
		for (int j = i + 1; j < N; j ++) {
			if (a[j - 1] < a[j] && j - c == fw.qry(d, a[j])) {
				fw.add(a[j], 1);
				i = j;
			} else {
				break;
			}
		}
		ans ++;
	}

	cout << ans << endl;
}

int main() {
	solve();
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2496 KB Output is correct
3 Correct 2 ms 2384 KB Output is correct
4 Incorrect 1 ms 2552 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2496 KB Output is correct
3 Correct 2 ms 2384 KB Output is correct
4 Incorrect 1 ms 2552 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2496 KB Output is correct
3 Correct 2 ms 2384 KB Output is correct
4 Incorrect 1 ms 2552 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2496 KB Output is correct
3 Correct 2 ms 2384 KB Output is correct
4 Incorrect 1 ms 2552 KB Output isn't correct
5 Halted 0 ms 0 KB -