Submission #369385

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
369385	2021-02-21T13:55:05 Z	AriaH	Coin Collecting (JOI19_ho_t4)	C++11	100 / 100	62 ms	5996 KB

joi2019_ho_t4

/** Im the best because i work as hard as i possibly can **/

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);
#define endl                        "\n"

const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll inf = 8e18;
const int LOG = 22;

ll pw(ll a , ll b, ll M)  { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); }

ll tot;

ll n, A[N][3], cnt[3];

int main()
{
	scanf("%lld", &n);
	for(int i = 1; i <= n << 1; i ++)
	{
		ll x, y; scanf("%lld%lld", &x, &y);
		if(x < 1)
		{
			tot += 1 - x;
			x = 1;
		}
		if(x > n)
		{
			tot += x - n;
			x = n;
		}
		if(y < 1)
		{
			tot += 1 - y;
			y = 1;
		}
		if(y > 2)
		{
			tot += y - 2;
			y = 2;
		}
		A[x][y] ++;
	}
	for(int i = 1; i <= n; i ++)
	{
		cnt[1] += A[i][1] - 1;
		cnt[2] += A[i][2] - 1;
		if(cnt[1] < 0 && cnt[2] > 0)
		{
			ll cu = min(-cnt[1], cnt[2]);
			tot += cu;
			cnt[1] += cu;
			cnt[2] -= cu;
		}
		else if(cnt[2] < 0 && cnt[1] > 0)
		{
			ll cu = min(-cnt[2], cnt[1]);
			tot += cu;
			cnt[2] += cu;
			cnt[1] -= cu;
		}
		tot += abs(cnt[1]);
		tot += abs(cnt[2]);
	}
	printf("%lld\n", tot);
    return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	364 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	2 ms	364 KB	Output is correct
54	Correct	1 ms	364 KB	Output is correct
55	Correct	1 ms	364 KB	Output is correct
56	Correct	1 ms	364 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	1 ms	364 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	1 ms	364 KB	Output is correct
65	Correct	45 ms	4204 KB	Output is correct
66	Correct	62 ms	5120 KB	Output is correct
67	Correct	60 ms	5996 KB	Output is correct
68	Correct	54 ms	5868 KB	Output is correct
69	Correct	54 ms	5868 KB	Output is correct
70	Correct	57 ms	5996 KB	Output is correct
71	Correct	54 ms	5868 KB	Output is correct
72	Correct	50 ms	3692 KB	Output is correct
73	Correct	47 ms	3692 KB	Output is correct
74	Correct	51 ms	3564 KB	Output is correct
75	Correct	49 ms	3436 KB	Output is correct
76	Correct	48 ms	3564 KB	Output is correct
77	Correct	49 ms	3596 KB	Output is correct
78	Correct	48 ms	3564 KB	Output is correct
79	Correct	48 ms	3692 KB	Output is correct
80	Correct	48 ms	3712 KB	Output is correct
81	Correct	48 ms	3604 KB	Output is correct
82	Correct	49 ms	3564 KB	Output is correct
83	Correct	48 ms	3564 KB	Output is correct
84	Correct	49 ms	3948 KB	Output is correct
85	Correct	50 ms	3972 KB	Output is correct
86	Correct	61 ms	5612 KB	Output is correct
87	Correct	51 ms	5484 KB	Output is correct
88	Correct	52 ms	5868 KB	Output is correct
89	Correct	52 ms	5868 KB	Output is correct
90	Correct	55 ms	5868 KB	Output is correct
91	Correct	54 ms	5868 KB	Output is correct
92	Correct	56 ms	5996 KB	Output is correct
93	Correct	55 ms	5996 KB	Output is correct
94	Correct	54 ms	5740 KB	Output is correct
95	Correct	54 ms	5740 KB	Output is correct
96	Correct	50 ms	5228 KB	Output is correct
97	Correct	51 ms	5100 KB	Output is correct
98	Correct	52 ms	4972 KB	Output is correct
99	Correct	50 ms	4588 KB	Output is correct
100	Correct	51 ms	4692 KB	Output is correct
101	Correct	51 ms	4972 KB	Output is correct
102	Correct	50 ms	4716 KB	Output is correct
103	Correct	51 ms	4588 KB	Output is correct

Submission #369385

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