oj.uz

Submission #209246

# Submission time Handle Problem Language Result Execution time Memory
209246 2020-03-13T13:22:51 Z ffao Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 94 ms 7908 KB 
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <memory.h>
#include <cmath>
#include <array>

using namespace std;

void re(int& x);

template<class T, class... Ts> void re(T& t, Ts&... ts);

void pr(long long x);

void pr(const char *x);

void ps();
template<class T, class... Ts> void ps(const T& t, const Ts&... ts);

#ifdef FFDBG

#else
#define dbg(x...) dsfdsfsdfasd
#endif

void re(int& x) { scanf("%d", &x); }

template<class T, class... Ts> void re(T& t, Ts&... ts) { 
    re(t); re(ts...); 
}

void pr(long long x) { printf("%lld", x); }

void pr(const char *x) { printf("%s", x); }

void ps() { pr("\n"); }
template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
    pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
}

#define all(v) (v).begin(), (v).end()

#define rep(i, a, b) for(int i = a; i < (b); ++i)

int n;
int coins[100010][3];

vector< int > fr[2];
vector< int > b[2];

void solve()
{
    long long ans = 0;

    re(n);
    rep(i,0,2*n) {
        int x,y;
        re(x,y);
        if (x < 1) {
            ans += 1-x;
            x = 1;
        }
        if (x > n) {
            ans += x-n;
            x = n;
        }
        if (y < 1) {
            ans += 1-y;
            y = 1;
        }
        if (y > 2) {
            ans += y-2;
            y = 2;
        }

        x--; y--;
        //dbg(x,y);
        coins[x][y]++;
    }

    rep(x,0,n) rep(y,0,2) if (!coins[x][y]) fr[y].push_back(x);

    rep(i,0,2) sort(all(fr[i]),greater<int>());

    rep(x,0,n) {
        rep(y,0,2) if (!b[y].empty()) {
            if (coins[x][y] == 0) {
                ans += x - b[y].back();
                b[y].pop_back();
                fr[y].pop_back();
                coins[x][y]++;
            }
            
            if (coins[x][1-y] == 0 && !b[y].empty() && b[1-y].empty()) {
                ans += x - b[y].back() + 1;
                b[y].pop_back();
                fr[1-y].pop_back();
                coins[x][1-y]++;
            }
        }

        rep(y,0,2) {
            //dbg(x,y,coins[x][y]);
            while (coins[x][y] > 1) {
                if (!fr[y].empty() && fr[y].back() <= x) {
                    //dbg(x,y,"->",fr[y].back(),y);
                    ans += x - fr[y].back();
                    fr[y].pop_back();
                }
                else if (!fr[1-y].empty() && fr[1-y].back() <= x) {
                    if (coins[x][1-y] > 1) {
                        coins[x][1-y]--;
                        //dbg(x,y,"->",fr[1-y].back(),1-y);
                        ans += x - fr[1-y].back();
                        fr[1-y].pop_back();
                        continue;
                    }

                    ans += x - fr[1-y].back() + 1;
                    fr[1-y].pop_back();
                }
                else {
                    //dbg("go to b",x,y);
                    b[y].push_back(x);
                }

                coins[x][y]--;
            }
        }
    }

    //dbg(sz(b[0]), sz(b[1]));
    ps(ans);
}

int main() {

    solve();
}

Compilation message

joi2019_ho_t4.cpp: In function 'void re(int&)':
joi2019_ho_t4.cpp:32:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void re(int& x) { scanf("%d", &x); }
                   ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 380 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 5 ms 376 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 380 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 6 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 6 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 380 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 6 ms 376 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 6 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 6 ms 376 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 6 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 380 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 6 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 6 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 380 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 6 ms 376 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 6 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 6 ms 376 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 6 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 61 ms 3068 KB Output is correct
66 Correct 76 ms 7908 KB Output is correct
67 Correct 86 ms 5172 KB Output is correct
68 Correct 88 ms 5112 KB Output is correct
69 Correct 88 ms 5148 KB Output is correct
70 Correct 84 ms 5112 KB Output is correct
71 Correct 85 ms 5112 KB Output is correct
72 Correct 83 ms 5868 KB Output is correct
73 Correct 79 ms 4596 KB Output is correct
74 Correct 82 ms 5960 KB Output is correct
75 Correct 93 ms 5740 KB Output is correct
76 Correct 84 ms 5868 KB Output is correct
77 Correct 82 ms 4944 KB Output is correct
78 Correct 88 ms 5712 KB Output is correct
79 Correct 83 ms 4844 KB Output is correct
80 Correct 88 ms 4676 KB Output is correct
81 Correct 82 ms 5864 KB Output is correct
82 Correct 85 ms 5228 KB Output is correct
83 Correct 85 ms 4972 KB Output is correct
84 Correct 87 ms 5608 KB Output is correct
85 Correct 87 ms 5612 KB Output is correct
86 Correct 85 ms 5620 KB Output is correct
87 Correct 85 ms 5616 KB Output is correct
88 Correct 92 ms 5620 KB Output is correct
89 Correct 89 ms 5620 KB Output is correct
90 Correct 86 ms 5360 KB Output is correct
91 Correct 90 ms 5364 KB Output is correct
92 Correct 86 ms 5492 KB Output is correct
93 Correct 82 ms 5364 KB Output is correct
94 Correct 90 ms 5248 KB Output is correct
95 Correct 83 ms 5236 KB Output is correct
96 Correct 82 ms 5236 KB Output is correct
97 Correct 80 ms 5236 KB Output is correct
98 Correct 83 ms 5976 KB Output is correct
99 Correct 84 ms 5228 KB Output is correct
100 Correct 87 ms 5532 KB Output is correct
101 Correct 84 ms 5404 KB Output is correct
102 Correct 94 ms 6256 KB Output is correct
103 Correct 85 ms 6000 KB Output is correct