답안 #117872

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
117872	2019-06-17T09:20:12 Z	JohnTitor	Coin Collecting (JOI19_ho_t4)	C++11	100 / 100	43 ms	6620 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Coin"
int n;
int x[200001];
int y[200001];
int c[100001][3];
int main(){
    #ifdef Aria
        if(fopen(taskname".in", "r"))
            freopen(taskname".in", "r", stdin);
    #endif // Aria
    read(n);
    FOR(i, 1, n*2) read(x[i]), read(y[i]);
    ll ans=0;
    FOR(i, 1, n*2){
        if(x[i]<1){
            ans+=1-x[i];
            x[i]=1;
        }
        else if(x[i]>n){
            ans+=x[i]-n;
            x[i]=n;
        }
        if(y[i]<1){
            ans+=1-y[i];
            y[i]=1;
        }
        else if(y[i]>2){
            ans+=y[i]-2;
            y[i]=2;
        }
    }
    FOR(i, 1, n*2) c[x[i]][y[i]]++;
    int d[3]={0, 0, 0};
    FOR(i, 1, n){
        d[1]+=c[i][1]-1;
        d[2]+=c[i][2]-1;
        if(d[1]>0&&0>d[2]){
            int t=min(d[1], -d[2]);
            d[1]-=t;
            d[2]+=t;
            ans+=t;
        }
        if(0>d[1]&&d[2]>0){
            int t=min(-d[1], d[2]);
            d[1]+=t;
            d[2]-=t;
            ans+=t;
        }
        ans+=abs(d[1]);
        ans+=abs(d[2]);
    }
    writeln(ans);
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 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	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 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	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	2 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	2 ms	384 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	3 ms	384 KB	Output is correct
40	Correct	2 ms	384 KB	Output is correct
41	Correct	2 ms	384 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	2 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	2 ms	384 KB	Output is correct
48	Correct	2 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	2 ms	512 KB	Output is correct
54	Correct	2 ms	384 KB	Output is correct
55	Correct	2 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	2 ms	384 KB	Output is correct
59	Correct	2 ms	384 KB	Output is correct
60	Correct	2 ms	384 KB	Output is correct
61	Correct	3 ms	384 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	2 ms	384 KB	Output is correct
64	Correct	2 ms	384 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 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	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	2 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	2 ms	384 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	3 ms	384 KB	Output is correct
40	Correct	2 ms	384 KB	Output is correct
41	Correct	2 ms	384 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	2 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	2 ms	384 KB	Output is correct
48	Correct	2 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	2 ms	512 KB	Output is correct
54	Correct	2 ms	384 KB	Output is correct
55	Correct	2 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	2 ms	384 KB	Output is correct
59	Correct	2 ms	384 KB	Output is correct
60	Correct	2 ms	384 KB	Output is correct
61	Correct	3 ms	384 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	2 ms	384 KB	Output is correct
64	Correct	2 ms	384 KB	Output is correct
65	Correct	17 ms	4608 KB	Output is correct
66	Correct	39 ms	6620 KB	Output is correct
67	Correct	30 ms	6264 KB	Output is correct
68	Correct	31 ms	6264 KB	Output is correct
69	Correct	32 ms	6268 KB	Output is correct
70	Correct	34 ms	6264 KB	Output is correct
71	Correct	35 ms	6264 KB	Output is correct
72	Correct	30 ms	5120 KB	Output is correct
73	Correct	30 ms	5112 KB	Output is correct
74	Correct	31 ms	5240 KB	Output is correct
75	Correct	32 ms	4960 KB	Output is correct
76	Correct	32 ms	5112 KB	Output is correct
77	Correct	33 ms	5128 KB	Output is correct
78	Correct	32 ms	5240 KB	Output is correct
79	Correct	31 ms	5092 KB	Output is correct
80	Correct	31 ms	5112 KB	Output is correct
81	Correct	43 ms	5112 KB	Output is correct
82	Correct	37 ms	5112 KB	Output is correct
83	Correct	33 ms	5112 KB	Output is correct
84	Correct	28 ms	5576 KB	Output is correct
85	Correct	30 ms	5372 KB	Output is correct
86	Correct	30 ms	6272 KB	Output is correct
87	Correct	32 ms	6136 KB	Output is correct
88	Correct	31 ms	6264 KB	Output is correct
89	Correct	30 ms	6256 KB	Output is correct
90	Correct	32 ms	6264 KB	Output is correct
91	Correct	32 ms	6264 KB	Output is correct
92	Correct	31 ms	6400 KB	Output is correct
93	Correct	30 ms	6392 KB	Output is correct
94	Correct	29 ms	6136 KB	Output is correct
95	Correct	29 ms	6144 KB	Output is correct
96	Correct	31 ms	5928 KB	Output is correct
97	Correct	30 ms	5880 KB	Output is correct
98	Correct	32 ms	5852 KB	Output is correct
99	Correct	30 ms	5624 KB	Output is correct
100	Correct	32 ms	5592 KB	Output is correct
101	Correct	30 ms	5880 KB	Output is correct
102	Correct	30 ms	5752 KB	Output is correct
103	Correct	31 ms	5624 KB	Output is correct

답안 #117872

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