oj.uz

Submission #497191

# Submission time Handle Problem Language Result Execution time Memory
497191 2021-12-22T16:08:14 Z ergagan Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 63 ms 5072 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
#define pll pair<ll,ll>

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, x, y, a[5][N], sum[5];

void solve() {
    ll n, ans = 0;
    cin >> n;
    for(ll i = 1; i <= 2 * n; i++) {
        cin >> y >> x;
        if(1 <= x && x <= 2 && 1 <= y && y <= n) a[x][y]++;
        else if(x < 1 && y < 1) {
            a[1][1]++;
            ans += abs(x - 1), ans += abs(y - 1);
        }
        else if(x < 1 && y > n) {
            a[1][n]++;
            ans += abs(x - 1), ans += abs(y - n);
        }
        else if(y < 1 && x > 2) {
            a[2][1]++;
            ans += abs(x - 2), ans += abs(y - 1);
        }
        else if(x > 2 && y > n) {
            a[2][n]++;
            ans += abs(x - 2), ans += abs(y - n);
        }
        else if(1 <= x && x <= 2 && y < 1)
            a[x][1]++, ans += abs(y - 1);

        else if(1 <= x && x <= 2 && y > n)
            a[x][n]++, ans += abs(y - n);

        else if(1 <= y && y <= n && x < 1)
            a[1][y]++, ans += abs(x - 1);

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

//    cout << ans << "\n";
//
//    for(ll i = 1; i <= 2; i++) {
//        for(ll j = 1; j <= n; j++) {
//            cout << a[i][j] << " ";
//        }
//        cout << "\n";
//    }

    for(ll i = 1; i <= n; i++) {
        sum[1] += a[1][i] - 1;
        sum[2] += a[2][i] - 1;

        ll x = min(abs(sum[1]), abs(sum[2]));

        if(sum[1] > 0 && sum[2] < 0)
            sum[1] -= x, sum[2] += x, ans += x;

        if(sum[2] > 0 && sum[1] < 0)
            sum[2] -= x, sum[1] += x, ans += x;

        ans += abs(sum[1]) + abs(sum[2]);
    }

    cout << ans;
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 324 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 324 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 368 KB Output is correct
45 Correct 1 ms 376 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 356 KB Output is correct
51 Correct 1 ms 356 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 324 KB Output is correct
54 Correct 1 ms 380 KB Output is correct
55 Correct 2 ms 312 KB Output is correct
56 Correct 1 ms 312 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 388 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 29 ms 3404 KB Output is correct
66 Correct 56 ms 4900 KB Output is correct
67 Correct 48 ms 5048 KB Output is correct
68 Correct 43 ms 5056 KB Output is correct
69 Correct 44 ms 5072 KB Output is correct
70 Correct 44 ms 5068 KB Output is correct
71 Correct 54 ms 5072 KB Output is correct
72 Correct 44 ms 3508 KB Output is correct
73 Correct 43 ms 3516 KB Output is correct
74 Correct 51 ms 3524 KB Output is correct
75 Correct 53 ms 3428 KB Output is correct
76 Correct 63 ms 3532 KB Output is correct
77 Correct 43 ms 3400 KB Output is correct
78 Correct 37 ms 3524 KB Output is correct
79 Correct 42 ms 3528 KB Output is correct
80 Correct 39 ms 3524 KB Output is correct
81 Correct 37 ms 3532 KB Output is correct
82 Correct 41 ms 3576 KB Output is correct
83 Correct 38 ms 3580 KB Output is correct
84 Correct 41 ms 4144 KB Output is correct
85 Correct 55 ms 4148 KB Output is correct
86 Correct 56 ms 5056 KB Output is correct
87 Correct 55 ms 5056 KB Output is correct
88 Correct 57 ms 5060 KB Output is correct
89 Correct 56 ms 5060 KB Output is correct
90 Correct 57 ms 5068 KB Output is correct
91 Correct 40 ms 5064 KB Output is correct
92 Correct 45 ms 4332 KB Output is correct
93 Correct 61 ms 5064 KB Output is correct
94 Correct 50 ms 4936 KB Output is correct
95 Correct 42 ms 4148 KB Output is correct
96 Correct 40 ms 4040 KB Output is correct
97 Correct 44 ms 4024 KB Output is correct
98 Correct 47 ms 4420 KB Output is correct
99 Correct 49 ms 4228 KB Output is correct
100 Correct 53 ms 3876 KB Output is correct
101 Correct 62 ms 3980 KB Output is correct
102 Correct 47 ms 4292 KB Output is correct
103 Correct 54 ms 4204 KB Output is correct