oj.uz

답안 #134400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134400 2019-07-22T16:08:33 Z duality 항공 노선도 (JOI18_airline) C++11
100 / 100
 998 ms 31232 KB 
#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "Alicelib.h"

static vpii edges;
void Alice(int N,int M,int *A,int *B) {
    int i,j;
    for (i = 0; i < M; i++) edges.pb(mp(A[i],B[i]));
    for (i = 0; i < N+11; i++) {
        if (i != N) edges.pb(mp(N,i));
    }
    for (i = 0; i < 10; i++) edges.pb(mp(N+i+1,N+11));
    for (i = 1; i < 10; i++) edges.pb(mp(N+i,N+i+1));
    edges.pb(mp(N+2,N+4));
    for (i = 0; i < N; i++) {
        for (j = 0; j < 10; j++) {
            if (i & (1 << j)) edges.pb(mp(i,N+j+1));
        }
    }
    InitG(N+12,edges.size());
    for (i = 0; i < edges.size(); i++) MakeG(i,edges[i].first,edges[i].second);
}

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "Boblib.h"

static vpii edges;
bitset<1012> adjMat[1012];
vi adjList[1012];
int num[1012];
void Bob(int V,int U,int *C,int *D) {
    int i,j;
    int x,y;
    for (i = 0; i < U; i++) adjMat[C[i]][D[i]] = adjMat[D[i]][C[i]] = 1;
    for (i = 0; i < V; i++) {
        if (adjMat[i].count() == V-2) break;
    }
    x = i;
    for (i = 0; i < V; i++) {
        if ((i != x) && !adjMat[x][i]) break;
    }
    y = i;
    vi v,v2;
    for (i = 0; i < V; i++) {
        if (adjMat[y][i]) v.pb(i);
    }
    for (i = 0; i < v.size(); i++) {
        for (j = 0; j < v.size(); j++) {
            if (adjMat[v[i]][v[j]]) adjList[v[i]].pb(v[j]);
        }
    }
    for (i = 0; i < v.size(); i++) {
        if ((adjList[v[i]].size() == 1) && (adjList[adjList[v[i]][0]].size() == 3)) break;
    }
    int u = v[i];
    fill(num,num+V,-1);
    num[u] = 0;
    for (i = 1; i < 10; i++) {
        if (i == 1) u = adjList[u][0];
        else if (i == 2) {
            if (adjList[adjList[u][0]].size() == 2) u = adjList[u][0];
            else if (adjList[adjList[u][1]].size() == 2) u = adjList[u][1];
            else u = adjList[u][2];
        }
        else {
            for (j = 0; j < adjList[u].size(); j++) {
                if (num[adjList[u][j]] == -1) {
                    u = adjList[u][j];
                    break;
                }
            }
        }
        num[u] = i;
    }
    for (i = 0; i < V; i++) {
        if (adjMat[x][i] && !adjMat[y][i]) v2.pb(i);
    }
    for (i = 0; i < v2.size(); i++) {
        int n = 0;
        for (j = 0; j < v.size(); j++) {
            if (adjMat[v2[i]][v[j]]) n |= (1 << num[v[j]]);
        }
        num[v2[i]] = n;
    }
    for (i = 0; i < v2.size(); i++) {
        for (j = i+1; j < v2.size(); j++) {
            if (adjMat[v2[i]][v2[j]]) edges.pb(mp(num[v2[i]],num[v2[j]]));
        }
    }
    InitMap(V-12,edges.size());
    for (i = 0; i < edges.size(); i++) MakeMap(edges[i].first,edges[i].second);
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < edges.size(); i++) MakeG(i,edges[i].first,edges[i].second);
                 ~~^~~~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:68:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (adjMat[i].count() == V-2) break;
             ~~~~~~~~~~~~~~~~~~^~~~~~
Bob.cpp:79:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++) {
                 ~~^~~~~~~~~~
Bob.cpp:80:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < v.size(); j++) {
                     ~~^~~~~~~~~~
Bob.cpp:84:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++) {
                 ~~^~~~~~~~~~
Bob.cpp:98:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < adjList[u].size(); j++) {
                         ~~^~~~~~~~~~~~~~~~~~~
Bob.cpp:110:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v2.size(); i++) {
                 ~~^~~~~~~~~~~
Bob.cpp:112:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < v.size(); j++) {
                     ~~^~~~~~~~~~
Bob.cpp:117:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v2.size(); i++) {
                 ~~^~~~~~~~~~~
Bob.cpp:118:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = i+1; j < v2.size(); j++) {
                       ~~^~~~~~~~~~~
Bob.cpp:123:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < edges.size(); i++) MakeMap(edges[i].first,edges[i].second);
                 ~~^~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6640 KB Output is correct
2 Correct 9 ms 6640 KB Output is correct
3 Correct 8 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 9 ms 6896 KB Output is correct
8 Correct 9 ms 6640 KB Output is correct
9 Correct 9 ms 6896 KB Output is correct
10 Correct 10 ms 6640 KB Output is correct
11 Correct 8 ms 6896 KB Output is correct
12 Correct 8 ms 6640 KB Output is correct
13 Correct 9 ms 6896 KB Output is correct
14 Correct 9 ms 6896 KB Output is correct
15 Correct 9 ms 6896 KB Output is correct
16 Correct 8 ms 6640 KB Output is correct
17 Correct 8 ms 6640 KB Output is correct
18 Correct 9 ms 6896 KB Output is correct
19 Correct 9 ms 6640 KB Output is correct
20 Correct 9 ms 6640 KB Output is correct
21 Correct 9 ms 6736 KB Output is correct
22 Correct 9 ms 6896 KB Output is correct
23 Correct 9 ms 6608 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 8 ms 6640 KB Output is correct
26 Correct 9 ms 6896 KB Output is correct
27 Correct 9 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6904 KB Output is correct
30 Correct 9 ms 6896 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 6904 KB Output is correct
34 Correct 9 ms 6640 KB Output is correct
35 Correct 8 ms 6640 KB Output is correct
36 Correct 9 ms 6640 KB Output is correct
37 Correct 9 ms 6640 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 9 ms 6640 KB Output is correct
42 Correct 9 ms 6640 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 6896 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 9 ms 6640 KB Output is correct
48 Correct 9 ms 6896 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 6640 KB Output is correct
53 Correct 9 ms 6896 KB Output is correct
54 Correct 9 ms 6896 KB Output is correct
55 Correct 9 ms 6640 KB Output is correct
56 Correct 9 ms 6648 KB Output is correct
57 Correct 9 ms 6640 KB Output is correct
58 Correct 8 ms 6896 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6640 KB Output is correct
2 Correct 9 ms 6640 KB Output is correct
3 Correct 8 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 9 ms 6896 KB Output is correct
8 Correct 9 ms 6640 KB Output is correct
9 Correct 9 ms 6896 KB Output is correct
10 Correct 10 ms 6640 KB Output is correct
11 Correct 8 ms 6896 KB Output is correct
12 Correct 8 ms 6640 KB Output is correct
13 Correct 9 ms 6896 KB Output is correct
14 Correct 9 ms 6896 KB Output is correct
15 Correct 9 ms 6896 KB Output is correct
16 Correct 8 ms 6640 KB Output is correct
17 Correct 8 ms 6640 KB Output is correct
18 Correct 9 ms 6896 KB Output is correct
19 Correct 9 ms 6640 KB Output is correct
20 Correct 9 ms 6640 KB Output is correct
21 Correct 9 ms 6736 KB Output is correct
22 Correct 9 ms 6896 KB Output is correct
23 Correct 9 ms 6608 KB Output is correct
24 Correct 9 ms 6640 KB Output is correct
25 Correct 8 ms 6640 KB Output is correct
26 Correct 9 ms 6896 KB Output is correct
27 Correct 9 ms 6640 KB Output is correct
28 Correct 9 ms 6640 KB Output is correct
29 Correct 9 ms 6904 KB Output is correct
30 Correct 9 ms 6896 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 6904 KB Output is correct
34 Correct 9 ms 6640 KB Output is correct
35 Correct 8 ms 6640 KB Output is correct
36 Correct 9 ms 6640 KB Output is correct
37 Correct 9 ms 6640 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 9 ms 6640 KB Output is correct
42 Correct 9 ms 6640 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 6896 KB Output is correct
46 Correct 8 ms 6640 KB Output is correct
47 Correct 9 ms 6640 KB Output is correct
48 Correct 9 ms 6896 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 6640 KB Output is correct
53 Correct 9 ms 6896 KB Output is correct
54 Correct 9 ms 6896 KB Output is correct
55 Correct 9 ms 6640 KB Output is correct
56 Correct 9 ms 6648 KB Output is correct
57 Correct 9 ms 6640 KB Output is correct
58 Correct 8 ms 6896 KB Output is correct
59 Correct 9 ms 6640 KB Output is correct
60 Correct 8 ms 6640 KB Output is correct
61 Correct 9 ms 6896 KB Output is correct
62 Correct 8 ms 6640 KB Output is correct
63 Correct 8 ms 6640 KB Output is correct
64 Correct 9 ms 6640 KB Output is correct
65 Correct 9 ms 6896 KB Output is correct
66 Correct 9 ms 6896 KB Output is correct
67 Correct 9 ms 6896 KB Output is correct
68 Correct 9 ms 6896 KB Output is correct
69 Correct 9 ms 6640 KB Output is correct
70 Correct 9 ms 6640 KB Output is correct
71 Correct 9 ms 6640 KB Output is correct
72 Correct 9 ms 6640 KB Output is correct
73 Correct 9 ms 6640 KB Output is correct
74 Correct 9 ms 6896 KB Output is correct
75 Correct 8 ms 6640 KB Output is correct
76 Correct 9 ms 6896 KB Output is correct
77 Correct 9 ms 6640 KB Output is correct
78 Correct 9 ms 6640 KB Output is correct
79 Correct 9 ms 6640 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 6640 KB Output is correct
83 Correct 9 ms 6640 KB Output is correct
84 Correct 9 ms 6896 KB Output is correct
85 Correct 9 ms 6640 KB Output is correct
86 Correct 9 ms 6640 KB Output is correct
87 Correct 8 ms 6640 KB Output is correct
88 Correct 9 ms 6640 KB Output is correct
89 Correct 8 ms 6640 KB Output is correct
90 Correct 8 ms 6640 KB Output is correct
91 Correct 8 ms 6640 KB Output is correct
92 Correct 9 ms 6896 KB Output is correct
93 Correct 8 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 6648 KB Output is correct
97 Correct 9 ms 6896 KB Output is correct
98 Correct 9 ms 6904 KB Output is correct
99 Correct 9 ms 6640 KB Output is correct
100 Correct 9 ms 6896 KB Output is correct
101 Correct 9 ms 6896 KB Output is correct
102 Correct 8 ms 6640 KB Output is correct
103 Correct 8 ms 6648 KB Output is correct
104 Correct 8 ms 6640 KB Output is correct
105 Correct 9 ms 6896 KB Output is correct
106 Correct 9 ms 6896 KB Output is correct
107 Correct 9 ms 6640 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 6640 KB Output is correct
111 Correct 9 ms 6640 KB Output is correct
112 Correct 9 ms 6896 KB Output is correct
113 Correct 9 ms 6896 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 6904 KB Output is correct
118 Correct 9 ms 6736 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 948 ms 31232 KB Output is correct : V - N = 12
2 Correct 731 ms 25456 KB Output is correct : V - N = 12
3 Correct 296 ms 14208 KB Output is correct : V - N = 12
4 Correct 16 ms 7656 KB Output is correct : V - N = 12
5 Correct 185 ms 11472 KB Output is correct : V - N = 12
6 Correct 628 ms 22712 KB Output is correct : V - N = 12
7 Correct 964 ms 30496 KB Output is correct : V - N = 12
8 Correct 861 ms 28264 KB Output is correct : V - N = 12
9 Correct 429 ms 17440 KB Output is correct : V - N = 12
10 Correct 57 ms 8424 KB Output is correct : V - N = 12
11 Correct 94 ms 9184 KB Output is correct : V - N = 12
12 Correct 496 ms 19400 KB Output is correct : V - N = 12
13 Correct 942 ms 29168 KB Output is correct : V - N = 12
14 Correct 912 ms 29832 KB Output is correct : V - N = 12
15 Correct 604 ms 20744 KB Output is correct : V - N = 12
16 Correct 151 ms 10232 KB Output is correct : V - N = 12
17 Correct 32 ms 7880 KB Output is correct : V - N = 12
18 Correct 362 ms 16096 KB Output is correct : V - N = 12
19 Correct 808 ms 27200 KB Output is correct : V - N = 12
20 Correct 939 ms 30952 KB Output is correct : V - N = 12
21 Correct 264 ms 13496 KB Output is correct : V - N = 12
22 Correct 204 ms 11976 KB Output is correct : V - N = 12
23 Correct 83 ms 9024 KB Output is correct : V - N = 12
24 Correct 12 ms 7152 KB Output is correct : V - N = 12
25 Correct 56 ms 8352 KB Output is correct : V - N = 12
26 Correct 168 ms 11184 KB Output is correct : V - N = 12
27 Correct 280 ms 13320 KB Output is correct : V - N = 12
28 Correct 224 ms 12872 KB Output is correct : V - N = 12
29 Correct 119 ms 9936 KB Output is correct : V - N = 12
30 Correct 14 ms 7408 KB Output is correct : V - N = 12
31 Correct 15 ms 7152 KB Output is correct : V - N = 12
32 Correct 15 ms 7160 KB Output is correct : V - N = 12
33 Correct 15 ms 7152 KB Output is correct : V - N = 12
34 Correct 15 ms 7152 KB Output is correct : V - N = 12
35 Correct 15 ms 7152 KB Output is correct : V - N = 12
36 Correct 994 ms 30904 KB Output is correct : V - N = 12
37 Correct 998 ms 30984 KB Output is correct : V - N = 12
38 Correct 967 ms 31184 KB Output is correct : V - N = 12
39 Correct 984 ms 30888 KB Output is correct : V - N = 12
40 Correct 982 ms 30856 KB Output is correct : V - N = 12
41 Correct 183 ms 11288 KB Output is correct : V - N = 12
42 Correct 133 ms 10424 KB Output is correct : V - N = 12
43 Correct 155 ms 10872 KB Output is correct : V - N = 12
44 Correct 15 ms 7152 KB Output is correct : V - N = 12
45 Correct 93 ms 9784 KB Output is correct : V - N = 12
46 Correct 326 ms 14928 KB Output is correct : V - N = 12
47 Correct 196 ms 11256 KB Output is correct : V - N = 12
48 Correct 453 ms 17672 KB Output is correct : V - N = 12
49 Correct 87 ms 9080 KB Output is correct : V - N = 12
50 Correct 33 ms 7904 KB Output is correct : V - N = 12
51 Correct 770 ms 25792 KB Output is correct : V - N = 12
52 Correct 17 ms 7408 KB Output is correct : V - N = 12
53 Correct 611 ms 22472 KB Output is correct : V - N = 12
54 Correct 853 ms 27880 KB Output is correct : V - N = 12
55 Correct 59 ms 8400 KB Output is correct : V - N = 12
56 Correct 508 ms 19040 KB Output is correct : V - N = 12
57 Correct 919 ms 29544 KB Output is correct : V - N = 12
58 Correct 131 ms 10176 KB Output is correct : V - N = 12
59 Correct 347 ms 15832 KB Output is correct : V - N = 12
60 Correct 928 ms 30080 KB Output is correct : V - N = 12
61 Correct 9 ms 6896 KB Output is correct : V - N = 12
62 Correct 9 ms 6896 KB Output is correct : V - N = 12
63 Correct 9 ms 6896 KB Output is correct : V - N = 12
64 Correct 8 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 6648 KB Output is correct : V - N = 12
67 Correct 9 ms 6640 KB Output is correct : V - N = 12
68 Correct 9 ms 6640 KB Output is correct : V - N = 12
69 Correct 8 ms 6640 KB Output is correct : V - N = 12
70 Correct 9 ms 6896 KB Output is correct : V - N = 12
71 Correct 9 ms 6896 KB Output is correct : V - N = 12
72 Correct 9 ms 6736 KB Output is correct : V - N = 12
73 Correct 9 ms 6640 KB Output is correct : V - N = 12
74 Correct 9 ms 6896 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 6896 KB Output is correct : V - N = 12
78 Correct 9 ms 6640 KB Output is correct : V - N = 12
79 Correct 11 ms 6896 KB Output is correct : V - N = 12
80 Correct 9 ms 6640 KB Output is correct : V - N = 12
81 Correct 10 ms 6640 KB Output is correct : V - N = 12
82 Correct 9 ms 6640 KB Output is correct : V - N = 12
83 Correct 9 ms 6896 KB Output is correct : V - N = 12
84 Correct 9 ms 6896 KB Output is correct : V - N = 12
85 Correct 8 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 6896 KB Output is correct : V - N = 12
88 Correct 9 ms 6640 KB Output is correct : V - N = 12
89 Correct 10 ms 6736 KB Output is correct : V - N = 12
90 Correct 10 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 6896 KB Output is correct : V - N = 12
93 Correct 8 ms 6640 KB Output is correct : V - N = 12
94 Correct 9 ms 6896 KB Output is correct : V - N = 12
95 Correct 9 ms 6640 KB Output is correct : V - N = 12
96 Correct 9 ms 6896 KB Output is correct : V - N = 12
97 Correct 9 ms 6896 KB Output is correct : V - N = 12
98 Correct 9 ms 6896 KB Output is correct : V - N = 12
99 Correct 11 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 6640 KB Output is correct : V - N = 12
102 Correct 9 ms 6640 KB Output is correct : V - N = 12
103 Correct 9 ms 6728 KB Output is correct : V - N = 12
104 Correct 9 ms 6640 KB Output is correct : V - N = 12
105 Correct 9 ms 6952 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 6640 KB Output is correct : V - N = 12
109 Correct 9 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 8 ms 6640 KB Output is correct : V - N = 12
113 Correct 9 ms 6896 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 8 ms 6640 KB Output is correct : V - N = 12
117 Correct 9 ms 6640 KB Output is correct : V - N = 12
118 Correct 9 ms 6896 KB Output is correct : V - N = 12
119 Correct 10 ms 6640 KB Output is correct : V - N = 12
120 Correct 10 ms 6904 KB Output is correct : V - N = 12
121 Correct 9 ms 6896 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 8 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 8 ms 6640 KB Output is correct : V - N = 12
129 Correct 8 ms 6640 KB Output is correct : V - N = 12
130 Correct 9 ms 6896 KB Output is correct : V - N = 12
131 Correct 10 ms 6640 KB Output is correct : V - N = 12
132 Correct 8 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 6896 KB Output is correct : V - N = 12
135 Correct 8 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 6640 KB Output is correct : V - N = 12
138 Correct 8 ms 6896 KB Output is correct : V - N = 12
139 Correct 9 ms 6640 KB Output is correct : V - N = 12
140 Correct 8 ms 6640 KB Output is correct : V - N = 12
141 Correct 9 ms 6896 KB Output is correct : V - N = 12
142 Correct 8 ms 6640 KB Output is correct : V - N = 12
143 Correct 9 ms 6640 KB Output is correct : V - N = 12
144 Correct 8 ms 6640 KB Output is correct : V - N = 12
145 Correct 8 ms 6640 KB Output is correct : V - N = 12
146 Correct 9 ms 6896 KB Output is correct : V - N = 12
147 Correct 9 ms 6896 KB Output is correct : V - N = 12
148 Correct 8 ms 6640 KB Output is correct : V - N = 12
149 Correct 9 ms 6640 KB Output is correct : V - N = 12
150 Correct 8 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 6640 KB Output is correct : V - N = 12
153 Correct 8 ms 6640 KB Output is correct : V - N = 12
154 Correct 9 ms 6896 KB Output is correct : V - N = 12
155 Correct 9 ms 6896 KB Output is correct : V - N = 12
156 Correct 9 ms 6640 KB Output is correct : V - N = 12
157 Correct 9 ms 6640 KB Output is correct : V - N = 12
158 Correct 9 ms 6896 KB Output is correct : V - N = 12
159 Correct 9 ms 6640 KB Output is correct : V - N = 12
160 Correct 9 ms 6640 KB Output is correct : V - N = 12
161 Correct 9 ms 6896 KB Output is correct : V - N = 12
162 Correct 8 ms 6640 KB Output is correct : V - N = 12
163 Correct 8 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 6896 KB Output is correct : V - N = 12
166 Correct 9 ms 6896 KB Output is correct : V - N = 12
167 Correct 9 ms 6640 KB Output is correct : V - N = 12
168 Correct 9 ms 6640 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 9 ms 6640 KB Output is correct : V - N = 12
172 Correct 9 ms 6896 KB Output is correct : V - N = 12
173 Correct 9 ms 6640 KB Output is correct : V - N = 12
174 Correct 9 ms 6640 KB Output is correct : V - N = 12
175 Correct 9 ms 6640 KB Output is correct : V - N = 12
176 Correct 10 ms 6896 KB Output is correct : V - N = 12
177 Correct 9 ms 7152 KB Output is correct : V - N = 12
178 Correct 9 ms 6896 KB Output is correct : V - N = 12