oj.uz

Submission #496939

# Submission time Handle Problem Language Result Execution time Memory
496939 2021-12-22T07:18:59 Z armashka Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 64 ms 7964 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, x[N], y[N], cnt[N][3], ans;

void check(ll &a, ll &b) {
	if (a < 0 && b > 0) {
		ll mn = min(abs(a), abs(b));
		a += mn; b -= mn;
		ans += mn;
	}
	return;
}

const void solve(/*Armashka*/) {
	cin >> n;
	//cout << "\n";
	for (int i = 1; i <= 2 * n; ++ i) {
		cin >> x[i] >> y[i];
		if (y[i] > 2) ans += abs(y[i] - 2), y[i] = 2;
		if (y[i] < 1) ans += abs(y[i] - 1), y[i] = 1;
		if (x[i] > n) ans += abs(x[i] - n), x[i] = n;
		if (x[i] < 1) ans += abs(x[i] - 1), x[i] = 1;
		++ cnt[x[i]][y[i]];
	}
	//cout << ans << "\n";
	ll sum1 = 0, sum2 = 0;
	for (int i = 1; i <= n; ++ i) {
		sum1 += cnt[i][1] - 1;
		sum2 += cnt[i][2] - 1;
		//cout << sum1 << " " << sum2 << " -> ";
		check(sum1, sum2);
		check(sum2, sum1);
		//cout << sum1 << " " << sum2 << "\n";
		ans += abs(sum1); ans += abs(sum2);
	}		
	cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 0 ms 204 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 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 0 ms 204 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 0 ms 332 KB Output is correct
35 Correct 1 ms 372 KB Output is correct
36 Correct 1 ms 324 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 328 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 376 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 396 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 412 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 336 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 0 ms 204 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 0 ms 332 KB Output is correct
35 Correct 1 ms 372 KB Output is correct
36 Correct 1 ms 324 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 328 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 376 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 396 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 412 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 27 ms 7228 KB Output is correct
66 Correct 62 ms 5700 KB Output is correct
67 Correct 44 ms 7964 KB Output is correct
68 Correct 49 ms 7868 KB Output is correct
69 Correct 46 ms 7928 KB Output is correct
70 Correct 61 ms 7876 KB Output is correct
71 Correct 44 ms 7868 KB Output is correct
72 Correct 38 ms 5616 KB Output is correct
73 Correct 38 ms 5536 KB Output is correct
74 Correct 37 ms 5600 KB Output is correct
75 Correct 41 ms 5532 KB Output is correct
76 Correct 41 ms 5612 KB Output is correct
77 Correct 43 ms 5512 KB Output is correct
78 Correct 38 ms 5572 KB Output is correct
79 Correct 43 ms 5532 KB Output is correct
80 Correct 41 ms 5676 KB Output is correct
81 Correct 40 ms 5556 KB Output is correct
82 Correct 40 ms 5556 KB Output is correct
83 Correct 38 ms 5612 KB Output is correct
84 Correct 42 ms 5888 KB Output is correct
85 Correct 39 ms 6004 KB Output is correct
86 Correct 44 ms 7492 KB Output is correct
87 Correct 37 ms 7440 KB Output is correct
88 Correct 52 ms 7908 KB Output is correct
89 Correct 44 ms 7876 KB Output is correct
90 Correct 41 ms 7892 KB Output is correct
91 Correct 54 ms 7872 KB Output is correct
92 Correct 45 ms 7888 KB Output is correct
93 Correct 50 ms 7928 KB Output is correct
94 Correct 64 ms 7960 KB Output is correct
95 Correct 42 ms 7876 KB Output is correct
96 Correct 54 ms 7176 KB Output is correct
97 Correct 41 ms 7108 KB Output is correct
98 Correct 41 ms 6904 KB Output is correct
99 Correct 51 ms 6740 KB Output is correct
100 Correct 41 ms 6640 KB Output is correct
101 Correct 42 ms 6984 KB Output is correct
102 Correct 47 ms 6732 KB Output is correct
103 Correct 54 ms 6744 KB Output is correct