답안 #47807 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47807	2018-05-07T12:45:46 Z	qoo2p5	항공 노선도 (JOI18_airline)	C++17	100 / 100	827 ms	30720 KB

Alice
Bob

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

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back

static bool test(int mask, int bit) {
    return mask & (1 << bit);
}

void Alice(int n, int m, int a[], int b[]) {
    vector<pair<int, int>> e;
    
    rep(i, 0, m) {
        e.pb({a[i], b[i]});
    }
    rep(i, 0, n + 12) {
        if (i != n && i != n + 1) {
            e.pb({n, i});
        }
    }
    rep(i, n + 2, n + 12) {
        e.pb({n + 1, i});
    }
    rep(i, n + 2, n + 11) {
        e.pb({i, i + 1});
    }
    rep(i, 0, n) {
        rep(bit, 0, 10) {
            if (test(i, bit)) {
                e.pb({i, n + 2 + bit});
            }
        }
    }
    
    InitG(n + 12, sz(e));
    rep(i, 0, sz(e)) {
        auto it = e[i];
        MakeG(i, it.first, it.second);
    }
}

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

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back

static bool test(int mask, int bit) {
    return mask & (1 << bit);
}

void Bob(int V, int U, int C[], int D[]) {
    int n = V - 12;
    vector<vector<int>> g(V);
    rep(i, 0, U) {
        g[C[i]].pb(D[i]);
        g[D[i]].pb(C[i]);
    }
    rep(i, 0, V) {
        sort(all(g[i]));
    }
    int C1 = -1;
    rep(i, 0, V) {
        if (sz(g[i]) == n + 10) {
            assert(C1 == -1);
            C1 = i;
        }
    }
    assert(C1 != -1);
    
    int C2 = -1;
    rep(i, 0, V) {
        if (i == C1) {
            continue;
        }
        if (!binary_search(all(g[C1]), i)) {
            assert(C2 == -1);
            C2 = i;
        }
    }
    assert(C2 != -1);
    
    vector<int> cool;
    for (int i : g[C2]) {
        cool.pb(i);
    }
    sort(all(cool));
    assert(sz(cool) == 10);
    
    int v = cool.back();
    int prv = -1;
    while (1) {
        int to = -1;
        for (int u : g[v]) {
            if (!binary_search(all(cool), u) || u == prv) {
                continue;
            }
            to = u;
        }
        if (to == -1) {
            break;
        }
        prv = v;
        v = to;
    }
    
    vector<int> seq;
    seq.pb(v);
    prv = -1;
    while (1) {
        int to = -1;
        for (int u : g[v]) {
            if (!binary_search(all(cool), u) || u == prv) {
                continue;
            }
            to = u;
        }
        if (to == -1) {
            break;
        }
        prv = v;
        v = to;
        seq.pb(v);
    }
    
    assert(sz(seq) == 10);
    vector<bool> our(V, 1);
    our[C1] = 0;
    our[C2] = 0;
    for (int v : seq) {
        our[v] = 0;
    }
    
    int cnt_our = 0;
    for (bool i : our) {
        cnt_our += i;
    }
    assert(cnt_our == n);
    
    rep(iter, 0, 2) {
        vector<int> wow(V, -1);
        rep(i, 0, 10) {
            wow[seq[i]] = i;
        }
        
        bool ok = 1;
        
        rep(v, 0, V) {
            if (!our[v]) {
                continue;
            }
            int id = 0;
            for (int u : g[v]) {
                if (wow[u] != -1) {
                    id |= (1 << wow[u]);
                }
            }
            if (id >= n) {
                ok = 0;
                break;
            }
        }
        
        if (iter == 1) {
            assert(ok);
        }
        
        if (ok) {
            break;
        }
        
        reverse(all(seq));
    }
    
    
    vector<int> wow(V, -1);
    rep(i, 0, 10) {
        wow[seq[i]] = i;
    }
    
    vector<int> id(V, -1);    
    rep(v, 0, V) {
        if (!our[v]) {
            continue;
        }
        id[v] = 0;
        for (int u : g[v]) {
            if (wow[u] != -1) {
                id[v] |= (1 << wow[u]);
            }
        }
    }
    
    vector<pair<int, int>> adj;
    rep(i, 0, V) {
        for (int j : g[i]) {
            int u = id[i];
            int v = id[j];
            if (u == -1 || v == -1) {
                continue;
            }
            if (u < v) {
                adj.pb({u, v});
            }
        }
    }
    
    InitMap(n, sz(adj));
    for (auto &it : adj) {
        MakeMap(it.first, it.second);
    }
}

Compilation message

Bob.cpp:20:13: warning: 'bool test(int, int)' defined but not used [-Wunused-function]
 static bool test(int mask, int bit) {
             ^~~~

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6640 KB	Output is correct
2	Correct	6 ms	6896 KB	Output is correct
3	Correct	7 ms	6896 KB	Output is correct
4	Correct	6 ms	6640 KB	Output is correct
5	Correct	7 ms	6824 KB	Output is correct
6	Correct	7 ms	6896 KB	Output is correct
7	Correct	6 ms	6896 KB	Output is correct
8	Correct	6 ms	6640 KB	Output is correct
9	Correct	7 ms	6640 KB	Output is correct
10	Correct	7 ms	6640 KB	Output is correct
11	Correct	7 ms	6736 KB	Output is correct
12	Correct	11 ms	6896 KB	Output is correct
13	Correct	7 ms	6640 KB	Output is correct
14	Correct	7 ms	6672 KB	Output is correct
15	Correct	6 ms	6640 KB	Output is correct
16	Correct	6 ms	6648 KB	Output is correct
17	Correct	8 ms	6640 KB	Output is correct
18	Correct	7 ms	6640 KB	Output is correct
19	Correct	7 ms	6896 KB	Output is correct
20	Correct	15 ms	6728 KB	Output is correct
21	Correct	6 ms	6640 KB	Output is correct
22	Correct	6 ms	6648 KB	Output is correct
23	Correct	7 ms	6896 KB	Output is correct
24	Correct	6 ms	6728 KB	Output is correct
25	Correct	7 ms	6896 KB	Output is correct
26	Correct	6 ms	6640 KB	Output is correct
27	Correct	6 ms	6640 KB	Output is correct
28	Correct	6 ms	6896 KB	Output is correct
29	Correct	7 ms	6896 KB	Output is correct
30	Correct	6 ms	6640 KB	Output is correct
31	Correct	6 ms	6640 KB	Output is correct
32	Correct	7 ms	6736 KB	Output is correct
33	Correct	7 ms	6640 KB	Output is correct
34	Correct	7 ms	6896 KB	Output is correct
35	Correct	8 ms	6896 KB	Output is correct
36	Correct	7 ms	6896 KB	Output is correct
37	Correct	7 ms	6896 KB	Output is correct
38	Correct	7 ms	6640 KB	Output is correct
39	Correct	8 ms	6904 KB	Output is correct
40	Correct	8 ms	6640 KB	Output is correct
41	Correct	7 ms	6896 KB	Output is correct
42	Correct	8 ms	6896 KB	Output is correct
43	Correct	8 ms	6640 KB	Output is correct
44	Correct	8 ms	6736 KB	Output is correct
45	Correct	8 ms	6640 KB	Output is correct
46	Correct	6 ms	6736 KB	Output is correct
47	Correct	6 ms	6640 KB	Output is correct
48	Correct	7 ms	6640 KB	Output is correct
49	Correct	8 ms	6640 KB	Output is correct
50	Correct	6 ms	6640 KB	Output is correct
51	Correct	6 ms	6896 KB	Output is correct
52	Correct	7 ms	6640 KB	Output is correct
53	Correct	8 ms	6640 KB	Output is correct
54	Correct	8 ms	6600 KB	Output is correct
55	Correct	7 ms	6896 KB	Output is correct
56	Correct	6 ms	6712 KB	Output is correct
57	Correct	7 ms	6648 KB	Output is correct
58	Correct	7 ms	6640 KB	Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	724 ms	30544 KB	Output is correct : V - N = 12
2	Correct	503 ms	25800 KB	Output is correct : V - N = 12
3	Correct	226 ms	13992 KB	Output is correct : V - N = 12
4	Correct	14 ms	7248 KB	Output is correct : V - N = 12
5	Correct	148 ms	11216 KB	Output is correct : V - N = 12
6	Correct	484 ms	23720 KB	Output is correct : V - N = 12
7	Correct	739 ms	30072 KB	Output is correct : V - N = 12
8	Correct	604 ms	27712 KB	Output is correct : V - N = 12
9	Correct	332 ms	17208 KB	Output is correct : V - N = 12
10	Correct	44 ms	8168 KB	Output is correct : V - N = 12
11	Correct	70 ms	9024 KB	Output is correct : V - N = 12
12	Correct	372 ms	18872 KB	Output is correct : V - N = 12
13	Correct	637 ms	28736 KB	Output is correct : V - N = 12
14	Correct	704 ms	29520 KB	Output is correct : V - N = 12
15	Correct	420 ms	22652 KB	Output is correct : V - N = 12
16	Correct	107 ms	10048 KB	Output is correct : V - N = 12
17	Correct	20 ms	7752 KB	Output is correct : V - N = 12
18	Correct	266 ms	15520 KB	Output is correct : V - N = 12
19	Correct	623 ms	26608 KB	Output is correct : V - N = 12
20	Correct	751 ms	30592 KB	Output is correct : V - N = 12
21	Correct	205 ms	13248 KB	Output is correct : V - N = 12
22	Correct	158 ms	11744 KB	Output is correct : V - N = 12
23	Correct	59 ms	8928 KB	Output is correct : V - N = 12
24	Correct	10 ms	6896 KB	Output is correct : V - N = 12
25	Correct	28 ms	8152 KB	Output is correct : V - N = 12
26	Correct	150 ms	10936 KB	Output is correct : V - N = 12
27	Correct	198 ms	13032 KB	Output is correct : V - N = 12
28	Correct	160 ms	12408 KB	Output is correct : V - N = 12
29	Correct	87 ms	9824 KB	Output is correct : V - N = 12
30	Correct	14 ms	7408 KB	Output is correct : V - N = 12
31	Correct	12 ms	7008 KB	Output is correct : V - N = 12
32	Correct	12 ms	7152 KB	Output is correct : V - N = 12
33	Correct	12 ms	6896 KB	Output is correct : V - N = 12
34	Correct	12 ms	7152 KB	Output is correct : V - N = 12
35	Correct	12 ms	6992 KB	Output is correct : V - N = 12
36	Correct	827 ms	30600 KB	Output is correct : V - N = 12
37	Correct	750 ms	30512 KB	Output is correct : V - N = 12
38	Correct	746 ms	30664 KB	Output is correct : V - N = 12
39	Correct	773 ms	30472 KB	Output is correct : V - N = 12
40	Correct	786 ms	30720 KB	Output is correct : V - N = 12
41	Correct	132 ms	11128 KB	Output is correct : V - N = 12
42	Correct	121 ms	10072 KB	Output is correct : V - N = 12
43	Correct	112 ms	10488 KB	Output is correct : V - N = 12
44	Correct	14 ms	7152 KB	Output is correct : V - N = 12
45	Correct	76 ms	9184 KB	Output is correct : V - N = 12
46	Correct	235 ms	14784 KB	Output is correct : V - N = 12
47	Correct	126 ms	10904 KB	Output is correct : V - N = 12
48	Correct	318 ms	17504 KB	Output is correct : V - N = 12
49	Correct	65 ms	8768 KB	Output is correct : V - N = 12
50	Correct	20 ms	7760 KB	Output is correct : V - N = 12
51	Correct	595 ms	25584 KB	Output is correct : V - N = 12
52	Correct	14 ms	7248 KB	Output is correct : V - N = 12
53	Correct	497 ms	23508 KB	Output is correct : V - N = 12
54	Correct	643 ms	27224 KB	Output is correct : V - N = 12
55	Correct	43 ms	8264 KB	Output is correct : V - N = 12
56	Correct	336 ms	18520 KB	Output is correct : V - N = 12
57	Correct	733 ms	28936 KB	Output is correct : V - N = 12
58	Correct	125 ms	9952 KB	Output is correct : V - N = 12
59	Correct	287 ms	15368 KB	Output is correct : V - N = 12
60	Correct	719 ms	29688 KB	Output is correct : V - N = 12
61	Correct	8 ms	6640 KB	Output is correct : V - N = 12
62	Correct	8 ms	6640 KB	Output is correct : V - N = 12
63	Correct	8 ms	6640 KB	Output is correct : V - N = 12
64	Correct	6 ms	6896 KB	Output is correct : V - N = 12
65	Correct	8 ms	6640 KB	Output is correct : V - N = 12
66	Correct	8 ms	6896 KB	Output is correct : V - N = 12
67	Correct	8 ms	6896 KB	Output is correct : V - N = 12
68	Correct	8 ms	6856 KB	Output is correct : V - N = 12
69	Correct	8 ms	6896 KB	Output is correct : V - N = 12
70	Correct	8 ms	6896 KB	Output is correct : V - N = 12
71	Correct	8 ms	6896 KB	Output is correct : V - N = 12
72	Correct	8 ms	6896 KB	Output is correct : V - N = 12
73	Correct	8 ms	6640 KB	Output is correct : V - N = 12
74	Correct	8 ms	6640 KB	Output is correct : V - N = 12
75	Correct	8 ms	6736 KB	Output is correct : V - N = 12
76	Correct	8 ms	6640 KB	Output is correct : V - N = 12
77	Correct	8 ms	6640 KB	Output is correct : V - N = 12
78	Correct	8 ms	6640 KB	Output is correct : V - N = 12
79	Correct	8 ms	6728 KB	Output is correct : V - N = 12
80	Correct	8 ms	6640 KB	Output is correct : V - N = 12
81	Correct	8 ms	6896 KB	Output is correct : V - N = 12
82	Correct	8 ms	6640 KB	Output is correct : V - N = 12
83	Correct	8 ms	6696 KB	Output is correct : V - N = 12
84	Correct	7 ms	6680 KB	Output is correct : V - N = 12
85	Correct	8 ms	6640 KB	Output is correct : V - N = 12
86	Correct	8 ms	6640 KB	Output is correct : V - N = 12
87	Correct	8 ms	6640 KB	Output is correct : V - N = 12
88	Correct	7 ms	6640 KB	Output is correct : V - N = 12
89	Correct	7 ms	6680 KB	Output is correct : V - N = 12
90	Correct	7 ms	6640 KB	Output is correct : V - N = 12
91	Correct	8 ms	6640 KB	Output is correct : V - N = 12
92	Correct	8 ms	6640 KB	Output is correct : V - N = 12
93	Correct	7 ms	6640 KB	Output is correct : V - N = 12
94	Correct	7 ms	6648 KB	Output is correct : V - N = 12
95	Correct	8 ms	6640 KB	Output is correct : V - N = 12
96	Correct	8 ms	6896 KB	Output is correct : V - N = 12
97	Correct	8 ms	7152 KB	Output is correct : V - N = 12
98	Correct	8 ms	6640 KB	Output is correct : V - N = 12
99	Correct	8 ms	6736 KB	Output is correct : V - N = 12
100	Correct	8 ms	6640 KB	Output is correct : V - N = 12
101	Correct	7 ms	6648 KB	Output is correct : V - N = 12
102	Correct	8 ms	6640 KB	Output is correct : V - N = 12
103	Correct	6 ms	6736 KB	Output is correct : V - N = 12
104	Correct	6 ms	6568 KB	Output is correct : V - N = 12
105	Correct	8 ms	6784 KB	Output is correct : V - N = 12
106	Correct	6 ms	6640 KB	Output is correct : V - N = 12
107	Correct	7 ms	6640 KB	Output is correct : V - N = 12
108	Correct	8 ms	6640 KB	Output is correct : V - N = 12
109	Correct	16 ms	6736 KB	Output is correct : V - N = 12
110	Correct	6 ms	6640 KB	Output is correct : V - N = 12
111	Correct	8 ms	6896 KB	Output is correct : V - N = 12
112	Correct	6 ms	6640 KB	Output is correct : V - N = 12
113	Correct	7 ms	6736 KB	Output is correct : V - N = 12
114	Correct	7 ms	6640 KB	Output is correct : V - N = 12
115	Correct	7 ms	6824 KB	Output is correct : V - N = 12
116	Correct	8 ms	6640 KB	Output is correct : V - N = 12
117	Correct	8 ms	6640 KB	Output is correct : V - N = 12
118	Correct	7 ms	6616 KB	Output is correct : V - N = 12
119	Correct	7 ms	6720 KB	Output is correct : V - N = 12
120	Correct	8 ms	6888 KB	Output is correct : V - N = 12
121	Correct	7 ms	6640 KB	Output is correct : V - N = 12
122	Correct	8 ms	6640 KB	Output is correct : V - N = 12
123	Correct	8 ms	6896 KB	Output is correct : V - N = 12
124	Correct	7 ms	6896 KB	Output is correct : V - N = 12
125	Correct	8 ms	6736 KB	Output is correct : V - N = 12
126	Correct	8 ms	6640 KB	Output is correct : V - N = 12
127	Correct	7 ms	6640 KB	Output is correct : V - N = 12
128	Correct	8 ms	6640 KB	Output is correct : V - N = 12
129	Correct	8 ms	6896 KB	Output is correct : V - N = 12
130	Correct	8 ms	6640 KB	Output is correct : V - N = 12
131	Correct	8 ms	6640 KB	Output is correct : V - N = 12
132	Correct	8 ms	6896 KB	Output is correct : V - N = 12
133	Correct	8 ms	6896 KB	Output is correct : V - N = 12
134	Correct	8 ms	6896 KB	Output is correct : V - N = 12
135	Correct	8 ms	6896 KB	Output is correct : V - N = 12
136	Correct	9 ms	6640 KB	Output is correct : V - N = 12
137	Correct	8 ms	6640 KB	Output is correct : V - N = 12
138	Correct	8 ms	6640 KB	Output is correct : V - N = 12
139	Correct	8 ms	6896 KB	Output is correct : V - N = 12
140	Correct	8 ms	6896 KB	Output is correct : V - N = 12
141	Correct	8 ms	6640 KB	Output is correct : V - N = 12
142	Correct	7 ms	6640 KB	Output is correct : V - N = 12
143	Correct	8 ms	6640 KB	Output is correct : V - N = 12
144	Correct	7 ms	6640 KB	Output is correct : V - N = 12
145	Correct	8 ms	6736 KB	Output is correct : V - N = 12
146	Correct	7 ms	6640 KB	Output is correct : V - N = 12
147	Correct	6 ms	6640 KB	Output is correct : V - N = 12
148	Correct	7 ms	6896 KB	Output is correct : V - N = 12
149	Correct	7 ms	6736 KB	Output is correct : V - N = 12
150	Correct	7 ms	6640 KB	Output is correct : V - N = 12
151	Correct	6 ms	6640 KB	Output is correct : V - N = 12
152	Correct	6 ms	6896 KB	Output is correct : V - N = 12
153	Correct	7 ms	6640 KB	Output is correct : V - N = 12
154	Correct	9 ms	6896 KB	Output is correct : V - N = 12
155	Correct	7 ms	6640 KB	Output is correct : V - N = 12
156	Correct	6 ms	6664 KB	Output is correct : V - N = 12
157	Correct	8 ms	6640 KB	Output is correct : V - N = 12
158	Correct	7 ms	6640 KB	Output is correct : V - N = 12
159	Correct	7 ms	6896 KB	Output is correct : V - N = 12
160	Correct	8 ms	6640 KB	Output is correct : V - N = 12
161	Correct	8 ms	6640 KB	Output is correct : V - N = 12
162	Correct	8 ms	6640 KB	Output is correct : V - N = 12
163	Correct	8 ms	6896 KB	Output is correct : V - N = 12
164	Correct	8 ms	6640 KB	Output is correct : V - N = 12
165	Correct	8 ms	6736 KB	Output is correct : V - N = 12
166	Correct	8 ms	6640 KB	Output is correct : V - N = 12
167	Correct	8 ms	6640 KB	Output is correct : V - N = 12
168	Correct	8 ms	6640 KB	Output is correct : V - N = 12
169	Correct	8 ms	6640 KB	Output is correct : V - N = 12
170	Correct	7 ms	6640 KB	Output is correct : V - N = 12
171	Correct	8 ms	6640 KB	Output is correct : V - N = 12
172	Correct	7 ms	6640 KB	Output is correct : V - N = 12
173	Correct	8 ms	6736 KB	Output is correct : V - N = 12
174	Correct	8 ms	6736 KB	Output is correct : V - N = 12
175	Correct	8 ms	6736 KB	Output is correct : V - N = 12
176	Correct	8 ms	6896 KB	Output is correct : V - N = 12
177	Correct	8 ms	6736 KB	Output is correct : V - N = 12
178	Correct	8 ms	6640 KB	Output is correct : V - N = 12

답안 #47807

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