Submission #486780

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
486780	2021-11-12T18:31:09 Z	socho	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	49 ms	5848 KB

joi2019_ho_t4

/*
	Going for full
*/
#include <bits/stdc++.h>
using namespace std;
void fast() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
	srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
	long long a = rand();
	long long b = rand();
	return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
	freopen("problem.in", "r", stdin); 
	freopen("problem.out", "w", stdout);
}
template<typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
#define endl '\n'
// #define double long double
#define int long long
// const int MOD = 1000 * 1000 * 1000 + 7;
// const int MOD = 998244353;
// #define cerr if(0) cerr
#define debug(x) cerr << #x << ": " << x << endl;

int n;
const int MXN = 100005;
int x[MXN * 2], y[MXN * 2];
 
int at[MXN][3];
int pf[MXN][3];
int ans;
 
signed main() {
	
	ran(); fast();
 
	cin >> n;
	
	for (int i=0; i<2*n; i++) {
		int x, y;
		cin >> x >> y;
		if (x < 1) {
			ans += (1 - x);
			x = 1;
		}
		if (x > n) {
			ans += (x - n);
			x = n;
		}
		if (y < 1) {
			ans += (1 - y);
			y = 1;
		}
		if (y > 2) {
			ans += (y - 2);
			y = 2;
		}
		at[x][y]++;
	}
	
	int res1 = 0;
	int res2 = 0;
	
	for (int i=1; i<=n; i++) {
		res1 += at[i][1] - 1;
		res2 += at[i][2] - 1;
		if (res1 > 0 && res2 < 0) {
			int t = min(res1, -res2);
			ans += t;
			res1 -= t;
			res2 += t;
		}
		if (res2 > 0 && res1 < 0) {
			int t = min(res2, -res1);
			ans += t;
			res2 -= t;
			res1 += t;
		}
		ans += abs(res1) + abs(res2);
	}
	
	
	cout << ans << endl;
 
}

Compilation message

joi2019_ho_t4.cpp: In function 'void usaco()':
joi2019_ho_t4.cpp:18:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  freopen("problem.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:19:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  freopen("problem.out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	324 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 ms	336 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	336 KB	Output is correct
20	Correct	0 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	0 ms	324 KB	Output is correct
24	Correct	0 ms	208 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	0 ms	208 KB	Output is correct
27	Correct	0 ms	208 KB	Output is correct
28	Correct	1 ms	208 KB	Output is correct
29	Correct	0 ms	336 KB	Output is correct
30	Correct	0 ms	336 KB	Output is correct
31	Correct	1 ms	208 KB	Output is correct
32	Correct	0 ms	336 KB	Output is correct
33	Correct	0 ms	336 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	1 ms	376 KB	Output is correct
36	Correct	1 ms	336 KB	Output is correct
37	Correct	1 ms	336 KB	Output is correct
38	Correct	1 ms	336 KB	Output is correct
39	Correct	1 ms	336 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	336 KB	Output is correct
42	Correct	1 ms	336 KB	Output is correct
43	Correct	1 ms	336 KB	Output is correct
44	Correct	1 ms	332 KB	Output is correct
45	Correct	1 ms	292 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	336 KB	Output is correct
48	Correct	1 ms	336 KB	Output is correct
49	Correct	1 ms	336 KB	Output is correct
50	Correct	1 ms	336 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	336 KB	Output is correct
55	Correct	1 ms	336 KB	Output is correct
56	Correct	1 ms	336 KB	Output is correct
57	Correct	1 ms	336 KB	Output is correct
58	Correct	1 ms	336 KB	Output is correct
59	Correct	1 ms	336 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	336 KB	Output is correct
62	Correct	1 ms	372 KB	Output is correct
63	Correct	1 ms	336 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	344 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	324 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 ms	336 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	336 KB	Output is correct
20	Correct	0 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	0 ms	324 KB	Output is correct
24	Correct	0 ms	208 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	0 ms	208 KB	Output is correct
27	Correct	0 ms	208 KB	Output is correct
28	Correct	1 ms	208 KB	Output is correct
29	Correct	0 ms	336 KB	Output is correct
30	Correct	0 ms	336 KB	Output is correct
31	Correct	1 ms	208 KB	Output is correct
32	Correct	0 ms	336 KB	Output is correct
33	Correct	0 ms	336 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	1 ms	376 KB	Output is correct
36	Correct	1 ms	336 KB	Output is correct
37	Correct	1 ms	336 KB	Output is correct
38	Correct	1 ms	336 KB	Output is correct
39	Correct	1 ms	336 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	336 KB	Output is correct
42	Correct	1 ms	336 KB	Output is correct
43	Correct	1 ms	336 KB	Output is correct
44	Correct	1 ms	332 KB	Output is correct
45	Correct	1 ms	292 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	336 KB	Output is correct
48	Correct	1 ms	336 KB	Output is correct
49	Correct	1 ms	336 KB	Output is correct
50	Correct	1 ms	336 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	336 KB	Output is correct
55	Correct	1 ms	336 KB	Output is correct
56	Correct	1 ms	336 KB	Output is correct
57	Correct	1 ms	336 KB	Output is correct
58	Correct	1 ms	336 KB	Output is correct
59	Correct	1 ms	336 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	336 KB	Output is correct
62	Correct	1 ms	372 KB	Output is correct
63	Correct	1 ms	336 KB	Output is correct
64	Correct	1 ms	336 KB	Output is correct
65	Correct	24 ms	4168 KB	Output is correct
66	Correct	49 ms	4920 KB	Output is correct
67	Correct	37 ms	5848 KB	Output is correct
68	Correct	39 ms	5732 KB	Output is correct
69	Correct	39 ms	5832 KB	Output is correct
70	Correct	39 ms	5732 KB	Output is correct
71	Correct	37 ms	5844 KB	Output is correct
72	Correct	35 ms	3508 KB	Output is correct
73	Correct	35 ms	3504 KB	Output is correct
74	Correct	37 ms	3524 KB	Output is correct
75	Correct	36 ms	3396 KB	Output is correct
76	Correct	35 ms	3524 KB	Output is correct
77	Correct	35 ms	3400 KB	Output is correct
78	Correct	37 ms	3508 KB	Output is correct
79	Correct	34 ms	3520 KB	Output is correct
80	Correct	35 ms	3540 KB	Output is correct
81	Correct	35 ms	3524 KB	Output is correct
82	Correct	35 ms	3544 KB	Output is correct
83	Correct	35 ms	3560 KB	Output is correct
84	Correct	35 ms	3760 KB	Output is correct
85	Correct	34 ms	3756 KB	Output is correct
86	Correct	36 ms	5280 KB	Output is correct
87	Correct	36 ms	5280 KB	Output is correct
88	Correct	41 ms	5828 KB	Output is correct
89	Correct	39 ms	5720 KB	Output is correct
90	Correct	38 ms	5736 KB	Output is correct
91	Correct	38 ms	5728 KB	Output is correct
92	Correct	34 ms	5824 KB	Output is correct
93	Correct	35 ms	5828 KB	Output is correct
94	Correct	37 ms	5700 KB	Output is correct
95	Correct	36 ms	5724 KB	Output is correct
96	Correct	37 ms	5116 KB	Output is correct
97	Correct	38 ms	5056 KB	Output is correct
98	Correct	39 ms	4804 KB	Output is correct
99	Correct	36 ms	4548 KB	Output is correct
100	Correct	36 ms	4612 KB	Output is correct
101	Correct	39 ms	4960 KB	Output is correct
102	Correct	39 ms	4664 KB	Output is correct
103	Correct	35 ms	4560 KB	Output is correct

Submission #486780

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 63.0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
63.0 / 63.0