oj.uz

Submission #702656

# Submission time Handle Problem Language Result Execution time Memory
702656 2023-02-24T17:29:12 Z stevancv Baloni (COCI15_baloni) C++14
100 / 100
 85 ms 30940 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 2e9;
vector<int> pos[N];
int ans[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        if (!pos[x + 1].empty()) {
            int j = pos[x + 1].back();
            pos[x + 1].pop_back();
            ans[j] = 0;
        }
        ans[i] = 1;
        pos[x].push_back(i);
    }
    int sum = 0;
    for (int i = 1; i <= n; i++) sum += ans[i];
    cout << sum << en;
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23776 KB Output is correct
2 Correct 12 ms 23740 KB Output is correct
3 Correct 13 ms 23824 KB Output is correct
4 Correct 12 ms 23828 KB Output is correct
5 Correct 81 ms 30556 KB Output is correct
6 Correct 85 ms 30940 KB Output is correct
7 Correct 69 ms 29544 KB Output is correct
8 Correct 65 ms 29444 KB Output is correct
9 Correct 74 ms 30096 KB Output is correct
10 Correct 73 ms 30156 KB Output is correct