답안 #537576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
537576	2022-03-15T08:52:05 Z	kawaii	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	81 ms	7344 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#define int long long

int t, n, u, v, a[1000005], table[1000005][3], answer = 0, mod = 1e9 + 7;
string s;
mt19937_64 rng;

int mul(int x, int y){
    if(y == 0) return 1;
    int ans = mul(x, y / 2);
    if(y % 2 == 0) return (ans * ans) % mod;
    else return (((ans * ans) % mod) * x) % mod;
}

void solve(){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= 2; j++) table[i][j]--;
    }
    for(int i = 1; i <= n; i++){
        if(table[i - 1][1]) table[i][1] += table[i - 1][1];
        if(table[i - 1][2]) table[i][2] += table[i - 1][2];
        if(table[i][1] > 0 && table[i][2] < 0){
            int num = min(abs(table[i][1]), abs(table[i][2]));
            answer += num;
            table[i][1] -= num;
            table[i][2] += num;
        }
        else if(table[i][1] < 0 && table[i][2] > 0){
            int num = min(abs(table[i][1]), abs(table[i][2]));
            answer += num;
            table[i][1] += num;
            table[i][2] -= num;
        }
        answer += abs(table[i][1]) + abs(table[i][2]);
    }
    cout << answer;
}

signed main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
    rng.seed((int)main ^ time(0));
    #ifdef Kawaii
        auto starttime = chrono::high_resolution_clock::now();
    #endif

    cin >> n;
    for(int i = 1; i <= n + n; i++){
        cin >> u >> v;
        if(1 <= u && u <= n && 1 <= v && v <= 2) table[u][v]++;
        else{
            if(1 <= u && u <= n){
                if(v > 2) table[u][2]++, answer += abs(v - 2);
                else table[u][1]++, answer += abs(v - 1);
            }
            else if(1 <= v && v <= 2){
                if(u > n) table[n][v]++, answer += abs(u - n);
                else table[1][v]++, answer += abs(u - 1);
            }
            else{
                int ans = abs(1 - u) + abs(1 - v);
                ans = min(ans, abs(n - u) + abs(1 - v));
                ans = min(ans, abs(1 - u) + abs(2 - v));
                ans = min(ans, abs(n - u) + abs(2 - v));
                if(ans == abs(1 - u) + abs(1 - v)) table[1][1]++;
                else if(ans == abs(n - u) + abs(1 - v)) table[n][1]++;
                else if(ans == abs(1 - u) + abs(2 - v)) table[1][2]++;
                else table[n][2]++;
                answer += ans;
            }
        }
    }
    solve();

    #ifdef Kawaii
        auto endtime = chrono::high_resolution_clock::now();
        auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count(); 
        cout << "\n=====" << "\nUsed: " << duration << " ms\n";
    #endif
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	324 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	324 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	324 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	324 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	336 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Correct	1 ms	276 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	1 ms	376 KB	Output is correct
61	Correct	1 ms	372 KB	Output is correct
62	Correct	2 ms	340 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	324 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	324 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	336 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Correct	1 ms	276 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	1 ms	376 KB	Output is correct
61	Correct	1 ms	372 KB	Output is correct
62	Correct	2 ms	340 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	40 ms	4192 KB	Output is correct
66	Correct	81 ms	7344 KB	Output is correct
67	Correct	73 ms	5716 KB	Output is correct
68	Correct	49 ms	5732 KB	Output is correct
69	Correct	51 ms	5732 KB	Output is correct
70	Correct	56 ms	5836 KB	Output is correct
71	Correct	65 ms	5840 KB	Output is correct
72	Correct	42 ms	5816 KB	Output is correct
73	Correct	44 ms	5832 KB	Output is correct
74	Correct	59 ms	5764 KB	Output is correct
75	Correct	45 ms	5676 KB	Output is correct
76	Correct	43 ms	5808 KB	Output is correct
77	Correct	44 ms	5680 KB	Output is correct
78	Correct	43 ms	5768 KB	Output is correct
79	Correct	49 ms	5828 KB	Output is correct
80	Correct	42 ms	5820 KB	Output is correct
81	Correct	41 ms	5828 KB	Output is correct
82	Correct	40 ms	5724 KB	Output is correct
83	Correct	41 ms	5964 KB	Output is correct
84	Correct	44 ms	5792 KB	Output is correct
85	Correct	46 ms	5816 KB	Output is correct
86	Correct	47 ms	5736 KB	Output is correct
87	Correct	45 ms	5780 KB	Output is correct
88	Correct	56 ms	5840 KB	Output is correct
89	Correct	55 ms	5844 KB	Output is correct
90	Correct	61 ms	5836 KB	Output is correct
91	Correct	58 ms	5840 KB	Output is correct
92	Correct	62 ms	5840 KB	Output is correct
93	Correct	69 ms	5840 KB	Output is correct
94	Correct	61 ms	5716 KB	Output is correct
95	Correct	56 ms	5724 KB	Output is correct
96	Correct	49 ms	5892 KB	Output is correct
97	Correct	59 ms	5828 KB	Output is correct
98	Correct	51 ms	5768 KB	Output is correct
99	Correct	45 ms	5860 KB	Output is correct
100	Correct	49 ms	5756 KB	Output is correct
101	Correct	71 ms	5832 KB	Output is correct
102	Correct	43 ms	5812 KB	Output is correct
103	Correct	46 ms	5836 KB	Output is correct

답안 #537576

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