oj.uz

답안 #232582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232582 2020-05-17T13:26:07 Z AlexLuchianov 항공 노선도 (JOI18_airline) C++14
100 / 100
 865 ms 31432 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <vector>
#include <iostream>

using namespace std;

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], B[i]});
  //encryption nodes
  for(int j = 0; j < 9; j++)
    edges.push_back({n + j, n + j + 1});

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

  for(int j = 0; j < 10; j++)
    edges.push_back({n + j, n + 10});
  for(int i = 0; i < n + 10; i++)
    edges.push_back({i, n + 11});


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


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

using namespace std;

int const nmax = 2000;
vector<int> g[1 + nmax];

int mex(vector<int> temp, int avoid){
  temp.push_back(avoid);
  sort(temp.begin(), temp.end());
  temp.erase(unique(temp.begin(), temp.end()), temp.end());
  for(int i = 0; i < temp.size(); i++)
    if(temp[i] != i)
      return i;
  return temp.size();
}

int vanila[1 + nmax], id[1 + nmax];
int cost[1 + nmax];

int grad(int node){
  int result = 0;
  for(int h = 0; h < g[node].size(); h++){
    int to = g[node][h];
    result += (0 < vanila[to]);
  }
  return result;
}

int nxt(int node){
  for(int h = 0; h < g[node].size(); h++){
    int to = g[node][h];
    if(vanila[to] == 1)
      return to;
  }
  return 0;
}

vector<int> extract(int node, int n){
  vector<int> temp;
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h];
    vanila[to] = 1;
    temp.push_back(to);
  }

  int start = 0;

  for(int h = 0; h < temp.size(); h++){
    int to = temp[h];
    if(grad(to) == 3 && n / 2 + 2 + 1 == g[to].size())
      start = to;
  }

  vector<int> sol;
  sol.push_back(start);
  vanila[start] = 2;

  for(int h = 1; h < 10; h++){
    sol.push_back(nxt(sol.back()));
    vanila[sol.back()] = 2;
  }

  for(int h = 0; h < 10; h++)
    cost[sol[h]] = (1 << h);

  return sol;
}

void Bob( int n, int m, int C[], int D[] ){
  vector<pair<int,int>> sol;
  for(int i = 0; i < m; i++){
    int x = C[i];
    int y = D[i];
    g[x].push_back(y);
    g[y].push_back(x);
  }
  int decode1, decode2;
  for(int i = 0; i < n; i++)
    if(g[i].size() == n - 2)
      decode1 = i;

  decode2 = mex(g[decode1], decode1);
  vanila[decode1] = vanila[decode2] = 2;

  vector<int> enc = extract(decode2, n - 12);

  for(int i = 0; i < n; i++)
    if(vanila[i] == 0){
      for(int h = 0; h < g[i].size(); h++)
        id[i] += cost[g[i][h]];
    }


  for(int i = 0; i < m; i++){
    int x = C[i];
    int y = D[i];
    if(vanila[x] == 0 && vanila[y] == 0)
      sol.push_back({id[x], id[y]});
  }

  InitMap(n - 12, sol.size());
  for(int i = 0; i < sol.size(); i++)
    MakeMap(sol[i].first, sol[i].second);
}

Compilation message

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

Bob.cpp: In function 'int mex(std::vector<int>, int)':
Bob.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < temp.size(); i++)
                  ~~^~~~~~~~~~~~~
Bob.cpp: In function 'int grad(int)':
Bob.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int h = 0; h < g[node].size(); h++){
                  ~~^~~~~~~~~~~~~~~~
Bob.cpp: In function 'int nxt(int)':
Bob.cpp:36:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int h = 0; h < g[node].size(); h++){
                  ~~^~~~~~~~~~~~~~~~
Bob.cpp: In function 'std::vector<int> extract(int, int)':
Bob.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int h = 0; h < g[node].size(); h++) {
                  ~~^~~~~~~~~~~~~~~~
Bob.cpp:54:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int h = 0; h < temp.size(); h++){
                  ~~^~~~~~~~~~~~~
Bob.cpp:56:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(grad(to) == 3 && n / 2 + 2 + 1 == g[to].size())
                         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:85:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(g[i].size() == n - 2)
        ~~~~~~~~~~~~^~~~~~~~
Bob.cpp:95:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int h = 0; h < g[i].size(); h++)
                      ~~^~~~~~~~~~~~~
Bob.cpp:108:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < sol.size(); i++)
                  ~~^~~~~~~~~~~~
Bob.cpp:83:7: warning: 'decode1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int decode1, decode2;
       ^~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 802 ms 31432 KB Output is correct : V - N = 12
2 Correct 522 ms 25788 KB Output is correct : V - N = 12
3 Correct 228 ms 14044 KB Output is correct : V - N = 12
4 Correct 20 ms 7536 KB Output is correct : V - N = 12
5 Correct 165 ms 11224 KB Output is correct : V - N = 12
6 Correct 427 ms 23812 KB Output is correct : V - N = 12
7 Correct 685 ms 30408 KB Output is correct : V - N = 12
8 Correct 675 ms 28104 KB Output is correct : V - N = 12
9 Correct 394 ms 17384 KB Output is correct : V - N = 12
10 Correct 48 ms 8424 KB Output is correct : V - N = 12
11 Correct 84 ms 9184 KB Output is correct : V - N = 12
12 Correct 418 ms 18896 KB Output is correct : V - N = 12
13 Correct 631 ms 29104 KB Output is correct : V - N = 12
14 Correct 623 ms 29544 KB Output is correct : V - N = 12
15 Correct 457 ms 22972 KB Output is correct : V - N = 12
16 Correct 119 ms 9960 KB Output is correct : V - N = 12
17 Correct 27 ms 7744 KB Output is correct : V - N = 12
18 Correct 246 ms 15760 KB Output is correct : V - N = 12
19 Correct 637 ms 26968 KB Output is correct : V - N = 12
20 Correct 719 ms 30664 KB Output is correct : V - N = 12
21 Correct 189 ms 13272 KB Output is correct : V - N = 12
22 Correct 148 ms 11792 KB Output is correct : V - N = 12
23 Correct 82 ms 8928 KB Output is correct : V - N = 12
24 Correct 16 ms 6912 KB Output is correct : V - N = 12
25 Correct 45 ms 8168 KB Output is correct : V - N = 12
26 Correct 154 ms 11224 KB Output is correct : V - N = 12
27 Correct 235 ms 13264 KB Output is correct : V - N = 12
28 Correct 157 ms 12504 KB Output is correct : V - N = 12
29 Correct 102 ms 9696 KB Output is correct : V - N = 12
30 Correct 20 ms 7424 KB Output is correct : V - N = 12
31 Correct 18 ms 7168 KB Output is correct : V - N = 12
32 Correct 19 ms 7168 KB Output is correct : V - N = 12
33 Correct 19 ms 7168 KB Output is correct : V - N = 12
34 Correct 18 ms 7168 KB Output is correct : V - N = 12
35 Correct 19 ms 7168 KB Output is correct : V - N = 12
36 Correct 865 ms 30920 KB Output is correct : V - N = 12
37 Correct 725 ms 30872 KB Output is correct : V - N = 12
38 Correct 705 ms 30792 KB Output is correct : V - N = 12
39 Correct 738 ms 30920 KB Output is correct : V - N = 12
40 Correct 844 ms 30664 KB Output is correct : V - N = 12
41 Correct 122 ms 11120 KB Output is correct : V - N = 12
42 Correct 104 ms 10456 KB Output is correct : V - N = 12
43 Correct 126 ms 11096 KB Output is correct : V - N = 12
44 Correct 20 ms 7424 KB Output is correct : V - N = 12
45 Correct 80 ms 9184 KB Output is correct : V - N = 12
46 Correct 240 ms 14800 KB Output is correct : V - N = 12
47 Correct 131 ms 10968 KB Output is correct : V - N = 12
48 Correct 322 ms 17672 KB Output is correct : V - N = 12
49 Correct 67 ms 8928 KB Output is correct : V - N = 12
50 Correct 27 ms 7936 KB Output is correct : V - N = 12
51 Correct 525 ms 25884 KB Output is correct : V - N = 12
52 Correct 20 ms 7424 KB Output is correct : V - N = 12
53 Correct 517 ms 23876 KB Output is correct : V - N = 12
54 Correct 659 ms 27608 KB Output is correct : V - N = 12
55 Correct 45 ms 8440 KB Output is correct : V - N = 12
56 Correct 377 ms 18640 KB Output is correct : V - N = 12
57 Correct 646 ms 29016 KB Output is correct : V - N = 12
58 Correct 124 ms 10208 KB Output is correct : V - N = 12
59 Correct 265 ms 15568 KB Output is correct : V - N = 12
60 Correct 736 ms 29792 KB Output is correct : V - N = 12
61 Correct 13 ms 6912 KB Output is correct : V - N = 12
62 Correct 13 ms 6912 KB Output is correct : V - N = 12
63 Correct 13 ms 6912 KB Output is correct : V - N = 12
64 Correct 13 ms 6912 KB Output is correct : V - N = 12
65 Correct 13 ms 6912 KB Output is correct : V - N = 12
66 Correct 13 ms 6912 KB Output is correct : V - N = 12
67 Correct 13 ms 6912 KB Output is correct : V - N = 12
68 Correct 13 ms 6912 KB Output is correct : V - N = 12
69 Correct 13 ms 6912 KB Output is correct : V - N = 12
70 Correct 13 ms 6912 KB Output is correct : V - N = 12
71 Correct 13 ms 6912 KB Output is correct : V - N = 12
72 Correct 13 ms 6912 KB Output is correct : V - N = 12
73 Correct 14 ms 6912 KB Output is correct : V - N = 12
74 Correct 13 ms 6912 KB Output is correct : V - N = 12
75 Correct 13 ms 6912 KB Output is correct : V - N = 12
76 Correct 13 ms 6912 KB Output is correct : V - N = 12
77 Correct 13 ms 6912 KB Output is correct : V - N = 12
78 Correct 13 ms 6912 KB Output is correct : V - N = 12
79 Correct 13 ms 6912 KB Output is correct : V - N = 12
80 Correct 14 ms 6912 KB Output is correct : V - N = 12
81 Correct 13 ms 6912 KB Output is correct : V - N = 12
82 Correct 13 ms 6912 KB Output is correct : V - N = 12
83 Correct 13 ms 6912 KB Output is correct : V - N = 12
84 Correct 13 ms 6912 KB Output is correct : V - N = 12
85 Correct 14 ms 6912 KB Output is correct : V - N = 12
86 Correct 14 ms 6912 KB Output is correct : V - N = 12
87 Correct 13 ms 6912 KB Output is correct : V - N = 12
88 Correct 14 ms 6912 KB Output is correct : V - N = 12
89 Correct 14 ms 6912 KB Output is correct : V - N = 12
90 Correct 13 ms 6912 KB Output is correct : V - N = 12
91 Correct 14 ms 6912 KB Output is correct : V - N = 12
92 Correct 13 ms 6888 KB Output is correct : V - N = 12
93 Correct 13 ms 6912 KB Output is correct : V - N = 12
94 Correct 13 ms 6976 KB Output is correct : V - N = 12
95 Correct 13 ms 6912 KB Output is correct : V - N = 12
96 Correct 16 ms 6912 KB Output is correct : V - N = 12
97 Correct 13 ms 6912 KB Output is correct : V - N = 12
98 Correct 13 ms 6912 KB Output is correct : V - N = 12
99 Correct 13 ms 6912 KB Output is correct : V - N = 12
100 Correct 13 ms 6912 KB Output is correct : V - N = 12
101 Correct 13 ms 6912 KB Output is correct : V - N = 12
102 Correct 13 ms 6912 KB Output is correct : V - N = 12
103 Correct 13 ms 6912 KB Output is correct : V - N = 12
104 Correct 13 ms 6912 KB Output is correct : V - N = 12
105 Correct 14 ms 6912 KB Output is correct : V - N = 12
106 Correct 13 ms 6912 KB Output is correct : V - N = 12
107 Correct 13 ms 6912 KB Output is correct : V - N = 12
108 Correct 13 ms 6912 KB Output is correct : V - N = 12
109 Correct 13 ms 6912 KB Output is correct : V - N = 12
110 Correct 13 ms 7168 KB Output is correct : V - N = 12
111 Correct 13 ms 6912 KB Output is correct : V - N = 12
112 Correct 13 ms 6912 KB Output is correct : V - N = 12
113 Correct 14 ms 6912 KB Output is correct : V - N = 12
114 Correct 13 ms 6912 KB Output is correct : V - N = 12
115 Correct 13 ms 6912 KB Output is correct : V - N = 12
116 Correct 13 ms 6912 KB Output is correct : V - N = 12
117 Correct 13 ms 6912 KB Output is correct : V - N = 12
118 Correct 13 ms 7168 KB Output is correct : V - N = 12
119 Correct 13 ms 6912 KB Output is correct : V - N = 12
120 Correct 13 ms 6912 KB Output is correct : V - N = 12
121 Correct 13 ms 6912 KB Output is correct : V - N = 12
122 Correct 13 ms 6912 KB Output is correct : V - N = 12
123 Correct 13 ms 6912 KB Output is correct : V - N = 12
124 Correct 13 ms 6912 KB Output is correct : V - N = 12
125 Correct 13 ms 6912 KB Output is correct : V - N = 12
126 Correct 13 ms 6912 KB Output is correct : V - N = 12
127 Correct 13 ms 6912 KB Output is correct : V - N = 12
128 Correct 13 ms 6912 KB Output is correct : V - N = 12
129 Correct 13 ms 6912 KB Output is correct : V - N = 12
130 Correct 13 ms 6912 KB Output is correct : V - N = 12
131 Correct 13 ms 6912 KB Output is correct : V - N = 12
132 Correct 13 ms 6912 KB Output is correct : V - N = 12
133 Correct 13 ms 6976 KB Output is correct : V - N = 12
134 Correct 13 ms 6912 KB Output is correct : V - N = 12
135 Correct 13 ms 6912 KB Output is correct : V - N = 12
136 Correct 13 ms 6912 KB Output is correct : V - N = 12
137 Correct 13 ms 6912 KB Output is correct : V - N = 12
138 Correct 14 ms 6912 KB Output is correct : V - N = 12
139 Correct 13 ms 6912 KB Output is correct : V - N = 12
140 Correct 13 ms 6912 KB Output is correct : V - N = 12
141 Correct 13 ms 6912 KB Output is correct : V - N = 12
142 Correct 13 ms 6912 KB Output is correct : V - N = 12
143 Correct 13 ms 6912 KB Output is correct : V - N = 12
144 Correct 13 ms 6656 KB Output is correct : V - N = 12
145 Correct 13 ms 6912 KB Output is correct : V - N = 12
146 Correct 13 ms 6912 KB Output is correct : V - N = 12
147 Correct 13 ms 6912 KB Output is correct : V - N = 12
148 Correct 13 ms 6912 KB Output is correct : V - N = 12
149 Correct 13 ms 6912 KB Output is correct : V - N = 12
150 Correct 13 ms 6912 KB Output is correct : V - N = 12
151 Correct 13 ms 6912 KB Output is correct : V - N = 12
152 Correct 13 ms 6912 KB Output is correct : V - N = 12
153 Correct 13 ms 6912 KB Output is correct : V - N = 12
154 Correct 13 ms 6912 KB Output is correct : V - N = 12
155 Correct 13 ms 6912 KB Output is correct : V - N = 12
156 Correct 13 ms 6912 KB Output is correct : V - N = 12
157 Correct 13 ms 6912 KB Output is correct : V - N = 12
158 Correct 13 ms 6912 KB Output is correct : V - N = 12
159 Correct 13 ms 6912 KB Output is correct : V - N = 12
160 Correct 13 ms 6912 KB Output is correct : V - N = 12
161 Correct 13 ms 6912 KB Output is correct : V - N = 12
162 Correct 13 ms 6912 KB Output is correct : V - N = 12
163 Correct 13 ms 6912 KB Output is correct : V - N = 12
164 Correct 13 ms 6912 KB Output is correct : V - N = 12
165 Correct 13 ms 6656 KB Output is correct : V - N = 12
166 Correct 13 ms 6912 KB Output is correct : V - N = 12
167 Correct 13 ms 6912 KB Output is correct : V - N = 12
168 Correct 13 ms 6912 KB Output is correct : V - N = 12
169 Correct 13 ms 6912 KB Output is correct : V - N = 12
170 Correct 13 ms 6656 KB Output is correct : V - N = 12
171 Correct 13 ms 6912 KB Output is correct : V - N = 12
172 Correct 13 ms 6912 KB Output is correct : V - N = 12
173 Correct 14 ms 6912 KB Output is correct : V - N = 12
174 Correct 13 ms 6912 KB Output is correct : V - N = 12
175 Correct 13 ms 6912 KB Output is correct : V - N = 12
176 Correct 13 ms 6912 KB Output is correct : V - N = 12
177 Correct 13 ms 6912 KB Output is correct : V - N = 12
178 Correct 13 ms 6912 KB Output is correct : V - N = 12