답안 #407106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407106	2021-05-18T13:27:52 Z	79brue	항공 노선도 (JOI18_airline)	C++14	100 / 100	839 ms	33732 KB

Alice
Bob

#include "Alicelib.h"
#include <bits/stdc++.h>

using namespace std;

namespace AliceLib{
    int n, m;
    int renum[1002];
    vector<int> link[1002];
    vector<pair<int, int> > resultingGraph;

    void Alice(int N, int M, int A[], int B[]){
        n = N, m = M;
        for(int i=0; i<m; i++){
            link[A[i]].push_back(B[i]);
            link[B[i]].push_back(A[i]);

            resultingGraph.push_back(make_pair(A[i], B[i]));
        }

        int rpnt = 0;
        for(int i=0; i<n; i++){
            while(__builtin_popcount(rpnt) >= 9) rpnt++;
            renum[i] = rpnt++;
        }

        /// Edge type A: 0 - 1, 0 - 2 - 3, 0 - 4 - 5 - 6 - 7 - 8 - 9
        vector<int> tPar = {0, 0, 0, 2, 0, 4, 5, 6, 7, 8};
        for(int i=1; i<10; i++) resultingGraph.push_back(make_pair(n+i, n+tPar[i]));

        /// Edge type B: Every other vertexes - (n+10)
        for(int i=0; i<n+10; i++){
            resultingGraph.push_back(make_pair(i, n+10));
        }

        /// Edge type C: n~n+9 - n+11
        for(int i=n; i<n+10; i++) resultingGraph.push_back(make_pair(i, n+11));

        /// Edge type D: 0~n-1 - n~n+9
        for(int i=0; i<n; i++){
            for(int j=0; j<10; j++){
                if((renum[i]>>j)&1) resultingGraph.push_back(make_pair(i, n+j));
            }
        }

        InitG(n+12, (int)resultingGraph.size());
        int edgeCnt = 0;
        for(auto p: resultingGraph){
            MakeG(edgeCnt++, p.first, p.second);
        }
    }
}

void Alice(int N, int M, int A[], int B[]){
    AliceLib::Alice(N, M, A, B);
}

#include <bits/stdc++.h>
#include "Boblib.h"

using namespace std;

namespace BobLib{
    int n, m;
    vector<int> link[1022];
    int deg[1022], tdeg[1022];
    int number[1022];
    int loc[1022];

    bool candidate[1022];

    int renum[1022];
    vector<pair<int, int> > edges;

    int tdfs(int x, int par = -1, int depth = 0){
        int ret = 0;
        for(auto y: link[x]){
            if(y == par || !candidate[y]) continue;
            ret = tdfs(y, x, depth+1)+1;
        }
        if(depth){
            int result;
            if(depth + ret == 1) result = depth;
            else if(depth + ret == 2) result = depth + 1;
            else result = depth + 3;

            loc[n+result] = x, number[x] = n+result;
        }
        return ret;
    }

    void Bob(int N, int M, int A[], int B[]){
        n = N - 12, m = M;
        for(int i=0; i<m; i++){
            link[A[i]].push_back(B[i]);
            link[B[i]].push_back(A[i]);
            deg[A[i]]++, deg[B[i]]++;
        }

        int rpnt = 0;
        for(int i=0; i<n; i++){
            while(__builtin_popcount(rpnt) >= 9) rpnt++;
            renum[rpnt++] = i;
        }

        for(int i=0; i<n+12; i++){
            if(deg[i] == n+10){
                loc[n+10] = i, number[i] = n+10;

                set<int> st;
                for(int j=0; j<n+12; j++) if(j!=i) st.insert(j);
                for(auto y: link[i]) st.erase(y);

                int pnt = *st.begin();
                loc[n+11] = pnt, number[pnt] = n+11;
            }
        }

        for(auto nxt: link[loc[n+11]]) candidate[nxt] = 1;
        for(int i=0; i<n+12; i++){
            for(auto j: link[i]){
                if(candidate[i] && candidate[j]) tdeg[i]++;
            }
        }

        for(int i=0; i<n+12; i++){
            if(tdeg[i] == 3){
                loc[n] = i, number[i] = n;
                break;
            }
        }

        tdfs(loc[n]);

        for(int i=0; i<n+12; i++){
            if(number[i] >= n) continue;
            for(auto j: link[i]){
                if(number[j] < n || number[j] == n+10) continue;
                number[i] += 1 << (number[j] - n);
            }
            number[i] = renum[number[i]];
        }

        for(int i=0; i<n+12; i++){
            if(number[i] >= n) continue;
            for(auto j: link[i]){
                if(number[j] >= n || number[j] > number[i]) continue;
                edges.emplace_back(number[i], number[j]);
            }
        }

        InitMap(n, (int)edges.size());
        for(auto p: edges){
            MakeMap(p.first, p.second);
        }
    }
}

void Bob(int N, int M, int A[], int B[]){
    BobLib::Bob(N, M, A, B);
}

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4712 KB	Output is correct
2	Correct	3 ms	4716 KB	Output is correct
3	Correct	3 ms	4708 KB	Output is correct
4	Correct	3 ms	4584 KB	Output is correct
5	Correct	3 ms	4644 KB	Output is correct
6	Correct	3 ms	4724 KB	Output is correct
7	Correct	3 ms	4712 KB	Output is correct
8	Correct	3 ms	4624 KB	Output is correct
9	Correct	3 ms	4716 KB	Output is correct
10	Correct	3 ms	4712 KB	Output is correct
11	Correct	3 ms	4728 KB	Output is correct
12	Correct	3 ms	4696 KB	Output is correct
13	Correct	3 ms	4728 KB	Output is correct
14	Correct	3 ms	4720 KB	Output is correct
15	Correct	3 ms	4716 KB	Output is correct
16	Correct	3 ms	4664 KB	Output is correct
17	Correct	3 ms	4716 KB	Output is correct
18	Correct	3 ms	4712 KB	Output is correct
19	Correct	3 ms	4644 KB	Output is correct
20	Correct	3 ms	4716 KB	Output is correct
21	Correct	4 ms	4716 KB	Output is correct
22	Correct	3 ms	4716 KB	Output is correct
23	Correct	3 ms	4724 KB	Output is correct
24	Correct	3 ms	4624 KB	Output is correct
25	Correct	3 ms	4668 KB	Output is correct
26	Correct	4 ms	4644 KB	Output is correct
27	Correct	3 ms	4724 KB	Output is correct
28	Correct	3 ms	4716 KB	Output is correct
29	Correct	3 ms	4704 KB	Output is correct
30	Correct	3 ms	4624 KB	Output is correct
31	Correct	3 ms	4580 KB	Output is correct
32	Correct	3 ms	4600 KB	Output is correct
33	Correct	3 ms	4516 KB	Output is correct
34	Correct	3 ms	4712 KB	Output is correct
35	Correct	3 ms	4712 KB	Output is correct
36	Correct	3 ms	4716 KB	Output is correct
37	Correct	3 ms	4716 KB	Output is correct
38	Correct	3 ms	4716 KB	Output is correct
39	Correct	3 ms	4716 KB	Output is correct
40	Correct	3 ms	4716 KB	Output is correct
41	Correct	3 ms	4724 KB	Output is correct
42	Correct	3 ms	4732 KB	Output is correct
43	Correct	3 ms	4644 KB	Output is correct
44	Correct	3 ms	4496 KB	Output is correct
45	Correct	3 ms	4712 KB	Output is correct
46	Correct	3 ms	4716 KB	Output is correct
47	Correct	3 ms	4716 KB	Output is correct
48	Correct	3 ms	4716 KB	Output is correct
49	Correct	3 ms	4716 KB	Output is correct
50	Correct	3 ms	4720 KB	Output is correct
51	Correct	3 ms	4712 KB	Output is correct
52	Correct	3 ms	4712 KB	Output is correct
53	Correct	3 ms	4704 KB	Output is correct
54	Correct	3 ms	4716 KB	Output is correct
55	Correct	3 ms	4716 KB	Output is correct
56	Correct	3 ms	4716 KB	Output is correct
57	Correct	3 ms	4716 KB	Output is correct
58	Correct	3 ms	4724 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4712 KB	Output is correct
2	Correct	3 ms	4716 KB	Output is correct
3	Correct	3 ms	4708 KB	Output is correct
4	Correct	3 ms	4584 KB	Output is correct
5	Correct	3 ms	4644 KB	Output is correct
6	Correct	3 ms	4724 KB	Output is correct
7	Correct	3 ms	4712 KB	Output is correct
8	Correct	3 ms	4624 KB	Output is correct
9	Correct	3 ms	4716 KB	Output is correct
10	Correct	3 ms	4712 KB	Output is correct
11	Correct	3 ms	4728 KB	Output is correct
12	Correct	3 ms	4696 KB	Output is correct
13	Correct	3 ms	4728 KB	Output is correct
14	Correct	3 ms	4720 KB	Output is correct
15	Correct	3 ms	4716 KB	Output is correct
16	Correct	3 ms	4664 KB	Output is correct
17	Correct	3 ms	4716 KB	Output is correct
18	Correct	3 ms	4712 KB	Output is correct
19	Correct	3 ms	4644 KB	Output is correct
20	Correct	3 ms	4716 KB	Output is correct
21	Correct	4 ms	4716 KB	Output is correct
22	Correct	3 ms	4716 KB	Output is correct
23	Correct	3 ms	4724 KB	Output is correct
24	Correct	3 ms	4624 KB	Output is correct
25	Correct	3 ms	4668 KB	Output is correct
26	Correct	4 ms	4644 KB	Output is correct
27	Correct	3 ms	4724 KB	Output is correct
28	Correct	3 ms	4716 KB	Output is correct
29	Correct	3 ms	4704 KB	Output is correct
30	Correct	3 ms	4624 KB	Output is correct
31	Correct	3 ms	4580 KB	Output is correct
32	Correct	3 ms	4600 KB	Output is correct
33	Correct	3 ms	4516 KB	Output is correct
34	Correct	3 ms	4712 KB	Output is correct
35	Correct	3 ms	4712 KB	Output is correct
36	Correct	3 ms	4716 KB	Output is correct
37	Correct	3 ms	4716 KB	Output is correct
38	Correct	3 ms	4716 KB	Output is correct
39	Correct	3 ms	4716 KB	Output is correct
40	Correct	3 ms	4716 KB	Output is correct
41	Correct	3 ms	4724 KB	Output is correct
42	Correct	3 ms	4732 KB	Output is correct
43	Correct	3 ms	4644 KB	Output is correct
44	Correct	3 ms	4496 KB	Output is correct
45	Correct	3 ms	4712 KB	Output is correct
46	Correct	3 ms	4716 KB	Output is correct
47	Correct	3 ms	4716 KB	Output is correct
48	Correct	3 ms	4716 KB	Output is correct
49	Correct	3 ms	4716 KB	Output is correct
50	Correct	3 ms	4720 KB	Output is correct
51	Correct	3 ms	4712 KB	Output is correct
52	Correct	3 ms	4712 KB	Output is correct
53	Correct	3 ms	4704 KB	Output is correct
54	Correct	3 ms	4716 KB	Output is correct
55	Correct	3 ms	4716 KB	Output is correct
56	Correct	3 ms	4716 KB	Output is correct
57	Correct	3 ms	4716 KB	Output is correct
58	Correct	3 ms	4724 KB	Output is correct
59	Correct	4 ms	4844 KB	Output is correct
60	Correct	4 ms	4840 KB	Output is correct
61	Correct	3 ms	4716 KB	Output is correct
62	Correct	3 ms	4712 KB	Output is correct
63	Correct	3 ms	4840 KB	Output is correct
64	Correct	3 ms	4840 KB	Output is correct
65	Correct	4 ms	4752 KB	Output is correct
66	Correct	4 ms	4752 KB	Output is correct
67	Correct	3 ms	4720 KB	Output is correct
68	Correct	3 ms	4716 KB	Output is correct
69	Correct	3 ms	4696 KB	Output is correct
70	Correct	3 ms	4844 KB	Output is correct
71	Correct	4 ms	4844 KB	Output is correct
72	Correct	4 ms	4836 KB	Output is correct
73	Correct	3 ms	4844 KB	Output is correct
74	Correct	3 ms	4720 KB	Output is correct
75	Correct	3 ms	4664 KB	Output is correct
76	Correct	3 ms	4716 KB	Output is correct
77	Correct	3 ms	4840 KB	Output is correct
78	Correct	4 ms	4824 KB	Output is correct
79	Correct	3 ms	4772 KB	Output is correct
80	Correct	3 ms	4712 KB	Output is correct
81	Correct	3 ms	4708 KB	Output is correct
82	Correct	3 ms	4724 KB	Output is correct
83	Correct	3 ms	4856 KB	Output is correct
84	Correct	3 ms	4696 KB	Output is correct
85	Correct	3 ms	4852 KB	Output is correct
86	Correct	3 ms	4836 KB	Output is correct
87	Correct	3 ms	4716 KB	Output is correct
88	Correct	3 ms	4716 KB	Output is correct
89	Correct	3 ms	4720 KB	Output is correct
90	Correct	3 ms	4712 KB	Output is correct
91	Correct	3 ms	4712 KB	Output is correct
92	Correct	3 ms	4712 KB	Output is correct
93	Correct	3 ms	4692 KB	Output is correct
94	Correct	5 ms	4824 KB	Output is correct
95	Correct	4 ms	4844 KB	Output is correct
96	Correct	4 ms	4840 KB	Output is correct
97	Correct	4 ms	4844 KB	Output is correct
98	Correct	4 ms	4772 KB	Output is correct
99	Correct	4 ms	4716 KB	Output is correct
100	Correct	3 ms	4696 KB	Output is correct
101	Correct	3 ms	4640 KB	Output is correct
102	Correct	3 ms	4652 KB	Output is correct
103	Correct	3 ms	4724 KB	Output is correct
104	Correct	3 ms	4644 KB	Output is correct
105	Correct	4 ms	4844 KB	Output is correct
106	Correct	3 ms	4844 KB	Output is correct
107	Correct	3 ms	4696 KB	Output is correct
108	Correct	3 ms	4716 KB	Output is correct
109	Correct	4 ms	4812 KB	Output is correct
110	Correct	3 ms	4624 KB	Output is correct
111	Correct	3 ms	4624 KB	Output is correct
112	Correct	3 ms	4716 KB	Output is correct
113	Correct	3 ms	4624 KB	Output is correct
114	Correct	3 ms	4724 KB	Output is correct
115	Correct	4 ms	4824 KB	Output is correct
116	Correct	3 ms	4716 KB	Output is correct
117	Correct	3 ms	4700 KB	Output is correct
118	Correct	3 ms	4644 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	832 ms	33540 KB	Output is correct : V - N = 12
2	Correct	514 ms	30284 KB	Output is correct : V - N = 12
3	Correct	196 ms	16224 KB	Output is correct : V - N = 12
4	Correct	11 ms	5424 KB	Output is correct : V - N = 12
5	Correct	123 ms	11320 KB	Output is correct : V - N = 12
6	Correct	496 ms	28400 KB	Output is correct : V - N = 12
7	Correct	766 ms	33448 KB	Output is correct : V - N = 12
8	Correct	748 ms	32088 KB	Output is correct : V - N = 12
9	Correct	284 ms	18356 KB	Output is correct : V - N = 12
10	Correct	52 ms	6620 KB	Output is correct : V - N = 12
11	Correct	60 ms	7964 KB	Output is correct : V - N = 12
12	Correct	472 ms	21204 KB	Output is correct : V - N = 12
13	Correct	615 ms	32604 KB	Output is correct : V - N = 12
14	Correct	621 ms	33128 KB	Output is correct : V - N = 12
15	Correct	506 ms	27144 KB	Output is correct : V - N = 12
16	Correct	88 ms	9084 KB	Output is correct : V - N = 12
17	Correct	24 ms	5892 KB	Output is correct : V - N = 12
18	Correct	327 ms	17432 KB	Output is correct : V - N = 12
19	Correct	661 ms	31260 KB	Output is correct : V - N = 12
20	Correct	783 ms	33680 KB	Output is correct : V - N = 12
21	Correct	173 ms	13552 KB	Output is correct : V - N = 12
22	Correct	167 ms	11432 KB	Output is correct : V - N = 12
23	Correct	74 ms	8056 KB	Output is correct : V - N = 12
24	Correct	6 ms	4980 KB	Output is correct : V - N = 12
25	Correct	45 ms	6568 KB	Output is correct : V - N = 12
26	Correct	136 ms	11044 KB	Output is correct : V - N = 12
27	Correct	186 ms	12460 KB	Output is correct : V - N = 12
28	Correct	227 ms	11908 KB	Output is correct : V - N = 12
29	Correct	82 ms	8464 KB	Output is correct : V - N = 12
30	Correct	10 ms	5476 KB	Output is correct : V - N = 12
31	Correct	10 ms	5012 KB	Output is correct : V - N = 12
32	Correct	9 ms	5096 KB	Output is correct : V - N = 12
33	Correct	9 ms	5136 KB	Output is correct : V - N = 12
34	Correct	10 ms	5096 KB	Output is correct : V - N = 12
35	Correct	9 ms	5096 KB	Output is correct : V - N = 12
36	Correct	670 ms	33732 KB	Output is correct : V - N = 12
37	Correct	805 ms	33376 KB	Output is correct : V - N = 12
38	Correct	839 ms	33252 KB	Output is correct : V - N = 12
39	Correct	633 ms	33444 KB	Output is correct : V - N = 12
40	Correct	722 ms	33368 KB	Output is correct : V - N = 12
41	Correct	119 ms	10872 KB	Output is correct : V - N = 12
42	Correct	122 ms	9492 KB	Output is correct : V - N = 12
43	Correct	138 ms	10604 KB	Output is correct : V - N = 12
44	Correct	12 ms	5156 KB	Output is correct : V - N = 12
45	Correct	81 ms	8052 KB	Output is correct : V - N = 12
46	Correct	216 ms	16580 KB	Output is correct : V - N = 12
47	Correct	147 ms	11008 KB	Output is correct : V - N = 12
48	Correct	375 ms	18404 KB	Output is correct : V - N = 12
49	Correct	46 ms	8024 KB	Output is correct : V - N = 12
50	Correct	20 ms	5972 KB	Output is correct : V - N = 12
51	Correct	530 ms	30140 KB	Output is correct : V - N = 12
52	Correct	11 ms	5344 KB	Output is correct : V - N = 12
53	Correct	452 ms	28132 KB	Output is correct : V - N = 12
54	Correct	554 ms	31484 KB	Output is correct : V - N = 12
55	Correct	39 ms	6700 KB	Output is correct : V - N = 12
56	Correct	313 ms	20316 KB	Output is correct : V - N = 12
57	Correct	798 ms	32444 KB	Output is correct : V - N = 12
58	Correct	107 ms	8976 KB	Output is correct : V - N = 12
59	Correct	248 ms	17224 KB	Output is correct : V - N = 12
60	Correct	648 ms	32964 KB	Output is correct : V - N = 12
61	Correct	5 ms	4772 KB	Output is correct : V - N = 12
62	Correct	5 ms	4844 KB	Output is correct : V - N = 12
63	Correct	3 ms	4624 KB	Output is correct : V - N = 12
64	Correct	3 ms	4624 KB	Output is correct : V - N = 12
65	Correct	3 ms	4696 KB	Output is correct : V - N = 12
66	Correct	4 ms	4768 KB	Output is correct : V - N = 12
67	Correct	4 ms	4804 KB	Output is correct : V - N = 12
68	Correct	4 ms	4844 KB	Output is correct : V - N = 12
69	Correct	4 ms	4784 KB	Output is correct : V - N = 12
70	Correct	3 ms	4624 KB	Output is correct : V - N = 12
71	Correct	3 ms	4644 KB	Output is correct : V - N = 12
72	Correct	3 ms	4844 KB	Output is correct : V - N = 12
73	Correct	4 ms	4772 KB	Output is correct : V - N = 12
74	Correct	4 ms	4784 KB	Output is correct : V - N = 12
75	Correct	4 ms	4772 KB	Output is correct : V - N = 12
76	Correct	3 ms	4636 KB	Output is correct : V - N = 12
77	Correct	3 ms	4724 KB	Output is correct : V - N = 12
78	Correct	3 ms	4840 KB	Output is correct : V - N = 12
79	Correct	3 ms	4824 KB	Output is correct : V - N = 12
80	Correct	4 ms	4844 KB	Output is correct : V - N = 12
81	Correct	3 ms	4680 KB	Output is correct : V - N = 12
82	Correct	4 ms	4752 KB	Output is correct : V - N = 12
83	Correct	3 ms	4724 KB	Output is correct : V - N = 12
84	Correct	3 ms	4716 KB	Output is correct : V - N = 12
85	Correct	3 ms	4716 KB	Output is correct : V - N = 12
86	Correct	3 ms	4844 KB	Output is correct : V - N = 12
87	Correct	3 ms	4824 KB	Output is correct : V - N = 12
88	Correct	4 ms	4752 KB	Output is correct : V - N = 12
89	Correct	3 ms	4716 KB	Output is correct : V - N = 12
90	Correct	3 ms	4644 KB	Output is correct : V - N = 12
91	Correct	3 ms	4688 KB	Output is correct : V - N = 12
92	Correct	3 ms	4624 KB	Output is correct : V - N = 12
93	Correct	3 ms	4712 KB	Output is correct : V - N = 12
94	Correct	3 ms	4692 KB	Output is correct : V - N = 12
95	Correct	4 ms	4656 KB	Output is correct : V - N = 12
96	Correct	4 ms	4824 KB	Output is correct : V - N = 12
97	Correct	4 ms	4824 KB	Output is correct : V - N = 12
98	Correct	5 ms	4844 KB	Output is correct : V - N = 12
99	Correct	4 ms	4844 KB	Output is correct : V - N = 12
100	Correct	3 ms	4844 KB	Output is correct : V - N = 12
101	Correct	3 ms	4656 KB	Output is correct : V - N = 12
102	Correct	3 ms	4624 KB	Output is correct : V - N = 12
103	Correct	3 ms	4624 KB	Output is correct : V - N = 12
104	Correct	3 ms	4644 KB	Output is correct : V - N = 12
105	Correct	3 ms	4624 KB	Output is correct : V - N = 12
106	Correct	3 ms	4700 KB	Output is correct : V - N = 12
107	Correct	3 ms	4752 KB	Output is correct : V - N = 12
108	Correct	4 ms	4768 KB	Output is correct : V - N = 12
109	Correct	3 ms	4644 KB	Output is correct : V - N = 12
110	Correct	4 ms	4716 KB	Output is correct : V - N = 12
111	Correct	5 ms	4804 KB	Output is correct : V - N = 12
112	Correct	3 ms	4644 KB	Output is correct : V - N = 12
113	Correct	3 ms	4656 KB	Output is correct : V - N = 12
114	Correct	4 ms	4644 KB	Output is correct : V - N = 12
115	Correct	3 ms	4624 KB	Output is correct : V - N = 12
116	Correct	4 ms	4716 KB	Output is correct : V - N = 12
117	Correct	3 ms	4752 KB	Output is correct : V - N = 12
118	Correct	3 ms	4624 KB	Output is correct : V - N = 12
119	Correct	3 ms	4840 KB	Output is correct : V - N = 12
120	Correct	3 ms	4716 KB	Output is correct : V - N = 12
121	Correct	3 ms	4644 KB	Output is correct : V - N = 12
122	Correct	3 ms	4724 KB	Output is correct : V - N = 12
123	Correct	3 ms	4644 KB	Output is correct : V - N = 12
124	Correct	4 ms	4644 KB	Output is correct : V - N = 12
125	Correct	3 ms	4716 KB	Output is correct : V - N = 12
126	Correct	3 ms	4696 KB	Output is correct : V - N = 12
127	Correct	3 ms	4640 KB	Output is correct : V - N = 12
128	Correct	3 ms	4700 KB	Output is correct : V - N = 12
129	Correct	3 ms	4696 KB	Output is correct : V - N = 12
130	Correct	3 ms	4712 KB	Output is correct : V - N = 12
131	Correct	4 ms	4716 KB	Output is correct : V - N = 12
132	Correct	3 ms	4596 KB	Output is correct : V - N = 12
133	Correct	3 ms	4580 KB	Output is correct : V - N = 12
134	Correct	5 ms	4628 KB	Output is correct : V - N = 12
135	Correct	3 ms	4708 KB	Output is correct : V - N = 12
136	Correct	3 ms	4624 KB	Output is correct : V - N = 12
137	Correct	3 ms	4696 KB	Output is correct : V - N = 12
138	Correct	4 ms	4644 KB	Output is correct : V - N = 12
139	Correct	4 ms	4624 KB	Output is correct : V - N = 12
140	Correct	3 ms	4716 KB	Output is correct : V - N = 12
141	Correct	4 ms	4624 KB	Output is correct : V - N = 12
142	Correct	3 ms	4716 KB	Output is correct : V - N = 12
143	Correct	3 ms	4716 KB	Output is correct : V - N = 12
144	Correct	3 ms	4516 KB	Output is correct : V - N = 12
145	Correct	3 ms	4708 KB	Output is correct : V - N = 12
146	Correct	3 ms	4716 KB	Output is correct : V - N = 12
147	Correct	3 ms	4724 KB	Output is correct : V - N = 12
148	Correct	3 ms	4644 KB	Output is correct : V - N = 12
149	Correct	3 ms	4652 KB	Output is correct : V - N = 12
150	Correct	3 ms	4516 KB	Output is correct : V - N = 12
151	Correct	3 ms	4712 KB	Output is correct : V - N = 12
152	Correct	3 ms	4584 KB	Output is correct : V - N = 12
153	Correct	4 ms	4712 KB	Output is correct : V - N = 12
154	Correct	3 ms	4656 KB	Output is correct : V - N = 12
155	Correct	3 ms	4712 KB	Output is correct : V - N = 12
156	Correct	3 ms	4716 KB	Output is correct : V - N = 12
157	Correct	3 ms	4708 KB	Output is correct : V - N = 12
158	Correct	3 ms	4644 KB	Output is correct : V - N = 12
159	Correct	3 ms	4716 KB	Output is correct : V - N = 12
160	Correct	4 ms	4628 KB	Output is correct : V - N = 12
161	Correct	3 ms	4712 KB	Output is correct : V - N = 12
162	Correct	3 ms	4696 KB	Output is correct : V - N = 12
163	Correct	3 ms	4712 KB	Output is correct : V - N = 12
164	Correct	3 ms	4692 KB	Output is correct : V - N = 12
165	Correct	3 ms	4712 KB	Output is correct : V - N = 12
166	Correct	3 ms	4696 KB	Output is correct : V - N = 12
167	Correct	3 ms	4652 KB	Output is correct : V - N = 12
168	Correct	3 ms	4640 KB	Output is correct : V - N = 12
169	Correct	3 ms	4716 KB	Output is correct : V - N = 12
170	Correct	3 ms	4624 KB	Output is correct : V - N = 12
171	Correct	3 ms	4564 KB	Output is correct : V - N = 12
172	Correct	3 ms	4696 KB	Output is correct : V - N = 12
173	Correct	3 ms	4520 KB	Output is correct : V - N = 12
174	Correct	4 ms	4668 KB	Output is correct : V - N = 12
175	Correct	4 ms	4660 KB	Output is correct : V - N = 12
176	Correct	3 ms	4724 KB	Output is correct : V - N = 12
177	Correct	3 ms	4712 KB	Output is correct : V - N = 12
178	Correct	3 ms	4740 KB	Output is correct : V - N = 12

답안 #407106

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 15.0 / 15.0

Subtask #3 63.0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
15.0 / 15.0

Subtask #3
63.0 / 63.0