oj.uz

Submission #754797

# Submission time Handle Problem Language Result Execution time Memory
754797 2023-06-08T14:31:35 Z Kihihihi Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 86 ms 14348 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
#include <ctime>
#include <chrono>
#include <cstdio>
#include <random>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <fstream>
#include <functional>
#include <complex>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

const long long INF = 1e18, MOD = 1e9 + 7, MOD2 = 998244353, LOG = 18;
const long double EPS = 1e-9, PI = acos(-1);

void solve()
{
    long long n;
    vector<pair<long long, long long>> v;
    cin >> n;
    v.resize(n * 2);
    for (long long i = 0; i < n * 2; i++)
    {
        cin >> v[i].first >> v[i].second;
    }

    long long ans = 0;
    for (long long i = 0; i < n * 2; i++)
    {
        if (v[i].second >= 2)
        {
            ans += v[i].second - 2;
            v[i].second = 2;
        }
        else
        {
            ans += 1 - v[i].second;
            v[i].second = 1;
        }

        if (v[i].first >= n)
        {
            ans += v[i].first - n;
            v[i].first = n;
        }
        else if (v[i].first <= 1)
        {
            ans += 1 - v[i].first;
            v[i].first = 1;
        }
    }

    vector<vector<long long>> a(2, vector<long long>(n)), b = a;
    for (long long i = 0; i < n * 2; i++)
    {
        v[i].first--; v[i].second--;
        a[1 - v[i].second][v[i].first]++;
    }
    for (long long i = 0; i < 2; i++)
    {
        for (long long j = 0; j < n; j++)
        {
            if (!a[i][j])
            {
                b[i][j] = 1;
            }
            else
            {
                a[i][j]--;
            }
        }
    }

    vector<long long> up, down;
    bool toa = false;
    for (long long i = 0; i < n; i++)
    {
        if (toa)
        {
            while (a[0][i])
            {
                up.push_back(i);
                a[0][i]--;
            }
            while (a[1][i])
            {
                down.push_back(i);
                a[1][i]--;
            }
        }
        else
        {
            while (b[0][i])
            {
                up.push_back(i);
                b[0][i]--;
            }
            while (b[1][i])
            {
                down.push_back(i);
                b[1][i]--;
            }
        }

        if (toa)
        {
            while (b[0][i] && up.size())
            {
                ans += i - up.back();
                up.pop_back();
                b[0][i]--;
            }
            while (b[1][i] && down.size())
            {
                ans += i - down.back();
                down.pop_back();
                b[1][i]--;
            }
            while (b[1][i] && up.size())
            {
                ans += i - up.back() + 1;
                up.pop_back();
                b[1][i]--;
            }
            while (b[0][i] && down.size())
            {
                ans += i - down.back() + 1;
                down.pop_back();
                b[0][i]--;
            }
        }
        else
        {
            while (a[0][i] && up.size())
            {
                ans += i - up.back();
                up.pop_back();
                a[0][i]--;
            }
            while (a[1][i] && down.size())
            {
                ans += i - down.back();
                down.pop_back();
                a[1][i]--;
            }
            while (a[1][i] && up.size())
            {
                ans += i - up.back() + 1;
                up.pop_back();
                a[1][i]--;
            }
            while (a[0][i] && down.size())
            {
                ans += i - down.back() + 1;
                down.pop_back();
                a[0][i]--;
            }
        }

        while (a[0][i])
        {
            up.push_back(i);
            toa = true;
            a[0][i]--;
        }
        while (a[1][i])
        {
            down.push_back(i);
            toa = true;
            a[1][i]--;
        }
        while (b[0][i])
        {
            up.push_back(i);
            toa = false;
            b[0][i]--;
        }
        while (b[1][i])
        {
            down.push_back(i);
            toa = false;
            b[1][i]--;
        }
    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(time(NULL));

    int tst = 1;
    //cin >> tst;
    while (tst--)
    {
        solve();
    }

    return 0;
}

/*
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⠤⠖⠚⢉⣩⣭⡭⠛⠓⠲⠦⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢀⡴⠋⠁⠀⠀⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠳⢦⡀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⡴⠃⢀⡴⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⣆⠀⠀⠀
⠀⠀⠀⠀⡾⠁⣠⠋⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢧⠀⠀
⠀⠀⠀⣸⠁⢰⠃⠀⠀⠀⠈⢣⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣇⠀
⠀⠀⠀⡇⠀⡾⡀⠀⠀⠀⠀⣀⣹⣆⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⠀
⠀⠀⢸⠃⢀⣇⡈⠀⠀⠀⠀⠀⠀⢀⡑⢄⡀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⢸⠀⢻⡟⡻⢶⡆⠀⠀⠀⠀⡼⠟⡳⢿⣦⡑⢄⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⣸⠀⢸⠃⡇⢀⠇⠀⠀⠀⠀⠀⡼⠀⠀⠈⣿⡗⠂⠀⠀⠀⠀⠀⠀⠀⢸⠁
⠀⠀⡏⠀⣼⠀⢳⠊⠀⠀⠀⠀⠀⠀⠱⣀⣀⠔⣸⠁⠀⠀⠀⠀⠀⠀⠀⢠⡟⠀
⠀⠀⡇⢀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⢸⠃⠀
⠀⢸⠃⠘⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠁⠀⠀⢀⠀⠀⠀⠀⠀⣾⠀⠀
⠀⣸⠀⠀⠹⡄⠀⠀⠈⠁⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠸⠀⠀⠀⠀⠀⡇⠀⠀
⠀⡏⠀⠀⠀⠙⣆⠀⠀⠀⠀⠀⠀⠀⢀⣠⢶⡇⠀⠀⢰⡀⠀⠀⠀⠀⠀⡇⠀⠀
⢰⠇⡄⠀⠀⠀⡿⢣⣀⣀⣀⡤⠴⡞⠉⠀⢸⠀⠀⠀⣿⡇⠀⠀⠀⠀⠀⣧⠀⠀
⣸⠀⡇⠀⠀⠀⠀⠀⠀⠉⠀⠀⠀⢹⠀⠀⢸⠀⠀⢀⣿⠇⠀⠀⠀⠁⠀⢸⠀⠀
⣿⠀⡇⠀⠀⠀⠀⠀⢀⡤⠤⠶⠶⠾⠤⠄⢸⠀⡀⠸⣿⣀⠀⠀⠀⠀⠀⠈⣇⠀
⡇⠀⡇⠀⠀⡀⠀⡴⠋⠀⠀⠀⠀⠀⠀⠀⠸⡌⣵⡀⢳⡇⠀⠀⠀⠀⠀⠀⢹⡀
⡇⠀⠇⠀⠀⡇⡸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⠮⢧⣀⣻⢂⠀⠀⠀⠀⠀⠀⢧
⣇⠀⢠⠀⠀⢳⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⡎⣆⠀⠀⠀⠀⠀⠘
⢻⠀⠈⠰⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠘⢮⣧⡀⠀⠀⠀⠀
⠸⡆⠀⠀⠇⣾⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠆⠀⠀⠀⠀⠀⠀⠀⠙⠳⣄⡀⢢⡀
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
*/

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 380 KB Output is correct
58 Correct 2 ms 340 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 1 ms 380 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 380 KB Output is correct
65 Correct 33 ms 8120 KB Output is correct
66 Correct 61 ms 14348 KB Output is correct
67 Correct 45 ms 9712 KB Output is correct
68 Correct 44 ms 9708 KB Output is correct
69 Correct 45 ms 9788 KB Output is correct
70 Correct 48 ms 9696 KB Output is correct
71 Correct 49 ms 9704 KB Output is correct
72 Correct 46 ms 11112 KB Output is correct
73 Correct 43 ms 12532 KB Output is correct
74 Correct 46 ms 11236 KB Output is correct
75 Correct 47 ms 10980 KB Output is correct
76 Correct 43 ms 10860 KB Output is correct
77 Correct 45 ms 11240 KB Output is correct
78 Correct 47 ms 10856 KB Output is correct
79 Correct 44 ms 10556 KB Output is correct
80 Correct 64 ms 10984 KB Output is correct
81 Correct 86 ms 10976 KB Output is correct
82 Correct 44 ms 10088 KB Output is correct
83 Correct 44 ms 10432 KB Output is correct
84 Correct 47 ms 10212 KB Output is correct
85 Correct 43 ms 9828 KB Output is correct
86 Correct 79 ms 9824 KB Output is correct
87 Correct 47 ms 9820 KB Output is correct
88 Correct 47 ms 9824 KB Output is correct
89 Correct 46 ms 9696 KB Output is correct
90 Correct 45 ms 9776 KB Output is correct
91 Correct 46 ms 9696 KB Output is correct
92 Correct 54 ms 9828 KB Output is correct
93 Correct 56 ms 9828 KB Output is correct
94 Correct 44 ms 9708 KB Output is correct
95 Correct 44 ms 9564 KB Output is correct
96 Correct 44 ms 11880 KB Output is correct
97 Correct 45 ms 11612 KB Output is correct
98 Correct 48 ms 11748 KB Output is correct
99 Correct 44 ms 10996 KB Output is correct
100 Correct 43 ms 10972 KB Output is correct
101 Correct 43 ms 11628 KB Output is correct
102 Correct 44 ms 11368 KB Output is correct
103 Correct 48 ms 11368 KB Output is correct