Submission #203836

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
203836	2020-02-22T13:43:22 Z	cheetose	Coin Collecting (JOI19_ho_t4)	C++11	100 / 100	80 ms	4984 KB

joi2019_ho_t4

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int cnt[2][100002];
ll solve(int l,int r)
{
	ll res=0;
	ll c0=0,c1=0;
	fup(i,l,r,1)
	{
		c0+=cnt[0][i]-1,c1+=cnt[1][i]-1;
		if(c0*c1<0)
		{
			ll t=min(abs(c0),abs(c1));
			res+=t;
			c0-=t*(c0>0?1:-1);
			c1-=t*(c1>0?1:-1);
		}
		res+=abs(c0)+abs(c1);
	}
	return res;
}
int main() {
	int n;
	scanf("%d",&n);
	ll ans=0;
	fup(i,0,2*n-1,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		y--;
		if(x<=1)
		{
			ans+=1-x;
			if(y>0)
			{
				ans+=y-1;
				cnt[1][1]++;
			}
			else
			{
				ans-=y;
				cnt[0][1]++;
			}
		}
		else if(x<n)
		{
			if(y>0)
			{
				ans+=y-1;
				cnt[1][x]++;
			}
			else
			{
				ans-=y;
				cnt[0][x]++;
			}
		}
		else
		{
			ans+=x-n;
			if(y>0)
			{
				ans+=y-1;
				cnt[1][n]++;
			}
			else
			{
				ans-=y;
				cnt[0][n]++;
			}
		}
	}
	int c=0;
	for(int i=0,j=1;j<=n;j++)
	{
		c+=cnt[0][j]+cnt[1][j];
		if(c==2*(j-i))
		{
			ans+=solve(i+1,j);
			c=0;
			i=j;
		}
	}
	printf("%lld",ans);
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	248 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	256 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	248 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	372 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	256 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	256 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	5 ms	376 KB	Output is correct
32	Correct	5 ms	256 KB	Output is correct
33	Correct	5 ms	256 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	6 ms	380 KB	Output is correct
36	Correct	6 ms	376 KB	Output is correct
37	Correct	5 ms	376 KB	Output is correct
38	Correct	5 ms	376 KB	Output is correct
39	Correct	5 ms	376 KB	Output is correct
40	Correct	6 ms	376 KB	Output is correct
41	Correct	5 ms	376 KB	Output is correct
42	Correct	5 ms	376 KB	Output is correct
43	Correct	5 ms	376 KB	Output is correct
44	Correct	6 ms	376 KB	Output is correct
45	Correct	5 ms	504 KB	Output is correct
46	Correct	5 ms	376 KB	Output is correct
47	Correct	5 ms	376 KB	Output is correct
48	Correct	6 ms	380 KB	Output is correct
49	Correct	5 ms	376 KB	Output is correct
50	Correct	7 ms	376 KB	Output is correct
51	Correct	5 ms	376 KB	Output is correct
52	Correct	5 ms	376 KB	Output is correct
53	Correct	5 ms	376 KB	Output is correct
54	Correct	5 ms	376 KB	Output is correct
55	Correct	5 ms	376 KB	Output is correct
56	Correct	5 ms	376 KB	Output is correct
57	Correct	5 ms	376 KB	Output is correct
58	Correct	5 ms	376 KB	Output is correct
59	Correct	6 ms	376 KB	Output is correct
60	Correct	5 ms	376 KB	Output is correct
61	Correct	5 ms	376 KB	Output is correct
62	Correct	5 ms	376 KB	Output is correct
63	Correct	5 ms	376 KB	Output is correct
64	Correct	5 ms	380 KB	Output is correct
65	Correct	54 ms	2680 KB	Output is correct
66	Correct	69 ms	4984 KB	Output is correct
67	Correct	77 ms	4216 KB	Output is correct
68	Correct	80 ms	4344 KB	Output is correct
69	Correct	76 ms	4344 KB	Output is correct
70	Correct	75 ms	4220 KB	Output is correct
71	Correct	77 ms	4472 KB	Output is correct
72	Correct	74 ms	3576 KB	Output is correct
73	Correct	71 ms	3576 KB	Output is correct
74	Correct	71 ms	3576 KB	Output is correct
75	Correct	73 ms	3448 KB	Output is correct
76	Correct	71 ms	3720 KB	Output is correct
77	Correct	73 ms	3448 KB	Output is correct
78	Correct	77 ms	3576 KB	Output is correct
79	Correct	74 ms	3576 KB	Output is correct
80	Correct	72 ms	3576 KB	Output is correct
81	Correct	73 ms	3576 KB	Output is correct
82	Correct	76 ms	3640 KB	Output is correct
83	Correct	76 ms	3576 KB	Output is correct
84	Correct	74 ms	3960 KB	Output is correct
85	Correct	75 ms	3960 KB	Output is correct
86	Correct	77 ms	4344 KB	Output is correct
87	Correct	76 ms	4344 KB	Output is correct
88	Correct	75 ms	4344 KB	Output is correct
89	Correct	75 ms	4216 KB	Output is correct
90	Correct	77 ms	4344 KB	Output is correct
91	Correct	78 ms	4344 KB	Output is correct
92	Correct	72 ms	3960 KB	Output is correct
93	Correct	75 ms	4344 KB	Output is correct
94	Correct	77 ms	4216 KB	Output is correct
95	Correct	74 ms	3832 KB	Output is correct
96	Correct	72 ms	3840 KB	Output is correct
97	Correct	71 ms	3832 KB	Output is correct
98	Correct	73 ms	4088 KB	Output is correct
99	Correct	75 ms	3960 KB	Output is correct
100	Correct	72 ms	3760 KB	Output is correct
101	Correct	73 ms	3704 KB	Output is correct
102	Correct	70 ms	3960 KB	Output is correct
103	Correct	72 ms	3832 KB	Output is correct

Submission #203836

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