답안 #172695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172695	2020-01-02T12:00:25 Z	balbit	항공 노선도 (JOI18_airline)	C++14	100 / 100	994 ms	30960 KB

Alice
Bob

#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stdout,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__),fflush(stdout);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}


void Alice( int N, int M, int A[], int B[] ){
    vector<pii> edges;
    int marker = N;
    int dummy = N+1;
	REP(i,M) {
        edges.pb({A[i],B[i]});
	}
	REP(i,N) {
        edges.pb({marker,i});
	}
	edges.pb({marker, dummy});
	REP(i,10) {
        REP(j,N) {
            if ((j+1)&(1<<i)) {
                edges.pb({j,dummy+1+i});
//                bug(j, dummy+1+i);
            }
        }
	}
	REP(i,9) edges.pb({dummy+1+i, dummy+1+i+1});
	edges.pb({dummy+8, dummy+10});
	edges.pb({dummy+7, dummy+10});
	edges.pb({dummy+6, dummy+10});
	InitG(N+12, edges.size());
	int tmp = 0;
	for (pii & ed: edges){
//        cout<<ed.f<<" -> "<<ed.s<<endl;
        MakeG(tmp++, ed.f, ed.s);
	}
}

#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;



const int maxn = 1e3+100;
vector<int> g[maxn];
bool node[maxn];
bool spe[maxn];
int odeg[maxn];// Degree for special nodes, to special nodes
int id[maxn];

#ifdef BALBIT
#define debug(x) cout<<#x<<" is "<<x<<endl
#else
#define debug(x)
#endif
void ass(bool x) {
    if (!x) {
        InitMap(-1,-1); exit(0);
    }
}

void Bob( int V, int U, int C[], int D[] ){
    int marker = -1;
    int dummy = -1;
//    cout<<" ====== Bob time ======= "<<endl;
    REP(i,U) {
//        cout<<C[i]<<" - "<<D[i]<<endl;
        g[C[i]].pb(D[i]); g[D[i]].pb(C[i]);
    }
    REP(i,V) {
        if (SZ(g[i])==1) {
            ass(dummy == -1);
            dummy = i;
        }
    }
    debug(dummy);
    ass(dummy!=-1);
    marker = g[dummy][0];
    for (int x : g[marker]) {
        if (x!=dummy) node[x] = 1;
    }
    vector<int> ten; // The ten special nodes
    REP(i,V) {
        if (i!=marker && i!=dummy && !node[i]) spe[i] = 1;
    }
    REP(i,V) {
        if (spe[i]) {
            for (int u : g[i]) {
                odeg[i] += spe[u];
            }
        }
    }
    int zero = -1;
    REP(i,V) {
        if (spe[i]) {
            if (odeg[i] == 1) zero = i;
        }
    }
    ass(zero!=-1);
    ten.pb(zero);
    REP(i,9) {
        spe[zero] = 0;
        for (int u : g[zero]) {
            if (spe[u] && (i==8 || odeg[u]!=4)) {
                zero = u; break;
            }
        }
        ten.pb(zero);
    }
//    cout<<"Things in ten: "<<endl;
//    REP(i,10) {
//        debug(ten[i]);
//    }
    if (SZ(ten)!=10) MakeMap(-1,-1);
    REP(i, SZ(ten)) {
        for (int u : g[ten[i]]) if (node[u]) id[u] += (1<<i);
    }
    REP(i, V) {
        if (node[i]) id[i]--;
    }
    vector<pii> edges;
    REP(i, V) {
        if (node[i]) {
            for (int u: g[i]) {
                if (node[u]) if (id[i]<id[u]) edges.pb({id[i], id[u]});
            }
        }
    }
    bug(SZ(edges));
//    cout<<SZ(edges)<<endl;
//    for (pii & ed: edges){
//        cout<<ed.f<<' '<<ed.s<<endl;
//    }
	InitMap( V-12, SZ(edges) );
	for (pii & ed: edges){
        MakeMap(ed.f, ed.s);
	}
}

/*
4 3
0 1
0 2
0 3
*/

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6896 KB	Output is correct
2	Correct	9 ms	6648 KB	Output is correct
3	Correct	9 ms	6896 KB	Output is correct
4	Correct	9 ms	6648 KB	Output is correct
5	Correct	9 ms	6896 KB	Output is correct
6	Correct	9 ms	6896 KB	Output is correct
7	Correct	9 ms	6896 KB	Output is correct
8	Correct	9 ms	6640 KB	Output is correct
9	Correct	9 ms	6640 KB	Output is correct
10	Correct	9 ms	6640 KB	Output is correct
11	Correct	10 ms	6896 KB	Output is correct
12	Correct	9 ms	6896 KB	Output is correct
13	Correct	9 ms	6896 KB	Output is correct
14	Correct	10 ms	6896 KB	Output is correct
15	Correct	9 ms	6640 KB	Output is correct
16	Correct	9 ms	6640 KB	Output is correct
17	Correct	9 ms	6896 KB	Output is correct
18	Correct	9 ms	6640 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	6640 KB	Output is correct
22	Correct	9 ms	6640 KB	Output is correct
23	Correct	9 ms	6896 KB	Output is correct
24	Correct	9 ms	6640 KB	Output is correct
25	Correct	9 ms	6640 KB	Output is correct
26	Correct	10 ms	6896 KB	Output is correct
27	Correct	10 ms	6736 KB	Output is correct
28	Correct	9 ms	6896 KB	Output is correct
29	Correct	9 ms	6896 KB	Output is correct
30	Correct	9 ms	6896 KB	Output is correct
31	Correct	7 ms	6640 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	6640 KB	Output is correct
36	Correct	9 ms	6640 KB	Output is correct
37	Correct	9 ms	6768 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	6896 KB	Output is correct
41	Correct	10 ms	6904 KB	Output is correct
42	Correct	7 ms	6640 KB	Output is correct
43	Correct	10 ms	6736 KB	Output is correct
44	Correct	10 ms	6896 KB	Output is correct
45	Correct	4 ms	6640 KB	Output is correct
46	Correct	10 ms	6648 KB	Output is correct
47	Correct	4 ms	6640 KB	Output is correct
48	Correct	9 ms	6640 KB	Output is correct
49	Correct	8 ms	6640 KB	Output is correct
50	Correct	7 ms	6640 KB	Output is correct
51	Correct	8 ms	6648 KB	Output is correct
52	Correct	9 ms	6640 KB	Output is correct
53	Correct	9 ms	6640 KB	Output is correct
54	Correct	9 ms	6640 KB	Output is correct
55	Correct	10 ms	6896 KB	Output is correct
56	Correct	9 ms	6640 KB	Output is correct
57	Correct	9 ms	6640 KB	Output is correct
58	Correct	10 ms	6736 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6896 KB	Output is correct
2	Correct	9 ms	6648 KB	Output is correct
3	Correct	9 ms	6896 KB	Output is correct
4	Correct	9 ms	6648 KB	Output is correct
5	Correct	9 ms	6896 KB	Output is correct
6	Correct	9 ms	6896 KB	Output is correct
7	Correct	9 ms	6896 KB	Output is correct
8	Correct	9 ms	6640 KB	Output is correct
9	Correct	9 ms	6640 KB	Output is correct
10	Correct	9 ms	6640 KB	Output is correct
11	Correct	10 ms	6896 KB	Output is correct
12	Correct	9 ms	6896 KB	Output is correct
13	Correct	9 ms	6896 KB	Output is correct
14	Correct	10 ms	6896 KB	Output is correct
15	Correct	9 ms	6640 KB	Output is correct
16	Correct	9 ms	6640 KB	Output is correct
17	Correct	9 ms	6896 KB	Output is correct
18	Correct	9 ms	6640 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	6640 KB	Output is correct
22	Correct	9 ms	6640 KB	Output is correct
23	Correct	9 ms	6896 KB	Output is correct
24	Correct	9 ms	6640 KB	Output is correct
25	Correct	9 ms	6640 KB	Output is correct
26	Correct	10 ms	6896 KB	Output is correct
27	Correct	10 ms	6736 KB	Output is correct
28	Correct	9 ms	6896 KB	Output is correct
29	Correct	9 ms	6896 KB	Output is correct
30	Correct	9 ms	6896 KB	Output is correct
31	Correct	7 ms	6640 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	6640 KB	Output is correct
36	Correct	9 ms	6640 KB	Output is correct
37	Correct	9 ms	6768 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	6896 KB	Output is correct
41	Correct	10 ms	6904 KB	Output is correct
42	Correct	7 ms	6640 KB	Output is correct
43	Correct	10 ms	6736 KB	Output is correct
44	Correct	10 ms	6896 KB	Output is correct
45	Correct	4 ms	6640 KB	Output is correct
46	Correct	10 ms	6648 KB	Output is correct
47	Correct	4 ms	6640 KB	Output is correct
48	Correct	9 ms	6640 KB	Output is correct
49	Correct	8 ms	6640 KB	Output is correct
50	Correct	7 ms	6640 KB	Output is correct
51	Correct	8 ms	6648 KB	Output is correct
52	Correct	9 ms	6640 KB	Output is correct
53	Correct	9 ms	6640 KB	Output is correct
54	Correct	9 ms	6640 KB	Output is correct
55	Correct	10 ms	6896 KB	Output is correct
56	Correct	9 ms	6640 KB	Output is correct
57	Correct	9 ms	6640 KB	Output is correct
58	Correct	10 ms	6736 KB	Output is correct
59	Correct	9 ms	6640 KB	Output is correct
60	Correct	9 ms	6640 KB	Output is correct
61	Correct	9 ms	6992 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	6640 KB	Output is correct
65	Correct	9 ms	6640 KB	Output is correct
66	Correct	9 ms	6640 KB	Output is correct
67	Correct	9 ms	6640 KB	Output is correct
68	Correct	7 ms	6896 KB	Output is correct
69	Correct	9 ms	6896 KB	Output is correct
70	Correct	9 ms	6640 KB	Output is correct
71	Correct	11 ms	6896 KB	Output is correct
72	Correct	9 ms	6640 KB	Output is correct
73	Correct	10 ms	6640 KB	Output is correct
74	Correct	9 ms	6640 KB	Output is correct
75	Correct	9 ms	6640 KB	Output is correct
76	Correct	9 ms	6640 KB	Output is correct
77	Correct	9 ms	6640 KB	Output is correct
78	Correct	9 ms	6904 KB	Output is correct
79	Correct	9 ms	6896 KB	Output is correct
80	Correct	9 ms	6640 KB	Output is correct
81	Correct	9 ms	6640 KB	Output is correct
82	Correct	9 ms	6904 KB	Output is correct
83	Correct	9 ms	6640 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	6896 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	6640 KB	Output is correct
91	Correct	9 ms	6640 KB	Output is correct
92	Correct	9 ms	6640 KB	Output is correct
93	Correct	9 ms	6896 KB	Output is correct
94	Correct	9 ms	6640 KB	Output is correct
95	Correct	10 ms	6640 KB	Output is correct
96	Correct	10 ms	6896 KB	Output is correct
97	Correct	10 ms	6640 KB	Output is correct
98	Correct	9 ms	6896 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	6896 KB	Output is correct
102	Correct	9 ms	6640 KB	Output is correct
103	Correct	9 ms	6896 KB	Output is correct
104	Correct	10 ms	6736 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	6896 KB	Output is correct
109	Correct	9 ms	6640 KB	Output is correct
110	Correct	9 ms	6640 KB	Output is correct
111	Correct	9 ms	6896 KB	Output is correct
112	Correct	9 ms	6904 KB	Output is correct
113	Correct	9 ms	6896 KB	Output is correct
114	Correct	8 ms	6896 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	6640 KB	Output is correct
118	Correct	11 ms	6896 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	951 ms	30616 KB	Output is correct : V - N = 12
2	Correct	767 ms	25696 KB	Output is correct : V - N = 12
3	Correct	282 ms	13924 KB	Output is correct : V - N = 12
4	Correct	16 ms	7248 KB	Output is correct : V - N = 12
5	Correct	181 ms	11160 KB	Output is correct : V - N = 12
6	Correct	618 ms	23816 KB	Output is correct : V - N = 12
7	Correct	962 ms	30240 KB	Output is correct : V - N = 12
8	Correct	849 ms	27944 KB	Output is correct : V - N = 12
9	Correct	455 ms	17416 KB	Output is correct : V - N = 12
10	Correct	61 ms	8176 KB	Output is correct : V - N = 12
11	Correct	101 ms	9112 KB	Output is correct : V - N = 12
12	Correct	504 ms	18984 KB	Output is correct : V - N = 12
13	Correct	885 ms	28864 KB	Output is correct : V - N = 12
14	Correct	920 ms	29720 KB	Output is correct : V - N = 12
15	Correct	632 ms	22788 KB	Output is correct : V - N = 12
16	Correct	139 ms	10080 KB	Output is correct : V - N = 12
17	Correct	34 ms	7664 KB	Output is correct : V - N = 12
18	Correct	347 ms	15912 KB	Output is correct : V - N = 12
19	Correct	794 ms	26620 KB	Output is correct : V - N = 12
20	Correct	984 ms	30528 KB	Output is correct : V - N = 12
21	Correct	246 ms	13272 KB	Output is correct : V - N = 12
22	Correct	193 ms	11776 KB	Output is correct : V - N = 12
23	Correct	78 ms	8928 KB	Output is correct : V - N = 12
24	Correct	12 ms	7152 KB	Output is correct : V - N = 12
25	Correct	52 ms	8040 KB	Output is correct : V - N = 12
26	Correct	170 ms	11008 KB	Output is correct : V - N = 12
27	Correct	256 ms	13136 KB	Output is correct : V - N = 12
28	Correct	227 ms	12496 KB	Output is correct : V - N = 12
29	Correct	119 ms	10048 KB	Output is correct : V - N = 12
30	Correct	15 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	7160 KB	Output is correct : V - N = 12
33	Correct	15 ms	6952 KB	Output is correct : V - N = 12
34	Correct	14 ms	7048 KB	Output is correct : V - N = 12
35	Correct	14 ms	7152 KB	Output is correct : V - N = 12
36	Correct	981 ms	30552 KB	Output is correct : V - N = 12
37	Correct	909 ms	30856 KB	Output is correct : V - N = 12
38	Correct	938 ms	30632 KB	Output is correct : V - N = 12
39	Correct	994 ms	30776 KB	Output is correct : V - N = 12
40	Correct	926 ms	30960 KB	Output is correct : V - N = 12
41	Correct	149 ms	11152 KB	Output is correct : V - N = 12
42	Correct	145 ms	10008 KB	Output is correct : V - N = 12
43	Correct	153 ms	10584 KB	Output is correct : V - N = 12
44	Correct	15 ms	7408 KB	Output is correct : V - N = 12
45	Correct	88 ms	9304 KB	Output is correct : V - N = 12
46	Correct	302 ms	14880 KB	Output is correct : V - N = 12
47	Correct	138 ms	11056 KB	Output is correct : V - N = 12
48	Correct	406 ms	17608 KB	Output is correct : V - N = 12
49	Correct	65 ms	8928 KB	Output is correct : V - N = 12
50	Correct	26 ms	7664 KB	Output is correct : V - N = 12
51	Correct	684 ms	25700 KB	Output is correct : V - N = 12
52	Correct	16 ms	7504 KB	Output is correct : V - N = 12
53	Correct	559 ms	23480 KB	Output is correct : V - N = 12
54	Correct	809 ms	27248 KB	Output is correct : V - N = 12
55	Correct	53 ms	8424 KB	Output is correct : V - N = 12
56	Correct	475 ms	18512 KB	Output is correct : V - N = 12
57	Correct	850 ms	29112 KB	Output is correct : V - N = 12
58	Correct	120 ms	9992 KB	Output is correct : V - N = 12
59	Correct	293 ms	15576 KB	Output is correct : V - N = 12
60	Correct	873 ms	30008 KB	Output is correct : V - N = 12
61	Correct	9 ms	6896 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	6896 KB	Output is correct : V - N = 12
65	Correct	9 ms	6896 KB	Output is correct : V - N = 12
66	Correct	9 ms	6896 KB	Output is correct : V - N = 12
67	Correct	7 ms	6640 KB	Output is correct : V - N = 12
68	Correct	11 ms	6896 KB	Output is correct : V - N = 12
69	Correct	9 ms	6896 KB	Output is correct : V - N = 12
70	Correct	10 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	10 ms	6896 KB	Output is correct : V - N = 12
74	Correct	9 ms	6896 KB	Output is correct : V - N = 12
75	Correct	10 ms	6896 KB	Output is correct : V - N = 12
76	Correct	9 ms	6640 KB	Output is correct : V - N = 12
77	Correct	9 ms	6896 KB	Output is correct : V - N = 12
78	Correct	9 ms	6640 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	9 ms	6640 KB	Output is correct : V - N = 12
82	Correct	9 ms	6896 KB	Output is correct : V - N = 12
83	Correct	9 ms	6896 KB	Output is correct : V - N = 12
84	Correct	9 ms	6640 KB	Output is correct : V - N = 12
85	Correct	9 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	9 ms	6640 KB	Output is correct : V - N = 12
89	Correct	9 ms	6896 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	6904 KB	Output is correct : V - N = 12
93	Correct	9 ms	6648 KB	Output is correct : V - N = 12
94	Correct	9 ms	6640 KB	Output is correct : V - N = 12
95	Correct	9 ms	6640 KB	Output is correct : V - N = 12
96	Correct	13 ms	6896 KB	Output is correct : V - N = 12
97	Correct	10 ms	6896 KB	Output is correct : V - N = 12
98	Correct	9 ms	6640 KB	Output is correct : V - N = 12
99	Correct	9 ms	6896 KB	Output is correct : V - N = 12
100	Correct	9 ms	6640 KB	Output is correct : V - N = 12
101	Correct	9 ms	6776 KB	Output is correct : V - N = 12
102	Correct	12 ms	6896 KB	Output is correct : V - N = 12
103	Correct	9 ms	6640 KB	Output is correct : V - N = 12
104	Correct	9 ms	6896 KB	Output is correct : V - N = 12
105	Correct	9 ms	6640 KB	Output is correct : V - N = 12
106	Correct	9 ms	6640 KB	Output is correct : V - N = 12
107	Correct	9 ms	6640 KB	Output is correct : V - N = 12
108	Correct	9 ms	6896 KB	Output is correct : V - N = 12
109	Correct	9 ms	6640 KB	Output is correct : V - N = 12
110	Correct	9 ms	6640 KB	Output is correct : V - N = 12
111	Correct	9 ms	6952 KB	Output is correct : V - N = 12
112	Correct	9 ms	6640 KB	Output is correct : V - N = 12
113	Correct	9 ms	6632 KB	Output is correct : V - N = 12
114	Correct	9 ms	6896 KB	Output is correct : V - N = 12
115	Correct	9 ms	6896 KB	Output is correct : V - N = 12
116	Correct	9 ms	6896 KB	Output is correct : V - N = 12
117	Correct	9 ms	6640 KB	Output is correct : V - N = 12
118	Correct	9 ms	6640 KB	Output is correct : V - N = 12
119	Correct	9 ms	6952 KB	Output is correct : V - N = 12
120	Correct	9 ms	6640 KB	Output is correct : V - N = 12
121	Correct	9 ms	6640 KB	Output is correct : V - N = 12
122	Correct	9 ms	6640 KB	Output is correct : V - N = 12
123	Correct	9 ms	6896 KB	Output is correct : V - N = 12
124	Correct	9 ms	6640 KB	Output is correct : V - N = 12
125	Correct	9 ms	6640 KB	Output is correct : V - N = 12
126	Correct	9 ms	6896 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	6640 KB	Output is correct : V - N = 12
130	Correct	9 ms	6640 KB	Output is correct : V - N = 12
131	Correct	9 ms	6640 KB	Output is correct : V - N = 12
132	Correct	9 ms	6640 KB	Output is correct : V - N = 12
133	Correct	9 ms	6896 KB	Output is correct : V - N = 12
134	Correct	9 ms	6640 KB	Output is correct : V - N = 12
135	Correct	9 ms	6640 KB	Output is correct : V - N = 12
136	Correct	9 ms	6640 KB	Output is correct : V - N = 12
137	Correct	9 ms	6760 KB	Output is correct : V - N = 12
138	Correct	9 ms	6736 KB	Output is correct : V - N = 12
139	Correct	11 ms	6896 KB	Output is correct : V - N = 12
140	Correct	12 ms	6896 KB	Output is correct : V - N = 12
141	Correct	9 ms	6904 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	6896 KB	Output is correct : V - N = 12
145	Correct	9 ms	6640 KB	Output is correct : V - N = 12
146	Correct	10 ms	6896 KB	Output is correct : V - N = 12
147	Correct	9 ms	6896 KB	Output is correct : V - N = 12
148	Correct	9 ms	6640 KB	Output is correct : V - N = 12
149	Correct	9 ms	6896 KB	Output is correct : V - N = 12
150	Correct	13 ms	6896 KB	Output is correct : V - N = 12
151	Correct	9 ms	6640 KB	Output is correct : V - N = 12
152	Correct	9 ms	6896 KB	Output is correct : V - N = 12
153	Correct	28 ms	6640 KB	Output is correct : V - N = 12
154	Correct	9 ms	6952 KB	Output is correct : V - N = 12
155	Correct	9 ms	6640 KB	Output is correct : V - N = 12
156	Correct	9 ms	6640 KB	Output is correct : V - N = 12
157	Correct	9 ms	6896 KB	Output is correct : V - N = 12
158	Correct	10 ms	6640 KB	Output is correct : V - N = 12
159	Correct	9 ms	6640 KB	Output is correct : V - N = 12
160	Correct	9 ms	6896 KB	Output is correct : V - N = 12
161	Correct	9 ms	6896 KB	Output is correct : V - N = 12
162	Correct	9 ms	6640 KB	Output is correct : V - N = 12
163	Correct	9 ms	6896 KB	Output is correct : V - N = 12
164	Correct	9 ms	6640 KB	Output is correct : V - N = 12
165	Correct	9 ms	6896 KB	Output is correct : V - N = 12
166	Correct	9 ms	6736 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	6640 KB	Output is correct : V - N = 12
170	Correct	9 ms	6896 KB	Output is correct : V - N = 12
171	Correct	8 ms	6984 KB	Output is correct : V - N = 12
172	Correct	9 ms	6792 KB	Output is correct : V - N = 12
173	Correct	8 ms	6896 KB	Output is correct : V - N = 12
174	Correct	9 ms	6640 KB	Output is correct : V - N = 12
175	Correct	8 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	6640 KB	Output is correct : V - N = 12
178	Correct	9 ms	6896 KB	Output is correct : V - N = 12

답안 #172695

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