Submission #478554

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
478554	2021-10-08T01:37:03 Z	MonkeyKing	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	51 ms	4808 KB

joi2019_ho_t4

#include <numeric>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#include <time.h>
#define Endl endl
#define mp make_pair
#define mt make_tuple
#define ll long long 
#define ull unsigned long long
#define pii pair<int,int>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define quickcin ios_base::sync_with_stdio(false);
const int mod=1000000007;
const int gmod=3;
const int inf=1039074182;
const double eps=1e-9;
const double pi=3.141592653589793238462643383279;
const ll llinf=2LL*inf*inf;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
inline void chadd(int &x,int b) {x+=b-mod;x+=(x>>31 & mod);}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
template <typename T> inline T mabs(T x) {return (x<0?-x:x);}
using namespace std;
int n;
typedef pair<ll,ll> pll;
vector<pll> U,D;
int t[4];

ll calc(pll x,pll y)
{
	return mabs(x.first-y.first)+mabs((ll)x.second-y.second);
}

int cnt[100005][3];
ll res;
int main()
{
	// freopen("c.in"	,"r",stdin);
	// freopen("c.out","w",stdout);
	cin>>n;
	for(int i=0;i<n*2;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		ll nx=min(max(x,1),n),ny=min(max(y,1),2);
		res+=mabs(nx-x)+mabs(ny-y);
		cnt[(int)nx][(int)ny]++;
	}
	for(int i=1;i<=n;i++)
	{
		cnt[i][1]--;cnt[i][2]--;
		if(1LL*cnt[i][1]*cnt[i][2]<0)
		{
			int tr=min(mabs(cnt[i][1]),mabs(cnt[i][2]));
			if(cnt[i][1]<0) cnt[i][1]+=tr;else cnt[i][1]-=tr;
			if(cnt[i][2]<0) cnt[i][2]+=tr;else cnt[i][2]-=tr;
			res+=tr;
		}
		cnt[i+1][1]+=cnt[i][1];
		cnt[i+1][2]+=cnt[i][2];
		res+=mabs(cnt[i][1])+mabs(cnt[i][2]);
	}
	cout<<res<<endl;
	return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	216 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	1 ms	204 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	1 ms	204 KB	Output is correct
50	Correct	1 ms	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	1 ms	204 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	1 ms	204 KB	Output is correct
57	Correct	1 ms	204 KB	Output is correct
58	Correct	1 ms	204 KB	Output is correct
59	Correct	1 ms	204 KB	Output is correct
60	Correct	1 ms	204 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	1 ms	204 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct
64	Correct	1 ms	204 KB	Output is correct
65	Correct	32 ms	1464 KB	Output is correct
66	Correct	50 ms	1440 KB	Output is correct
67	Correct	47 ms	1476 KB	Output is correct
68	Correct	46 ms	1444 KB	Output is correct
69	Correct	51 ms	1356 KB	Output is correct
70	Correct	48 ms	1356 KB	Output is correct
71	Correct	50 ms	1448 KB	Output is correct
72	Correct	41 ms	1444 KB	Output is correct
73	Correct	48 ms	4632 KB	Output is correct
74	Correct	51 ms	4628 KB	Output is correct
75	Correct	44 ms	4500 KB	Output is correct
76	Correct	46 ms	4764 KB	Output is correct
77	Correct	49 ms	4552 KB	Output is correct
78	Correct	42 ms	4648 KB	Output is correct
79	Correct	44 ms	4648 KB	Output is correct
80	Correct	44 ms	4552 KB	Output is correct
81	Correct	42 ms	4552 KB	Output is correct
82	Correct	44 ms	4556 KB	Output is correct
83	Correct	44 ms	4544 KB	Output is correct
84	Correct	48 ms	4588 KB	Output is correct
85	Correct	44 ms	4552 KB	Output is correct
86	Correct	46 ms	4612 KB	Output is correct
87	Correct	46 ms	4552 KB	Output is correct
88	Correct	47 ms	4640 KB	Output is correct
89	Correct	51 ms	4680 KB	Output is correct
90	Correct	47 ms	4520 KB	Output is correct
91	Correct	47 ms	4640 KB	Output is correct
92	Correct	47 ms	4776 KB	Output is correct
93	Correct	51 ms	4808 KB	Output is correct
94	Correct	46 ms	4524 KB	Output is correct
95	Correct	44 ms	4516 KB	Output is correct
96	Correct	47 ms	4680 KB	Output is correct
97	Correct	46 ms	4632 KB	Output is correct
98	Correct	43 ms	4676 KB	Output is correct
99	Correct	50 ms	4552 KB	Output is correct
100	Correct	47 ms	4544 KB	Output is correct
101	Correct	47 ms	4552 KB	Output is correct
102	Correct	47 ms	4576 KB	Output is correct
103	Correct	49 ms	4552 KB	Output is correct

Submission #478554

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