oj.uz

답안 #166901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166901 2019-12-04T13:55:47 Z apostoldaniel854 Money (IZhO17_money) C++14
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"

const int N = 1e6;

int a[1 + N], pos[1 + N];
int in_use[1 + N];

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pos[a[i]] = i;
    }
    int ans = 0;
    priority_queue <int> pq;
    for (int i = 1; i <= n; i++) {
        if (pq.size () && -pq.top () == i)
            pq.pop ();
        else
            ans++;
        int x = pos[i];
        in_use[x] = true;
        if (x + 1 <= n && !in_use[x + 1])
            pq.push (-a[x + 1]);
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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