oj.uz

Submission #155893

# Submission time Handle Problem Language Result Execution time Memory
155893 2019-10-01T17:13:05 Z popovicirobert Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 104 ms 11484 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() && need[2].size()) {
            ans += get(1, 2) + 1;
            cnt--;
        }
        while(have[2].size() && need[1].size()) {
            ans += get(2, 1) + 1;
            cnt++;
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
8.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct

Subtask #2
29.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 3 ms 552 KB Output is correct
43 Correct 3 ms 376 KB Output is correct
44 Correct 3 ms 376 KB Output is correct
45 Correct 3 ms 376 KB Output is correct
46 Correct 3 ms 376 KB Output is correct
47 Correct 3 ms 376 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 3 ms 380 KB Output is correct
50 Correct 1 ms 376 KB Output is correct
51 Correct 3 ms 504 KB Output is correct
52 Correct 3 ms 380 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 3 ms 504 KB Output is correct
56 Correct 3 ms 376 KB Output is correct
57 Correct 3 ms 376 KB Output is correct
58 Correct 3 ms 376 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 376 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 508 KB Output is correct
63 Correct 3 ms 508 KB Output is correct
64 Correct 3 ms 504 KB Output is correct

Subtask #3
63.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 3 ms 552 KB Output is correct
43 Correct 3 ms 376 KB Output is correct
44 Correct 3 ms 376 KB Output is correct
45 Correct 3 ms 376 KB Output is correct
46 Correct 3 ms 376 KB Output is correct
47 Correct 3 ms 376 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 3 ms 380 KB Output is correct
50 Correct 1 ms 376 KB Output is correct
51 Correct 3 ms 504 KB Output is correct
52 Correct 3 ms 380 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 3 ms 504 KB Output is correct
56 Correct 3 ms 376 KB Output is correct
57 Correct 3 ms 376 KB Output is correct
58 Correct 3 ms 376 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 376 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 508 KB Output is correct
63 Correct 3 ms 508 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 70 ms 7416 KB Output is correct
66 Correct 80 ms 11484 KB Output is correct
67 Correct 104 ms 8952 KB Output is correct
68 Correct 95 ms 8964 KB Output is correct
69 Correct 97 ms 8952 KB Output is correct
70 Correct 96 ms 9052 KB Output is correct
71 Correct 93 ms 9048 KB Output is correct
72 Correct 70 ms 10080 KB Output is correct
73 Correct 71 ms 10616 KB Output is correct
74 Correct 72 ms 9592 KB Output is correct
75 Correct 71 ms 9528 KB Output is correct
76 Correct 70 ms 9488 KB Output is correct
77 Correct 71 ms 9596 KB Output is correct
78 Correct 70 ms 9336 KB Output is correct
79 Correct 64 ms 9464 KB Output is correct
80 Correct 70 ms 9568 KB Output is correct
81 Correct 74 ms 9336 KB Output is correct
82 Correct 72 ms 9208 KB Output is correct
83 Correct 70 ms 9208 KB Output is correct
84 Correct 74 ms 9140 KB Output is correct
85 Correct 72 ms 9208 KB Output is correct
86 Correct 75 ms 9080 KB Output is correct
87 Correct 73 ms 9052 KB Output is correct
88 Correct 81 ms 8960 KB Output is correct
89 Correct 79 ms 9080 KB Output is correct
90 Correct 92 ms 8960 KB Output is correct
91 Correct 91 ms 9080 KB Output is correct
92 Correct 94 ms 9088 KB Output is correct
93 Correct 102 ms 9156 KB Output is correct
94 Correct 101 ms 8928 KB Output is correct
95 Correct 92 ms 8952 KB Output is correct
96 Correct 79 ms 10208 KB Output is correct
97 Correct 81 ms 10104 KB Output is correct
98 Correct 87 ms 9576 KB Output is correct
99 Correct 77 ms 9592 KB Output is correct
100 Correct 89 ms 9720 KB Output is correct
101 Correct 80 ms 9976 KB Output is correct
102 Correct 83 ms 9592 KB Output is correct
103 Correct 86 ms 9464 KB Output is correct