oj.uz

Submission #883239

# Submission time Handle Problem Language Result Execution time Memory
883239 2023-12-04T20:42:15 Z SalihSahin Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 53 ms 14024 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
 
using namespace std;
const int inf = 2e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;

int hizalay(int &y){
    if(y >= 2){
        int k = y - 2;
        y = 2;
        return k;
    }
    else{
        int k = 1 - y;
        y = 1;
        return k;
    }
}

int hizalax(int &x, int n){
    if(x >= n){
        int k = x - n;
        x = n;
        return k;
    }
    else if(x <= 1){
        int k = 1 - x;
        x = 1;
        return k;
    }
    else return 0;
}

int32_t main(){
    ios_base::sync_with_stdio(false), cin.tie();
    int n;
    cin>>n;
    vector<pair<int, int> > a(n*2);
    vector<vector<int> > grid(n+1, vector<int>(2));
    int ans = 0, sz;

    for(int i = 0; i < 2*n; i++){
        cin>>a[i].first>>a[i].second;
        ans += hizalay(a[i].second);
        ans += hizalax(a[i].first, n);
        a[i].first--, a[i].second--;
        grid[a[i].first][a[i].second]++;
    }

    vector<int> rem[2];
    for(int i = 0; i < n; i++){
        int cnt = min((int)(rem[1].size()), grid[i][1]);
        sz = rem[1].size();
        for(int j = sz-1; j >= sz - cnt; j--){
            ans += (i - rem[1][j]);
            rem[1].pop_back();
        }
        grid[i][1] -= cnt;

        cnt = min((int)(rem[0].size()), grid[i][0]);
        sz = rem[0].size();
        for(int j = sz-1; j >= sz - cnt; j--){
            ans += (i - rem[0][j]);
            rem[0].pop_back();
        }
        grid[i][0] -= cnt;
        if(rem[0].size() && grid[i][1]){
            cnt = min((int)(rem[0].size()), grid[i][1] - 1);
            sz = rem[0].size();
            for(int j = sz-1; j >= sz - cnt; j--){
                ans += (i - rem[0][j] + 1);
                rem[0].pop_back();
            }
            grid[i][1] -= cnt;
        }
        if(rem[1].size() && grid[i][0]){
            cnt = min((int)(rem[1].size()), grid[i][0] - 1);
            sz = rem[1].size();
            for(int j = sz-1; j >= sz - cnt; j--){
                ans += (i - rem[1][j] + 1);
                rem[1].pop_back();
            }
            grid[i][0] -= cnt;
        }

        if(grid[i][1] > 1 && !grid[i][0]){
            ans++;
            grid[i][1]--;
            grid[i][0]++;
        }
        if(!grid[i][1] && grid[i][0] > 1){
            ans++;
            grid[i][0]--;
            grid[i][1]++;
        }

        if(grid[i][1] > 1){
            int ver = grid[i][1] - 1;
            grid[i+1][1] += ver;
            grid[i][1] -= ver;
            ans += ver;
        }
        if(grid[i][0] > 1){
            int ver = grid[i][0] - 1;
            grid[i+1][0] += ver;
            grid[i][0] -= ver;
            ans += ver;
        }

        if(!grid[i][1]) rem[1].pb(i);
        if(!grid[i][0]) rem[0].pb(i);
    }

    cout<<ans<<endl;
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 544 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 472 KB Output is correct
44 Correct 1 ms 464 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 580 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 31 ms 10576 KB Output is correct
66 Correct 42 ms 13524 KB Output is correct
67 Correct 41 ms 12112 KB Output is correct
68 Correct 42 ms 12112 KB Output is correct
69 Correct 42 ms 12112 KB Output is correct
70 Correct 39 ms 12124 KB Output is correct
71 Correct 40 ms 12116 KB Output is correct
72 Correct 36 ms 13168 KB Output is correct
73 Correct 39 ms 14024 KB Output is correct
74 Correct 35 ms 12516 KB Output is correct
75 Correct 36 ms 12392 KB Output is correct
76 Correct 36 ms 12752 KB Output is correct
77 Correct 40 ms 12860 KB Output is correct
78 Correct 35 ms 12748 KB Output is correct
79 Correct 42 ms 12892 KB Output is correct
80 Correct 36 ms 13008 KB Output is correct
81 Correct 38 ms 12384 KB Output is correct
82 Correct 36 ms 12488 KB Output is correct
83 Correct 36 ms 12664 KB Output is correct
84 Correct 41 ms 12112 KB Output is correct
85 Correct 36 ms 12124 KB Output is correct
86 Correct 36 ms 12104 KB Output is correct
87 Correct 36 ms 12240 KB Output is correct
88 Correct 40 ms 12112 KB Output is correct
89 Correct 38 ms 12112 KB Output is correct
90 Correct 53 ms 12116 KB Output is correct
91 Correct 42 ms 12112 KB Output is correct
92 Correct 42 ms 12272 KB Output is correct
93 Correct 40 ms 12112 KB Output is correct
94 Correct 39 ms 12372 KB Output is correct
95 Correct 42 ms 12124 KB Output is correct
96 Correct 37 ms 13764 KB Output is correct
97 Correct 38 ms 13764 KB Output is correct
98 Correct 39 ms 12368 KB Output is correct
99 Correct 38 ms 13012 KB Output is correct
100 Correct 37 ms 13004 KB Output is correct
101 Correct 37 ms 13516 KB Output is correct
102 Correct 38 ms 12612 KB Output is correct
103 Correct 37 ms 12384 KB Output is correct