oj.uz

Submission #155892

# Submission time Handle Problem Language Result Execution time Memory
155892 2019-10-01T17:02:26 Z popovicirobert Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 2 ms 380 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;


const ll INF = 1e18;

int main() {
#ifdef HOME
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    vector < vector <int> > fr(n + 1, vector <int>(3));
    ll ans = 0;

    for(i = 0; i < 2 * n; i++) {
        int x, y;
        cin >> x >> y;
        if(x < 1) {
            ans += 1 - x;
            x = 1;
        }
        if(x > n) {
            ans += x - n;
            x = n;
        }
        if(y > 2) {
            ans += y - 2;
            y = 2;
        }
        if(y < 1) {
            ans += 1 - y;
            y = 1;
        }
        fr[x][y]++;
    }

    int cnt = 0;
    for(i = 1; i <= n; i++) {
        cnt += fr[i][1];
        cnt -= fr[i][2];
    }

    deque <int> need[3];
    deque <int> have[3];

    auto get = [&](int x, int y) {
        int ans = abs(have[x].front() - need[y].front());
        have[x].pop_front();
        need[y].pop_front();
        return ans;
    };

    for(i = 1; i <= n; i++) {
        need[1].push_back(i);
        need[2].push_back(i);

        while(fr[i][1]--) {
            have[1].push_back(i);
        }
        while(fr[i][2]--) {
            have[2].push_back(i);
        }

        while(have[1].size() && need[1].size()) {
            ans += get(1, 1);
        }
        while(have[2].size() && need[2].size()) {
            ans += get(2, 2);
        }
        while(have[1].size() && cnt > 0 && need[2].size()) {
            ans += get(1, 2) + 1;
            cnt--;
        }
        while(have[2].size() && cnt < 0 && need[1].size()) {
            ans += get(2, 1) + 1;
            cnt++;
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -