Submission #145272

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
145272	2019-08-19T12:48:06 Z	TadijaSebez	Coin Collecting (JOI19_ho_t4)	C++11	37 / 100	49 ms	3576 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100050;
const int M=2050;
const int inf=1e9+7;
int pos[2][M],sz[2],cnt[N][2],dp[M],tmp[M];
void Clear(int a[]){ for(int i=0;i<M;i++) a[i]=inf;}
void ckmn(int &a, int b){ a=min(a,b);}
int main()
{
	int n,x,y;
	scanf("%i",&n);
	ll ans=0;
	for(int i=1;i<=2*n;i++)
	{
		scanf("%i %i",&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;
		cnt[x][y-1]++;
	}
	for(int i=n;i>=1;i--)
	{
		for(int k=1;k<=cnt[i][0];k++) pos[0][++sz[0]]=i;
		for(int k=1;k<=cnt[i][1];k++) pos[1][++sz[1]]=i;
	}
	Clear(dp);
	if(sz[0]) dp[sz[0]-1]=pos[0][sz[0]]-1;
	if(sz[1]) dp[sz[0]]=pos[1][sz[1]];
	for(int i=2,l=1;i<=2*n;i++)
	{
		Clear(tmp);
		int f=0;
		if(i%2==0) f=1;
		for(int j=0;j<=sz[0];j++) if(dp[j]!=inf)
		{
			int k=2*n-i-j+1;
			if(j) ckmn(tmp[j-1],dp[j]+abs(pos[0][j]-l)+f);
			if(k) ckmn(tmp[j],dp[j]+abs(pos[1][k]-l)+(f^1));
		}
		for(int j=0;j<=sz[0];j++) dp[j]=tmp[j];
		if(i%2==0) l++;
	}
	ans+=dp[0];
	printf("%lld\n",ans);
	return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	3 ms	380 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	3 ms	380 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	404 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	380 KB	Output is correct
29	Correct	3 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	10 ms	376 KB	Output is correct
35	Correct	11 ms	468 KB	Output is correct
36	Correct	11 ms	376 KB	Output is correct
37	Correct	11 ms	376 KB	Output is correct
38	Correct	11 ms	376 KB	Output is correct
39	Correct	11 ms	376 KB	Output is correct
40	Correct	12 ms	376 KB	Output is correct
41	Correct	11 ms	376 KB	Output is correct
42	Correct	12 ms	376 KB	Output is correct
43	Correct	11 ms	376 KB	Output is correct
44	Correct	11 ms	376 KB	Output is correct
45	Correct	11 ms	376 KB	Output is correct
46	Correct	11 ms	376 KB	Output is correct
47	Correct	11 ms	376 KB	Output is correct
48	Correct	11 ms	504 KB	Output is correct
49	Correct	12 ms	376 KB	Output is correct
50	Correct	11 ms	376 KB	Output is correct
51	Correct	11 ms	376 KB	Output is correct
52	Correct	11 ms	376 KB	Output is correct
53	Correct	10 ms	440 KB	Output is correct
54	Correct	11 ms	376 KB	Output is correct
55	Correct	6 ms	460 KB	Output is correct
56	Correct	5 ms	376 KB	Output is correct
57	Correct	6 ms	376 KB	Output is correct
58	Correct	10 ms	376 KB	Output is correct
59	Correct	11 ms	376 KB	Output is correct
60	Correct	11 ms	376 KB	Output is correct
61	Correct	10 ms	376 KB	Output is correct
62	Correct	10 ms	376 KB	Output is correct
63	Correct	9 ms	376 KB	Output is correct
64	Correct	8 ms	376 KB	Output is correct
65	Runtime error	49 ms	3576 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
66	Halted	0 ms	0 KB	-

Submission #145272

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
0 / 63.0