Submission #166333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
166333	2019-12-01T14:53:22 Z	georgerapeanu	Airline Route Map (JOI18_airline)	C++11	100 / 100	1000 ms	30928 KB

Alice

#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#pragma once
#include <algorithm>
#include <vector>

using namespace std;

const int NMAX = 1e3;
const int LGMAX = 10;

void Alice( int n, int m, int a[], int b[] ){
    vector<pair<int,int> > edges;
    for(int i = 0;i < m;i++){
        edges.push_back({a[i] + 1,b[i] + 1});
    }

    for(int h = 0;h < LGMAX;h++){
        for(int i = 1;i <= n;i++){
            if((i >> h) & 1){
                edges.push_back({i,n + 1 + h});
            }
        }
    }

    for(int i = n + 1;i <= n + LGMAX;i++){
        edges.push_back({n + LGMAX + 1,i});
        if(i > n + 1){
            edges.push_back({i - 1,i});
        }
    }
    edges.push_back({n + LGMAX + 2,n + 1});

    InitG(n + LGMAX + 2,edges.size());

    for(int i = 0;i < (int)edges.size();i++){
        MakeG(i,edges[i].first - 1,edges[i].second - 1);
    }
}

Bob

#include "Boblib.h"
#include <cassert>
#include <cstdio>
#pragma once
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 1e3;
const int LGMAX = 10;

static int gr[NMAX + LGMAX + 5];
static vector<int> graph[NMAX + LGMAX + 5];
int exp_gr[LGMAX + 2];
int tag[NMAX + LGMAX + 5];

bool maybe_power[LGMAX + 5];

void Bob( int n, int m, int a[], int b[] ){
	for(int i = 0;i < m;i++){
        gr[a[i] + 1]++;
        gr[b[i] + 1]++; 
        graph[a[i] + 1].push_back(b[i] + 1);
        graph[b[i] + 1].push_back(a[i] + 1);
    }

    for(int h = 0;h < LGMAX;h++){
        exp_gr[h]++;///from master
        exp_gr[h]++;///from prev
        if(h < LGMAX - 1){///from nxt
            exp_gr[h]++;
        }
        for(int i = 1;i <= n - LGMAX - 2;i++){
            if((i >> h) & 1){
                exp_gr[h]++;
            }
        }
    }


    sort(exp_gr,exp_gr + LGMAX);
    reverse(exp_gr,exp_gr + LGMAX);


    int master_node = -1;
    int control_node = -1;

    vector<int> power_nodes;

    for(int i = 1;i <= n;i++){
        if(gr[i] == LGMAX){
            sort(graph[i].begin(),graph[i].end(),[&](int a,int b){return gr[a] > gr[b];});
            bool ok = true;
            for(int h = 0;h < LGMAX;h++){
                ok &= (exp_gr[h] == gr[graph[i][h]]);
            }
            if(ok == false){
                continue;
            }
            ///maybe i is master
            for(auto it:graph[i]){
                maybe_power[it] = true;
            }

            int fst = -1;

            for(auto it:graph[i]){
                int cnt = 0;
                for(auto it2:graph[it]){
                    cnt += maybe_power[it2];
                }
                if(cnt == 1 && (fst == -1 || gr[fst] < gr[it])){
                    fst = it;        
                }
            }

            if(fst != -1){
                master_node = i;
                for(auto it:graph[fst]){
                    if(gr[it] == 1){
                        control_node = it;
                        break;
                    }
                }
                while(true){
                    int nxt = -1;
                    power_nodes.push_back(fst);
                    maybe_power[fst] = false;
                    for(auto it:graph[fst]){
                        if(maybe_power[it]){
                            nxt = it;
                            break;
                        }
                    }
                    if(nxt == -1){
                        break;
                    }
                    fst = nxt;
                }
                break;
            }

            for(auto it:graph[i]){
                maybe_power[it] = false;
            }
        }
    }

    ///detect and sort power_nodes

    assert(master_node != -1);
            
    tag[master_node] = -1;
    tag[control_node] = -1;

    for(auto it:power_nodes){
        tag[it] = -1;
    }

    for(int i = 0;i < LGMAX;i++){
        for(auto it:graph[power_nodes[i]]){
            if(tag[it] != -1){
                tag[it] |= (1 << i);
            }
        }
    }

    vector<pair<int,int> > edges;

    for(int i = 0;i < m;i++){
        if(tag[a[i] + 1] != -1 && tag[b[i] + 1] != -1){
            edges.push_back({tag[a[i] + 1],tag[b[i] + 1]});
        }
    }

    InitMap(n - LGMAX - 2,edges.size());

    for(auto it:edges){
        MakeMap(it.first - 1,it.second - 1);
    }
}

Compilation message

Alice.cpp:4:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Bob.cpp:4:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Subtask #1

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	6640 KB	Output is correct
2	Correct	9 ms	6896 KB	Output is correct
3	Correct	9 ms	6640 KB	Output is correct
4	Correct	9 ms	6896 KB	Output is correct
5	Correct	9 ms	6640 KB	Output is correct
6	Correct	9 ms	6896 KB	Output is correct
7	Correct	3 ms	6640 KB	Output is correct
8	Correct	9 ms	6896 KB	Output is correct
9	Correct	9 ms	6640 KB	Output is correct
10	Correct	9 ms	6896 KB	Output is correct
11	Correct	9 ms	6896 KB	Output is correct
12	Correct	9 ms	6648 KB	Output is correct
13	Correct	9 ms	6640 KB	Output is correct
14	Correct	9 ms	6896 KB	Output is correct
15	Correct	9 ms	6896 KB	Output is correct
16	Correct	9 ms	6896 KB	Output is correct
17	Correct	9 ms	6640 KB	Output is correct
18	Correct	9 ms	6896 KB	Output is correct
19	Correct	9 ms	6896 KB	Output is correct
20	Correct	9 ms	6640 KB	Output is correct
21	Correct	9 ms	6584 KB	Output is correct
22	Correct	9 ms	6640 KB	Output is correct
23	Correct	9 ms	6640 KB	Output is correct
24	Correct	9 ms	6896 KB	Output is correct
25	Correct	9 ms	6640 KB	Output is correct
26	Correct	9 ms	6904 KB	Output is correct
27	Correct	9 ms	6896 KB	Output is correct
28	Correct	9 ms	6640 KB	Output is correct
29	Correct	9 ms	6640 KB	Output is correct
30	Correct	9 ms	6640 KB	Output is correct
31	Correct	9 ms	6896 KB	Output is correct
32	Correct	9 ms	6896 KB	Output is correct
33	Correct	9 ms	6640 KB	Output is correct
34	Correct	9 ms	6896 KB	Output is correct
35	Correct	9 ms	6896 KB	Output is correct
36	Correct	9 ms	6896 KB	Output is correct
37	Correct	9 ms	6744 KB	Output is correct
38	Correct	9 ms	6896 KB	Output is correct
39	Correct	9 ms	6896 KB	Output is correct
40	Correct	9 ms	6640 KB	Output is correct
41	Correct	9 ms	6896 KB	Output is correct
42	Correct	9 ms	6896 KB	Output is correct
43	Correct	9 ms	6640 KB	Output is correct
44	Correct	9 ms	6896 KB	Output is correct
45	Correct	9 ms	6984 KB	Output is correct
46	Correct	9 ms	7152 KB	Output is correct
47	Correct	9 ms	6640 KB	Output is correct
48	Correct	9 ms	6640 KB	Output is correct
49	Correct	9 ms	6640 KB	Output is correct
50	Correct	9 ms	6640 KB	Output is correct
51	Correct	9 ms	6640 KB	Output is correct
52	Correct	9 ms	6896 KB	Output is correct
53	Correct	9 ms	6896 KB	Output is correct
54	Correct	9 ms	6648 KB	Output is correct
55	Correct	9 ms	6640 KB	Output is correct
56	Correct	9 ms	6896 KB	Output is correct
57	Correct	9 ms	6640 KB	Output is correct
58	Correct	9 ms	6896 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	6640 KB	Output is correct
2	Correct	9 ms	6896 KB	Output is correct
3	Correct	9 ms	6640 KB	Output is correct
4	Correct	9 ms	6896 KB	Output is correct
5	Correct	9 ms	6640 KB	Output is correct
6	Correct	9 ms	6896 KB	Output is correct
7	Correct	3 ms	6640 KB	Output is correct
8	Correct	9 ms	6896 KB	Output is correct
9	Correct	9 ms	6640 KB	Output is correct
10	Correct	9 ms	6896 KB	Output is correct
11	Correct	9 ms	6896 KB	Output is correct
12	Correct	9 ms	6648 KB	Output is correct
13	Correct	9 ms	6640 KB	Output is correct
14	Correct	9 ms	6896 KB	Output is correct
15	Correct	9 ms	6896 KB	Output is correct
16	Correct	9 ms	6896 KB	Output is correct
17	Correct	9 ms	6640 KB	Output is correct
18	Correct	9 ms	6896 KB	Output is correct
19	Correct	9 ms	6896 KB	Output is correct
20	Correct	9 ms	6640 KB	Output is correct
21	Correct	9 ms	6584 KB	Output is correct
22	Correct	9 ms	6640 KB	Output is correct
23	Correct	9 ms	6640 KB	Output is correct
24	Correct	9 ms	6896 KB	Output is correct
25	Correct	9 ms	6640 KB	Output is correct
26	Correct	9 ms	6904 KB	Output is correct
27	Correct	9 ms	6896 KB	Output is correct
28	Correct	9 ms	6640 KB	Output is correct
29	Correct	9 ms	6640 KB	Output is correct
30	Correct	9 ms	6640 KB	Output is correct
31	Correct	9 ms	6896 KB	Output is correct
32	Correct	9 ms	6896 KB	Output is correct
33	Correct	9 ms	6640 KB	Output is correct
34	Correct	9 ms	6896 KB	Output is correct
35	Correct	9 ms	6896 KB	Output is correct
36	Correct	9 ms	6896 KB	Output is correct
37	Correct	9 ms	6744 KB	Output is correct
38	Correct	9 ms	6896 KB	Output is correct
39	Correct	9 ms	6896 KB	Output is correct
40	Correct	9 ms	6640 KB	Output is correct
41	Correct	9 ms	6896 KB	Output is correct
42	Correct	9 ms	6896 KB	Output is correct
43	Correct	9 ms	6640 KB	Output is correct
44	Correct	9 ms	6896 KB	Output is correct
45	Correct	9 ms	6984 KB	Output is correct
46	Correct	9 ms	7152 KB	Output is correct
47	Correct	9 ms	6640 KB	Output is correct
48	Correct	9 ms	6640 KB	Output is correct
49	Correct	9 ms	6640 KB	Output is correct
50	Correct	9 ms	6640 KB	Output is correct
51	Correct	9 ms	6640 KB	Output is correct
52	Correct	9 ms	6896 KB	Output is correct
53	Correct	9 ms	6896 KB	Output is correct
54	Correct	9 ms	6648 KB	Output is correct
55	Correct	9 ms	6640 KB	Output is correct
56	Correct	9 ms	6896 KB	Output is correct
57	Correct	9 ms	6640 KB	Output is correct
58	Correct	9 ms	6896 KB	Output is correct
59	Correct	9 ms	6896 KB	Output is correct
60	Correct	9 ms	6896 KB	Output is correct
61	Correct	9 ms	6640 KB	Output is correct
62	Correct	9 ms	6896 KB	Output is correct
63	Correct	9 ms	6640 KB	Output is correct
64	Correct	9 ms	6896 KB	Output is correct
65	Correct	9 ms	6640 KB	Output is correct
66	Correct	9 ms	6896 KB	Output is correct
67	Correct	10 ms	6896 KB	Output is correct
68	Correct	9 ms	6648 KB	Output is correct
69	Correct	9 ms	6896 KB	Output is correct
70	Correct	9 ms	6896 KB	Output is correct
71	Correct	9 ms	6896 KB	Output is correct
72	Correct	13 ms	7152 KB	Output is correct
73	Correct	9 ms	6648 KB	Output is correct
74	Correct	9 ms	6640 KB	Output is correct
75	Correct	10 ms	6896 KB	Output is correct
76	Correct	9 ms	6640 KB	Output is correct
77	Correct	10 ms	6640 KB	Output is correct
78	Correct	9 ms	6904 KB	Output is correct
79	Correct	9 ms	6648 KB	Output is correct
80	Correct	9 ms	6640 KB	Output is correct
81	Correct	9 ms	6896 KB	Output is correct
82	Correct	9 ms	6896 KB	Output is correct
83	Correct	9 ms	6896 KB	Output is correct
84	Correct	9 ms	6640 KB	Output is correct
85	Correct	9 ms	6896 KB	Output is correct
86	Correct	9 ms	6640 KB	Output is correct
87	Correct	9 ms	6640 KB	Output is correct
88	Correct	9 ms	6896 KB	Output is correct
89	Correct	9 ms	6896 KB	Output is correct
90	Correct	9 ms	6896 KB	Output is correct
91	Correct	9 ms	6896 KB	Output is correct
92	Correct	9 ms	6640 KB	Output is correct
93	Correct	9 ms	6640 KB	Output is correct
94	Correct	9 ms	6896 KB	Output is correct
95	Correct	9 ms	6640 KB	Output is correct
96	Correct	9 ms	6640 KB	Output is correct
97	Correct	9 ms	6640 KB	Output is correct
98	Correct	9 ms	6640 KB	Output is correct
99	Correct	9 ms	6896 KB	Output is correct
100	Correct	9 ms	6640 KB	Output is correct
101	Correct	9 ms	6640 KB	Output is correct
102	Correct	9 ms	6896 KB	Output is correct
103	Correct	9 ms	6896 KB	Output is correct
104	Correct	9 ms	6640 KB	Output is correct
105	Correct	9 ms	6896 KB	Output is correct
106	Correct	9 ms	6640 KB	Output is correct
107	Correct	9 ms	6896 KB	Output is correct
108	Correct	9 ms	6640 KB	Output is correct
109	Correct	9 ms	6640 KB	Output is correct
110	Correct	9 ms	6736 KB	Output is correct
111	Correct	9 ms	6896 KB	Output is correct
112	Correct	9 ms	6640 KB	Output is correct
113	Correct	9 ms	6640 KB	Output is correct
114	Correct	9 ms	6640 KB	Output is correct
115	Correct	9 ms	6640 KB	Output is correct
116	Correct	9 ms	6640 KB	Output is correct
117	Correct	9 ms	6896 KB	Output is correct
118	Correct	9 ms	6896 KB	Output is correct

Subtask #3

63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	955 ms	30768 KB	Output is correct : V - N = 12
2	Correct	777 ms	25676 KB	Output is correct : V - N = 12
3	Correct	299 ms	14000 KB	Output is correct : V - N = 12
4	Correct	16 ms	7152 KB	Output is correct : V - N = 12
5	Correct	198 ms	11472 KB	Output is correct : V - N = 12
6	Correct	634 ms	23692 KB	Output is correct : V - N = 12
7	Correct	990 ms	30384 KB	Output is correct : V - N = 12
8	Correct	914 ms	27728 KB	Output is correct : V - N = 12
9	Correct	425 ms	17280 KB	Output is correct : V - N = 12
10	Correct	56 ms	8424 KB	Output is correct : V - N = 12
11	Correct	92 ms	8896 KB	Output is correct : V - N = 12
12	Correct	492 ms	18992 KB	Output is correct : V - N = 12
13	Correct	948 ms	29064 KB	Output is correct : V - N = 12
14	Correct	984 ms	29752 KB	Output is correct : V - N = 12
15	Correct	588 ms	22588 KB	Output is correct : V - N = 12
16	Correct	135 ms	9928 KB	Output is correct : V - N = 12
17	Correct	24 ms	7696 KB	Output is correct : V - N = 12
18	Correct	276 ms	15672 KB	Output is correct : V - N = 12
19	Correct	928 ms	26680 KB	Output is correct : V - N = 12
20	Correct	952 ms	30376 KB	Output is correct : V - N = 12
21	Correct	257 ms	13224 KB	Output is correct : V - N = 12
22	Correct	233 ms	11640 KB	Output is correct : V - N = 12
23	Correct	81 ms	8864 KB	Output is correct : V - N = 12
24	Correct	12 ms	6896 KB	Output is correct : V - N = 12
25	Correct	53 ms	8272 KB	Output is correct : V - N = 12
26	Correct	193 ms	11056 KB	Output is correct : V - N = 12
27	Correct	264 ms	13120 KB	Output is correct : V - N = 12
28	Correct	244 ms	12528 KB	Output is correct : V - N = 12
29	Correct	130 ms	9616 KB	Output is correct : V - N = 12
30	Correct	16 ms	7408 KB	Output is correct : V - N = 12
31	Correct	14 ms	7152 KB	Output is correct : V - N = 12
32	Correct	14 ms	7152 KB	Output is correct : V - N = 12
33	Correct	13 ms	7152 KB	Output is correct : V - N = 12
34	Correct	14 ms	7152 KB	Output is correct : V - N = 12
35	Correct	14 ms	6992 KB	Output is correct : V - N = 12
36	Correct	980 ms	30768 KB	Output is correct : V - N = 12
37	Correct	984 ms	30656 KB	Output is correct : V - N = 12
38	Correct	976 ms	30736 KB	Output is correct : V - N = 12
39	Correct	979 ms	30928 KB	Output is correct : V - N = 12
40	Correct	990 ms	30472 KB	Output is correct : V - N = 12
41	Correct	217 ms	11216 KB	Output is correct : V - N = 12
42	Correct	145 ms	10192 KB	Output is correct : V - N = 12
43	Correct	153 ms	10776 KB	Output is correct : V - N = 12
44	Correct	26 ms	7152 KB	Output is correct : V - N = 12
45	Correct	99 ms	9184 KB	Output is correct : V - N = 12
46	Correct	322 ms	14736 KB	Output is correct : V - N = 12
47	Correct	199 ms	11144 KB	Output is correct : V - N = 12
48	Correct	444 ms	17352 KB	Output is correct : V - N = 12
49	Correct	83 ms	8880 KB	Output is correct : V - N = 12
50	Correct	26 ms	7664 KB	Output is correct : V - N = 12
51	Correct	770 ms	25744 KB	Output is correct : V - N = 12
52	Correct	16 ms	7152 KB	Output is correct : V - N = 12
53	Correct	662 ms	23524 KB	Output is correct : V - N = 12
54	Correct	869 ms	27216 KB	Output is correct : V - N = 12
55	Correct	57 ms	8168 KB	Output is correct : V - N = 12
56	Correct	461 ms	18784 KB	Output is correct : V - N = 12
57	Correct	905 ms	29048 KB	Output is correct : V - N = 12
58	Correct	131 ms	9800 KB	Output is correct : V - N = 12
59	Correct	350 ms	15520 KB	Output is correct : V - N = 12
60	Correct	1000 ms	29656 KB	Output is correct : V - N = 12
61	Correct	9 ms	6640 KB	Output is correct : V - N = 12
62	Correct	9 ms	6640 KB	Output is correct : V - N = 12
63	Correct	9 ms	6896 KB	Output is correct : V - N = 12
64	Correct	9 ms	6640 KB	Output is correct : V - N = 12
65	Correct	9 ms	6896 KB	Output is correct : V - N = 12
66	Correct	9 ms	6640 KB	Output is correct : V - N = 12
67	Correct	20 ms	6896 KB	Output is correct : V - N = 12
68	Correct	10 ms	6896 KB	Output is correct : V - N = 12
69	Correct	9 ms	6896 KB	Output is correct : V - N = 12
70	Correct	9 ms	6640 KB	Output is correct : V - N = 12
71	Correct	9 ms	6736 KB	Output is correct : V - N = 12
72	Correct	9 ms	6640 KB	Output is correct : V - N = 12
73	Correct	9 ms	6896 KB	Output is correct : V - N = 12
74	Correct	9 ms	6640 KB	Output is correct : V - N = 12
75	Correct	9 ms	6640 KB	Output is correct : V - N = 12
76	Correct	9 ms	6640 KB	Output is correct : V - N = 12
77	Correct	9 ms	6640 KB	Output is correct : V - N = 12
78	Correct	9 ms	6896 KB	Output is correct : V - N = 12
79	Correct	9 ms	6640 KB	Output is correct : V - N = 12
80	Correct	10 ms	6640 KB	Output is correct : V - N = 12
81	Correct	13 ms	7152 KB	Output is correct : V - N = 12
82	Correct	9 ms	6896 KB	Output is correct : V - N = 12
83	Correct	9 ms	6736 KB	Output is correct : V - N = 12
84	Correct	9 ms	6904 KB	Output is correct : V - N = 12
85	Correct	19 ms	6640 KB	Output is correct : V - N = 12
86	Correct	9 ms	6640 KB	Output is correct : V - N = 12
87	Correct	9 ms	6640 KB	Output is correct : V - N = 12
88	Correct	10 ms	6640 KB	Output is correct : V - N = 12
89	Correct	9 ms	6640 KB	Output is correct : V - N = 12
90	Correct	9 ms	6896 KB	Output is correct : V - N = 12
91	Correct	9 ms	6640 KB	Output is correct : V - N = 12
92	Correct	9 ms	6640 KB	Output is correct : V - N = 12
93	Correct	9 ms	6640 KB	Output is correct : V - N = 12
94	Correct	9 ms	6640 KB	Output is correct : V - N = 12
95	Correct	9 ms	6648 KB	Output is correct : V - N = 12
96	Correct	9 ms	6896 KB	Output is correct : V - N = 12
97	Correct	10 ms	6640 KB	Output is correct : V - N = 12
98	Correct	9 ms	6640 KB	Output is correct : V - N = 12
99	Correct	9 ms	6800 KB	Output is correct : V - N = 12
100	Correct	11 ms	6896 KB	Output is correct : V - N = 12
101	Correct	9 ms	6896 KB	Output is correct : V - N = 12
102	Correct	9 ms	6848 KB	Output is correct : V - N = 12
103	Correct	9 ms	6896 KB	Output is correct : V - N = 12
104	Correct	9 ms	6640 KB	Output is correct : V - N = 12
105	Correct	9 ms	6896 KB	Output is correct : V - N = 12
106	Correct	9 ms	6640 KB	Output is correct : V - N = 12
107	Correct	9 ms	6736 KB	Output is correct : V - N = 12
108	Correct	9 ms	6896 KB	Output is correct : V - N = 12
109	Correct	7 ms	6896 KB	Output is correct : V - N = 12
110	Correct	9 ms	6640 KB	Output is correct : V - N = 12
111	Correct	9 ms	6640 KB	Output is correct : V - N = 12
112	Correct	9 ms	6640 KB	Output is correct : V - N = 12
113	Correct	8 ms	6896 KB	Output is correct : V - N = 12
114	Correct	9 ms	6640 KB	Output is correct : V - N = 12
115	Correct	9 ms	6640 KB	Output is correct : V - N = 12
116	Correct	9 ms	6640 KB	Output is correct : V - N = 12
117	Correct	9 ms	6736 KB	Output is correct : V - N = 12
118	Correct	9 ms	6640 KB	Output is correct : V - N = 12
119	Correct	9 ms	6640 KB	Output is correct : V - N = 12
120	Correct	9 ms	6640 KB	Output is correct : V - N = 12
121	Correct	9 ms	6624 KB	Output is correct : V - N = 12
122	Correct	9 ms	6640 KB	Output is correct : V - N = 12
123	Correct	9 ms	6640 KB	Output is correct : V - N = 12
124	Correct	9 ms	6640 KB	Output is correct : V - N = 12
125	Correct	9 ms	6896 KB	Output is correct : V - N = 12
126	Correct	9 ms	6704 KB	Output is correct : V - N = 12
127	Correct	9 ms	6896 KB	Output is correct : V - N = 12
128	Correct	9 ms	6640 KB	Output is correct : V - N = 12
129	Correct	9 ms	6736 KB	Output is correct : V - N = 12
130	Correct	9 ms	6896 KB	Output is correct : V - N = 12
131	Correct	9 ms	6640 KB	Output is correct : V - N = 12
132	Correct	9 ms	6896 KB	Output is correct : V - N = 12
133	Correct	9 ms	6736 KB	Output is correct : V - N = 12
134	Correct	9 ms	6896 KB	Output is correct : V - N = 12
135	Correct	9 ms	6896 KB	Output is correct : V - N = 12
136	Correct	9 ms	6640 KB	Output is correct : V - N = 12
137	Correct	9 ms	6896 KB	Output is correct : V - N = 12
138	Correct	9 ms	6896 KB	Output is correct : V - N = 12
139	Correct	9 ms	6896 KB	Output is correct : V - N = 12
140	Correct	9 ms	6640 KB	Output is correct : V - N = 12
141	Correct	9 ms	6640 KB	Output is correct : V - N = 12
142	Correct	9 ms	6640 KB	Output is correct : V - N = 12
143	Correct	9 ms	6896 KB	Output is correct : V - N = 12
144	Correct	9 ms	6736 KB	Output is correct : V - N = 12
145	Correct	9 ms	6640 KB	Output is correct : V - N = 12
146	Correct	9 ms	6736 KB	Output is correct : V - N = 12
147	Correct	9 ms	6640 KB	Output is correct : V - N = 12
148	Correct	9 ms	6640 KB	Output is correct : V - N = 12
149	Correct	9 ms	6640 KB	Output is correct : V - N = 12
150	Correct	9 ms	6640 KB	Output is correct : V - N = 12
151	Correct	9 ms	6896 KB	Output is correct : V - N = 12
152	Correct	9 ms	6640 KB	Output is correct : V - N = 12
153	Correct	7 ms	6896 KB	Output is correct : V - N = 12
154	Correct	9 ms	6640 KB	Output is correct : V - N = 12
155	Correct	7 ms	6896 KB	Output is correct : V - N = 12
156	Correct	24 ms	6640 KB	Output is correct : V - N = 12
157	Correct	9 ms	6896 KB	Output is correct : V - N = 12
158	Correct	9 ms	6640 KB	Output is correct : V - N = 12
159	Correct	9 ms	6896 KB	Output is correct : V - N = 12
160	Correct	9 ms	6896 KB	Output is correct : V - N = 12
161	Correct	9 ms	6640 KB	Output is correct : V - N = 12
162	Correct	9 ms	6896 KB	Output is correct : V - N = 12
163	Correct	9 ms	6640 KB	Output is correct : V - N = 12
164	Correct	9 ms	6896 KB	Output is correct : V - N = 12
165	Correct	9 ms	6640 KB	Output is correct : V - N = 12
166	Correct	9 ms	6640 KB	Output is correct : V - N = 12
167	Correct	9 ms	6640 KB	Output is correct : V - N = 12
168	Correct	9 ms	6896 KB	Output is correct : V - N = 12
169	Correct	9 ms	6896 KB	Output is correct : V - N = 12
170	Correct	9 ms	6640 KB	Output is correct : V - N = 12
171	Correct	9 ms	6896 KB	Output is correct : V - N = 12
172	Correct	9 ms	6640 KB	Output is correct : V - N = 12
173	Correct	9 ms	6896 KB	Output is correct : V - N = 12
174	Correct	9 ms	7160 KB	Output is correct : V - N = 12
175	Correct	9 ms	6640 KB	Output is correct : V - N = 12
176	Correct	9 ms	6640 KB	Output is correct : V - N = 12
177	Correct	9 ms	6896 KB	Output is correct : V - N = 12
178	Correct	9 ms	6736 KB	Output is correct : V - N = 12