oj.uz

Submission #776101

# Submission time Handle Problem Language Result Execution time Memory
776101 2023-07-07T10:12:23 Z gun_gan Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 39 ms 5864 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 2e5 + 7;

ll N;
ll a[MX][3], b[MX];
ll ans = 0;
 
int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);
 
      cin >> N;
      for(int i = 0; i < 2 * N; i++) {
            ll x, y;
            cin >> x >> y;

            if(1 <= x && x <= N && 1 <= y && y <= 2) {
                  a[x][y]++;
            } else if(1 <= x && x <= N) {
                  if(y > 2) {
                        a[x][2]++;
                        ans += y - 2;
                  } else {
                        a[x][1]++;
                        ans += 1 - y;
                  }
            } else if(1 <= y && y <= 2) {
                  if(x < 1) {
                        a[1][y]++;
                        ans += 1 - x;
                  } else {
                        a[N][y]++;
                        ans += x - N;
                  }
            } else {
                  if(y > 2 && x < 1) {
                        a[1][2]++;
                        ans += 1 - x + y - 2;
                  } else if(y > 2 && x > N) {
                        a[N][2]++;
                        ans += x - N + y - 2;
                  } else if(y < 1 && x < 1) {
                        a[1][1]++;
                        ans += 1 - x + 1 - y;
                  } else {
                        a[N][1]++;
                        ans += x - N + 1 - y;
                  }
            }
      }

      int sum1 = 0, sum2 = 0;
      for(int i = 1; i <= N; i++) {
            sum1 += a[i][1] - 1;
            sum2 += a[i][2] - 1;

            if(sum1 > 0 && sum2 < 0) {
                  int t = min(sum1, -sum2);
                  ans += t;
                  sum1 -= t;
                  sum2 += t;
            }

            if(sum1 < 0 && sum2 > 0) {
                  int t = min(-sum1, sum2);
                  ans += t;
                  sum1 += t;
                  sum2 -= t;
            }

            ans += abs(sum1) + abs(sum2);
      }     

      // for(int i = 2; i >= 1; i--) {
      //       for(int j = 1; j <= N; j++) {
      //             cout << a[j][i] << " ";
      //       }
      //       cout << '\n';
      // }

      cout << ans << '\n';
      
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 344 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 340 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 340 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 352 KB Output is correct
56 Correct 1 ms 396 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 476 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 380 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 340 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 344 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 340 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 340 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 352 KB Output is correct
56 Correct 1 ms 396 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 476 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 380 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 21 ms 4196 KB Output is correct
66 Correct 34 ms 4940 KB Output is correct
67 Correct 33 ms 5848 KB Output is correct
68 Correct 30 ms 5852 KB Output is correct
69 Correct 30 ms 5732 KB Output is correct
70 Correct 39 ms 5840 KB Output is correct
71 Correct 33 ms 5728 KB Output is correct
72 Correct 29 ms 3500 KB Output is correct
73 Correct 28 ms 3512 KB Output is correct
74 Correct 34 ms 3512 KB Output is correct
75 Correct 29 ms 3400 KB Output is correct
76 Correct 29 ms 3532 KB Output is correct
77 Correct 37 ms 3400 KB Output is correct
78 Correct 28 ms 3532 KB Output is correct
79 Correct 28 ms 3524 KB Output is correct
80 Correct 29 ms 3528 KB Output is correct
81 Correct 30 ms 3536 KB Output is correct
82 Correct 29 ms 3532 KB Output is correct
83 Correct 28 ms 3552 KB Output is correct
84 Correct 31 ms 3916 KB Output is correct
85 Correct 28 ms 3772 KB Output is correct
86 Correct 29 ms 5452 KB Output is correct
87 Correct 29 ms 5260 KB Output is correct
88 Correct 29 ms 5732 KB Output is correct
89 Correct 31 ms 5732 KB Output is correct
90 Correct 30 ms 5716 KB Output is correct
91 Correct 29 ms 5836 KB Output is correct
92 Correct 29 ms 5864 KB Output is correct
93 Correct 30 ms 5836 KB Output is correct
94 Correct 29 ms 5732 KB Output is correct
95 Correct 32 ms 5732 KB Output is correct
96 Correct 30 ms 5136 KB Output is correct
97 Correct 28 ms 5060 KB Output is correct
98 Correct 31 ms 4880 KB Output is correct
99 Correct 31 ms 4592 KB Output is correct
100 Correct 29 ms 4608 KB Output is correct
101 Correct 29 ms 4840 KB Output is correct
102 Correct 32 ms 4812 KB Output is correct
103 Correct 28 ms 4556 KB Output is correct