oj.uz

Submission #923219

# Submission time Handle Problem Language Result Execution time Memory
923219 2024-02-07T00:18:41 Z HorizonWest Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 47 ms 10524 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(998244353)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e15 + 7;

void print(bool x) { cout << (x ? "Yes" : "No") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

int Z(int x) 
{
    return (x * (x + 1)) / 2;
}

void solve()
{
    int n, ans = 0; cin >> n;
    vector <vector<int>> v(n + 1, vector <int> (3, 0));
    for(int i = 0; i < 2 * n; i++)
    {
        int x, y; cin >> x >> y;
        if(x < 1)
        {
            ans += abs(1 - x);
            x = 1;
        }

        if(x > n)
        {
            ans += abs(n - x);
            x = n;
        }

        if(y < 1)
        {
            ans += abs(1 - y);
            y = 1;
        }

        if(y > 2)
        {
            ans += abs(2 - y);
            y = 2;
        }

        v[x][y]++;
    }

    /*for(int j = 2; j >= 1; j--) 
    {
        for(int i = 1; i <= n; i++)
            cerr << v[i][j] << " ";
        cerr << endl;
    }
    cerr << ans << endl;*/

    int a = 0, b = 0;

    for(int i = 1; i <= n; i++)
    {
        ans += v[i-1][1] + v[i-1][2];
        v[i][1] += v[i-1][1];
        v[i][2] += v[i-1][2];

        a++; b++;

        if(v[i][1] > 0)
        {   
            while(min(a, v[i][1]) != 0)
            {
                ans += a - 1; a--;
                v[i][1]--;
            }
        }

        if(v[i][2] > 0)
        {
            while(min(b, v[i][2]) != 0)
            {
                ans += b - 1; b--;
                v[i][2]--;
            }
        }

        if(v[i][1] > 0)
        {
            while(min(b, v[i][1]) != 0)
            {
                ans += b; b--;
                v[i][1]--;
            }
        }

        if(v[i][2] > 0)
        {
            while(min(a, v[i][2]) != 0)
            {
                ans += a; a--;
                v[i][2]--;
            }
        }
    }

    cout << ans << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 452 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 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 348 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 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 452 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 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 344 KB Output is correct
36 Correct 1 ms 344 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 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 532 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 548 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 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 344 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 604 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 348 KB Output is correct
61 Correct 1 ms 472 KB Output is correct
62 Correct 1 ms 420 KB Output is correct
63 Correct 1 ms 540 KB Output is correct
64 Correct 1 ms 348 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 0 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 452 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 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 344 KB Output is correct
36 Correct 1 ms 344 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 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 532 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 548 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 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 344 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 604 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 348 KB Output is correct
61 Correct 1 ms 472 KB Output is correct
62 Correct 1 ms 420 KB Output is correct
63 Correct 1 ms 540 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 27 ms 7340 KB Output is correct
66 Correct 41 ms 10524 KB Output is correct
67 Correct 40 ms 9044 KB Output is correct
68 Correct 39 ms 9044 KB Output is correct
69 Correct 38 ms 9040 KB Output is correct
70 Correct 42 ms 8868 KB Output is correct
71 Correct 38 ms 9052 KB Output is correct
72 Correct 33 ms 9040 KB Output is correct
73 Correct 34 ms 9040 KB Output is correct
74 Correct 34 ms 9044 KB Output is correct
75 Correct 34 ms 8784 KB Output is correct
76 Correct 33 ms 9040 KB Output is correct
77 Correct 35 ms 9044 KB Output is correct
78 Correct 34 ms 9040 KB Output is correct
79 Correct 33 ms 9140 KB Output is correct
80 Correct 38 ms 9124 KB Output is correct
81 Correct 34 ms 9044 KB Output is correct
82 Correct 33 ms 9040 KB Output is correct
83 Correct 34 ms 9120 KB Output is correct
84 Correct 33 ms 9052 KB Output is correct
85 Correct 35 ms 8992 KB Output is correct
86 Correct 38 ms 9108 KB Output is correct
87 Correct 34 ms 9044 KB Output is correct
88 Correct 41 ms 8880 KB Output is correct
89 Correct 37 ms 9044 KB Output is correct
90 Correct 45 ms 9040 KB Output is correct
91 Correct 39 ms 9040 KB Output is correct
92 Correct 47 ms 9040 KB Output is correct
93 Correct 38 ms 9044 KB Output is correct
94 Correct 37 ms 8980 KB Output is correct
95 Correct 38 ms 8784 KB Output is correct
96 Correct 35 ms 9052 KB Output is correct
97 Correct 35 ms 9000 KB Output is correct
98 Correct 37 ms 9104 KB Output is correct
99 Correct 35 ms 9116 KB Output is correct
100 Correct 35 ms 9044 KB Output is correct
101 Correct 35 ms 9052 KB Output is correct
102 Correct 36 ms 9048 KB Output is correct
103 Correct 37 ms 9044 KB Output is correct