Submission #99087

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
99087	2019-02-28T14:02:54 Z	gs14004	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	104 ms	2168 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
using lint = long long;
using pi = pair<int, int>;

int n;
int cnt[2][MAXN];

int main(){
	scanf("%d",&n);
	lint dap = 0;
	for(int i=0; i<n*2; i++){
		int x, y; scanf("%d %d",&x,&y);
		if(x < 1){
			dap += 1 - x;
			x = 1;
		}
		if(x > n){
			dap += x - n;
			x = n;
		}
		if(y < 1){
			dap += 1 - y;
			y = 1;
		}
		if(y > 2){
			dap += y - 2;
			y = 2;
		}
		cnt[y-1][x]++;
	}
	for(int i=1; i<=n; i++){
		// free flow
		cnt[0][i]--;
		cnt[1][i]--;
		// cost 1 flow which I never have to negate
		if(1ll * cnt[0][i] * cnt[1][i] < 0){
			if(cnt[0][i] < 0){
				int delt = min(-cnt[0][i], cnt[1][i]);
				dap += delt;
				cnt[0][i] += delt; cnt[1][i] -= delt;
			}
			else{
				int delt = min(-cnt[1][i], cnt[0][i]);
				dap += delt;
				cnt[0][i] -= delt; cnt[1][i] += delt;
			}
		}
		// abandon center edge, and proceed recursively
		dap += abs(cnt[0][i]) + abs(cnt[1][i]);
		cnt[0][i+1] += cnt[0][i];
		cnt[1][i+1] += cnt[1][i];
	}
	cout << dap << endl;
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:14:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y; scanf("%d %d",&x,&y);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	304 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	3 ms	384 KB	Output is correct
36	Correct	4 ms	384 KB	Output is correct
37	Correct	3 ms	412 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	3 ms	384 KB	Output is correct
40	Correct	4 ms	384 KB	Output is correct
41	Correct	4 ms	380 KB	Output is correct
42	Correct	3 ms	384 KB	Output is correct
43	Correct	4 ms	384 KB	Output is correct
44	Correct	3 ms	384 KB	Output is correct
45	Correct	3 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	3 ms	384 KB	Output is correct
48	Correct	3 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	4 ms	384 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	3 ms	384 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	3 ms	384 KB	Output is correct
56	Correct	2 ms	384 KB	Output is correct
57	Correct	3 ms	384 KB	Output is correct
58	Correct	4 ms	384 KB	Output is correct
59	Correct	3 ms	324 KB	Output is correct
60	Correct	3 ms	384 KB	Output is correct
61	Correct	4 ms	384 KB	Output is correct
62	Correct	1 ms	320 KB	Output is correct
63	Correct	3 ms	384 KB	Output is correct
64	Correct	3 ms	384 KB	Output is correct
65	Correct	76 ms	1784 KB	Output is correct
66	Correct	64 ms	2168 KB	Output is correct
67	Correct	96 ms	1784 KB	Output is correct
68	Correct	74 ms	1784 KB	Output is correct
69	Correct	104 ms	1784 KB	Output is correct
70	Correct	75 ms	1784 KB	Output is correct
71	Correct	92 ms	1732 KB	Output is correct
72	Correct	62 ms	1784 KB	Output is correct
73	Correct	66 ms	1784 KB	Output is correct
74	Correct	61 ms	1784 KB	Output is correct
75	Correct	69 ms	1756 KB	Output is correct
76	Correct	63 ms	1912 KB	Output is correct
77	Correct	82 ms	1784 KB	Output is correct
78	Correct	68 ms	1788 KB	Output is correct
79	Correct	67 ms	1912 KB	Output is correct
80	Correct	84 ms	1848 KB	Output is correct
81	Correct	89 ms	1884 KB	Output is correct
82	Correct	100 ms	1784 KB	Output is correct
83	Correct	60 ms	1784 KB	Output is correct
84	Correct	59 ms	1756 KB	Output is correct
85	Correct	86 ms	1784 KB	Output is correct
86	Correct	63 ms	1784 KB	Output is correct
87	Correct	90 ms	1784 KB	Output is correct
88	Correct	99 ms	1784 KB	Output is correct
89	Correct	102 ms	1784 KB	Output is correct
90	Correct	84 ms	1784 KB	Output is correct
91	Correct	79 ms	1832 KB	Output is correct
92	Correct	83 ms	1784 KB	Output is correct
93	Correct	69 ms	1912 KB	Output is correct
94	Correct	69 ms	1660 KB	Output is correct
95	Correct	84 ms	1656 KB	Output is correct
96	Correct	63 ms	1824 KB	Output is correct
97	Correct	63 ms	1784 KB	Output is correct
98	Correct	62 ms	1784 KB	Output is correct
99	Correct	62 ms	1912 KB	Output is correct
100	Correct	92 ms	1912 KB	Output is correct
101	Correct	65 ms	1784 KB	Output is correct
102	Correct	67 ms	1784 KB	Output is correct
103	Correct	50 ms	1784 KB	Output is correct

Submission #99087

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