oj.uz

답안 #64950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64950 2018-08-06T09:11:35 Z forestryks Baloni (COCI15_baloni) C++14
100 / 100
 154 ms 19928 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

const int MAXN = 1e6 + 5;

int n;
int a;
int arrow[MAXN];

int main() {
    FAST_IO;
    cin >> n;

    int res = 0;
    rep(i, n) {
        cin >> a;
        if (!arrow[a]) {
            res++;
            arrow[a]++;
        }
        arrow[a]--;
        arrow[a - 1]++;
    }

    cout << res << endl;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 112 ms 4216 KB Output is correct
6 Correct 84 ms 7768 KB Output is correct
7 Correct 154 ms 10684 KB Output is correct
8 Correct 76 ms 13544 KB Output is correct
9 Correct 90 ms 16624 KB Output is correct
10 Correct 89 ms 19928 KB Output is correct