Submission #220917

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
220917	2020-04-09T09:28:32 Z	rama_pang	Airline Route Map (JOI18_airline)	C++14	100 / 100	761 ms	30920 KB

Alice

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

namespace {

struct edge_t {
  int u, v;
  edge_t() {}
  edge_t(int u, int v) : u(u), v(v) {}
};

}

void Alice(int N, int M, int A[], int B[]) {
  if (N == 1) return InitG(1, 0);

  vector<edge_t> edges;

  vector<int> BIT(10);
  for (int i = 0; i < 10; i++) BIT[i] = N + i;
  int ALL = N + 10, HUB = N + 11;

  // Original Edges
  for (int i = 0; i < M; i++) {
    edges.emplace_back(A[i], B[i]);
  }

  // Connect each vertex to its corresponding BIT vertex to be able to restore identity
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 10; j++) {
      if (i & (1 << j)) {
        edges.emplace_back(i, BIT[j]);
      }
    }
  }

  // Connect every vertex except HUB to ALL
  for (int i = 0; i < N + 10; i++) {
    edges.emplace_back(ALL, i);
  }

  // Connect every BIT vertex to HUB
  for (int i = 0; i < 10; i++) {
    edges.emplace_back(HUB, BIT[i]);
  }

  // Connect every BIT to the preceding and following bit position
  for (int i = 0; i < 9; i++) {
    edges.emplace_back(BIT[i], BIT[i + 1]);
  }

  // Initialize Transformed Graph
  InitG(N + 12, edges.size());
  for (int i = 0; i < edges.size(); i++) {
    MakeG(i, edges[i].u, edges[i].v);
  }
}

Bob

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

namespace {

struct edge_t {
  int u, v;
  edge_t() {}
  edge_t(int u, int v) : u(u), v(v) {}
};

}

void Bob(int V, int U, int C[], int D[]) {
  if (V == 1) return InitMap(1, 0);

  vector<edge_t> edges;

  int N = V - 12;
  vector<int> BIT(10, -1);
  int ALL = -1, HUB = -1;

  vector<int> degree(V, 0);
  vector<vector<bool>> adj(V, vector<bool>(V, false));

  for (int i = 0; i < U; i++) {
    degree[C[i]]++;
    degree[D[i]]++;
    adj[C[i]][D[i]] = adj[D[i]][C[i]] = true;
  }

  // Recover ALL
  for (int i = 0; i < V; i++) {
    if (degree[i] == N + 10) { // ALL is the only vertex connected to N + 10 other vertices
      ALL = i;
      break;
    }
  }

  // Recover HUB
  for (int i = 0; i < V; i++) {
    if (ALL != i && !adj[ALL][i]) { // HUB is the only vertex not connected to ALL
      HUB = i;
      break;
    }
  }

  { // Recover BIT
    vector<int> BIT_shuffled; // shuffled BITs, will be recovered later
    
    vector<int> HUB_deg(V); // degree of verticeswhen only considering edges where both endpoints are adjacent to HUB
    vector<vector<bool>> HUB_adj(V, vector<bool>(V, false)); // adjacency matrix of vertices adjacent to hub

    for (int i = 0; i < V; i++) {
      if (HUB != i && adj[HUB][i]) { // HUB is only connected to BITs
        BIT_shuffled.emplace_back(i);
      }
    }

    // Adjacency matrix consisting of elements where both edge endpoints are connected to HUB
    for (auto bit : BIT_shuffled) {
      for (int v = 0; v < V; v++) {
        if (v == bit) continue;
        if (v == HUB) continue;
        if (adj[bit][v] && adj[HUB][v]) {
          HUB_adj[bit][v] = HUB_adj[v][bit] = true;
          HUB_deg[bit]++;
          HUB_deg[v]++;
        }
      }
    }

    // Each edge is double counted, so we divide them
    for (auto bit : BIT_shuffled) {
      HUB_deg[bit] /= 2;
    }

    // Find endpoint of BIT line
    int first = -1, last = -1;
    for (auto bit : BIT_shuffled) {
      if (HUB_deg[bit] == 1) {
        if (first == -1) {
          first = bit;
        } else {
          last = bit;
        }
      }
    }

    if (degree[first] < degree[last]) {
      swap(first, last); // BIT[0] > BIT[N - 1], we can uniquely identify the BIT sequence
    }

    // Recover Line of BITs
    for (int cur = first, cnt = 0, prv = -1; cnt < 10; cnt++) {
      BIT[cnt] = cur;
      for (int nxt = 0; nxt < V; nxt++) {
        if (cur != nxt && prv != nxt && HUB_adj[cur][nxt]) {
          prv = cur;
          cur = nxt;
          break;
        }
      }
    }
  }

  auto OriginalVertex = [&](int X) {
    bool res = false;
    res |= X == ALL;
    res |= X == HUB;
    for (int i = 0; i < 10; i++) {
      res |= X == BIT[i];
    }
    return !res;
  };

  for (int i = 0; i < U; i++) {
    if (OriginalVertex(C[i]) && OriginalVertex(D[i])) {
      edges.emplace_back(C[i], D[i]);
    }
  }

  auto GetIdentity = [&](int X) {
    int id = 0;
    for (int i = 0; i < 10; i++) {
      if (adj[X][BIT[i]]) {
        id |= 1 << i;
      }
    }
    return id;
  };

  for (int i = 0; i < edges.size(); i++) {
    edges[i].u = GetIdentity(edges[i].u);
    edges[i].v = GetIdentity(edges[i].v);
  }

  InitMap(N, edges.size());
  for (auto e : edges) {
    MakeMap(e.u, e.v);
  }
}

Compilation message

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

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

Subtask #1

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	6912 KB	Output is correct
2	Correct	14 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	14 ms	6912 KB	Output is correct
9	Correct	13 ms	6912 KB	Output is correct
10	Correct	13 ms	6912 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	13 ms	6912 KB	Output is correct
15	Correct	13 ms	6912 KB	Output is correct
16	Correct	14 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	13 ms	6912 KB	Output is correct
26	Correct	13 ms	6776 KB	Output is correct
27	Correct	13 ms	6912 KB	Output is correct
28	Correct	13 ms	6912 KB	Output is correct
29	Correct	13 ms	6912 KB	Output is correct
30	Correct	13 ms	7168 KB	Output is correct
31	Correct	13 ms	6912 KB	Output is correct
32	Correct	13 ms	6656 KB	Output is correct
33	Correct	13 ms	6912 KB	Output is correct
34	Correct	13 ms	6912 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	7016 KB	Output is correct
40	Correct	13 ms	6912 KB	Output is correct
41	Correct	13 ms	6912 KB	Output is correct
42	Correct	13 ms	6912 KB	Output is correct
43	Correct	14 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	13 ms	6912 KB	Output is correct
47	Correct	13 ms	6912 KB	Output is correct
48	Correct	13 ms	6912 KB	Output is correct
49	Correct	13 ms	6912 KB	Output is correct
50	Correct	13 ms	6656 KB	Output is correct
51	Correct	13 ms	6656 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	6912 KB	Output is correct
2	Correct	14 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	14 ms	6912 KB	Output is correct
9	Correct	13 ms	6912 KB	Output is correct
10	Correct	13 ms	6912 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	13 ms	6912 KB	Output is correct
15	Correct	13 ms	6912 KB	Output is correct
16	Correct	14 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	13 ms	6912 KB	Output is correct
26	Correct	13 ms	6776 KB	Output is correct
27	Correct	13 ms	6912 KB	Output is correct
28	Correct	13 ms	6912 KB	Output is correct
29	Correct	13 ms	6912 KB	Output is correct
30	Correct	13 ms	7168 KB	Output is correct
31	Correct	13 ms	6912 KB	Output is correct
32	Correct	13 ms	6656 KB	Output is correct
33	Correct	13 ms	6912 KB	Output is correct
34	Correct	13 ms	6912 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	7016 KB	Output is correct
40	Correct	13 ms	6912 KB	Output is correct
41	Correct	13 ms	6912 KB	Output is correct
42	Correct	13 ms	6912 KB	Output is correct
43	Correct	14 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	13 ms	6912 KB	Output is correct
47	Correct	13 ms	6912 KB	Output is correct
48	Correct	13 ms	6912 KB	Output is correct
49	Correct	13 ms	6912 KB	Output is correct
50	Correct	13 ms	6656 KB	Output is correct
51	Correct	13 ms	6656 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	14 ms	6912 KB	Output is correct
60	Correct	14 ms	6912 KB	Output is correct
61	Correct	13 ms	7168 KB	Output is correct
62	Correct	13 ms	6912 KB	Output is correct
63	Correct	13 ms	6912 KB	Output is correct
64	Correct	13 ms	6912 KB	Output is correct
65	Correct	13 ms	6912 KB	Output is correct
66	Correct	14 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	14 ms	6912 KB	Output is correct
70	Correct	13 ms	6912 KB	Output is correct
71	Correct	13 ms	6912 KB	Output is correct
72	Correct	14 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	13 ms	6912 KB	Output is correct
77	Correct	14 ms	6912 KB	Output is correct
78	Correct	14 ms	6912 KB	Output is correct
79	Correct	13 ms	6912 KB	Output is correct
80	Correct	13 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	13 ms	6912 KB	Output is correct
85	Correct	13 ms	6912 KB	Output is correct
86	Correct	14 ms	6912 KB	Output is correct
87	Correct	13 ms	6912 KB	Output is correct
88	Correct	13 ms	6912 KB	Output is correct
89	Correct	13 ms	6656 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	6656 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	13 ms	6912 KB	Output is correct
97	Correct	14 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	13 ms	6912 KB	Output is correct
102	Correct	13 ms	6912 KB	Output is correct
103	Correct	13 ms	6912 KB	Output is correct
104	Correct	13 ms	6912 KB	Output is correct
105	Correct	13 ms	6912 KB	Output is correct
106	Correct	13 ms	6912 KB	Output is correct
107	Correct	13 ms	6912 KB	Output is correct
108	Correct	13 ms	6912 KB	Output is correct
109	Correct	14 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	13 ms	6912 KB	Output is correct
113	Correct	14 ms	6912 KB	Output is correct
114	Correct	13 ms	6912 KB	Output is correct
115	Correct	13 ms	6912 KB	Output is correct
116	Correct	13 ms	6912 KB	Output is correct
117	Correct	14 ms	6912 KB	Output is correct
118	Correct	14 ms	6912 KB	Output is correct

Subtask #3

63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	743 ms	30664 KB	Output is correct : V - N = 12
2	Correct	568 ms	25800 KB	Output is correct : V - N = 12
3	Correct	227 ms	14032 KB	Output is correct : V - N = 12
4	Correct	24 ms	7424 KB	Output is correct : V - N = 12
5	Correct	134 ms	11576 KB	Output is correct : V - N = 12
6	Correct	497 ms	22216 KB	Output is correct : V - N = 12
7	Correct	744 ms	30664 KB	Output is correct : V - N = 12
8	Correct	646 ms	27848 KB	Output is correct : V - N = 12
9	Correct	380 ms	17440 KB	Output is correct : V - N = 12
10	Correct	46 ms	8440 KB	Output is correct : V - N = 12
11	Correct	83 ms	9184 KB	Output is correct : V - N = 12
12	Correct	383 ms	18896 KB	Output is correct : V - N = 12
13	Correct	698 ms	28872 KB	Output is correct : V - N = 12
14	Correct	711 ms	29640 KB	Output is correct : V - N = 12
15	Correct	450 ms	20680 KB	Output is correct : V - N = 12
16	Correct	107 ms	9952 KB	Output is correct : V - N = 12
17	Correct	28 ms	7928 KB	Output is correct : V - N = 12
18	Correct	284 ms	15792 KB	Output is correct : V - N = 12
19	Correct	633 ms	26824 KB	Output is correct : V - N = 12
20	Correct	722 ms	30664 KB	Output is correct : V - N = 12
21	Correct	211 ms	13272 KB	Output is correct : V - N = 12
22	Correct	161 ms	11944 KB	Output is correct : V - N = 12
23	Correct	90 ms	9088 KB	Output is correct : V - N = 12
24	Correct	16 ms	7168 KB	Output is correct : V - N = 12
25	Correct	43 ms	8184 KB	Output is correct : V - N = 12
26	Correct	136 ms	11176 KB	Output is correct : V - N = 12
27	Correct	191 ms	13272 KB	Output is correct : V - N = 12
28	Correct	181 ms	12464 KB	Output is correct : V - N = 12
29	Correct	95 ms	9960 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	20 ms	7168 KB	Output is correct : V - N = 12
34	Correct	19 ms	7168 KB	Output is correct : V - N = 12
35	Correct	18 ms	7168 KB	Output is correct : V - N = 12
36	Correct	761 ms	30792 KB	Output is correct : V - N = 12
37	Correct	734 ms	30920 KB	Output is correct : V - N = 12
38	Correct	742 ms	30664 KB	Output is correct : V - N = 12
39	Correct	726 ms	30664 KB	Output is correct : V - N = 12
40	Correct	730 ms	30776 KB	Output is correct : V - N = 12
41	Correct	144 ms	11224 KB	Output is correct : V - N = 12
42	Correct	110 ms	10208 KB	Output is correct : V - N = 12
43	Correct	148 ms	10712 KB	Output is correct : V - N = 12
44	Correct	19 ms	7168 KB	Output is correct : V - N = 12
45	Correct	80 ms	9696 KB	Output is correct : V - N = 12
46	Correct	270 ms	14800 KB	Output is correct : V - N = 12
47	Correct	135 ms	11224 KB	Output is correct : V - N = 12
48	Correct	389 ms	17616 KB	Output is correct : V - N = 12
49	Correct	75 ms	8928 KB	Output is correct : V - N = 12
50	Correct	32 ms	7680 KB	Output is correct : V - N = 12
51	Correct	586 ms	25328 KB	Output is correct : V - N = 12
52	Correct	20 ms	7424 KB	Output is correct : V - N = 12
53	Correct	491 ms	21960 KB	Output is correct : V - N = 12
54	Correct	644 ms	27496 KB	Output is correct : V - N = 12
55	Correct	49 ms	8440 KB	Output is correct : V - N = 12
56	Correct	370 ms	18896 KB	Output is correct : V - N = 12
57	Correct	698 ms	29136 KB	Output is correct : V - N = 12
58	Correct	111 ms	9952 KB	Output is correct : V - N = 12
59	Correct	274 ms	15568 KB	Output is correct : V - N = 12
60	Correct	717 ms	29896 KB	Output is correct : V - N = 12
61	Correct	14 ms	6912 KB	Output is correct : V - N = 12
62	Correct	14 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	14 ms	6912 KB	Output is correct : V - N = 12
67	Correct	15 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	13 ms	6912 KB	Output is correct : V - N = 12
74	Correct	15 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	14 ms	6912 KB	Output is correct : V - N = 12
79	Correct	13 ms	6912 KB	Output is correct : V - N = 12
80	Correct	13 ms	7016 KB	Output is correct : V - N = 12
81	Correct	13 ms	6912 KB	Output is correct : V - N = 12
82	Correct	14 ms	6912 KB	Output is correct : V - N = 12
83	Correct	14 ms	6912 KB	Output is correct : V - N = 12
84	Correct	13 ms	6912 KB	Output is correct : V - N = 12
85	Correct	13 ms	6912 KB	Output is correct : V - N = 12
86	Correct	13 ms	6912 KB	Output is correct : V - N = 12
87	Correct	14 ms	6912 KB	Output is correct : V - N = 12
88	Correct	13 ms	6912 KB	Output is correct : V - N = 12
89	Correct	13 ms	6912 KB	Output is correct : V - N = 12
90	Correct	13 ms	6912 KB	Output is correct : V - N = 12
91	Correct	13 ms	6912 KB	Output is correct : V - N = 12
92	Correct	14 ms	6912 KB	Output is correct : V - N = 12
93	Correct	13 ms	6656 KB	Output is correct : V - N = 12
94	Correct	13 ms	6912 KB	Output is correct : V - N = 12
95	Correct	13 ms	6656 KB	Output is correct : V - N = 12
96	Correct	14 ms	6912 KB	Output is correct : V - N = 12
97	Correct	14 ms	6912 KB	Output is correct : V - N = 12
98	Correct	14 ms	6912 KB	Output is correct : V - N = 12
99	Correct	13 ms	6912 KB	Output is correct : V - N = 12
100	Correct	14 ms	6808 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	13 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	14 ms	6912 KB	Output is correct : V - N = 12
109	Correct	13 ms	7008 KB	Output is correct : V - N = 12
110	Correct	13 ms	6912 KB	Output is correct : V - N = 12
111	Correct	13 ms	6760 KB	Output is correct : V - N = 12
112	Correct	13 ms	6912 KB	Output is correct : V - N = 12
113	Correct	13 ms	6912 KB	Output is correct : V - N = 12
114	Correct	15 ms	6912 KB	Output is correct : V - N = 12
115	Correct	13 ms	6712 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	6912 KB	Output is correct : V - N = 12
119	Correct	13 ms	6912 KB	Output is correct : V - N = 12
120	Correct	14 ms	6912 KB	Output is correct : V - N = 12
121	Correct	14 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	6912 KB	Output is correct : V - N = 12
134	Correct	13 ms	6712 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	13 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	14 ms	6912 KB	Output is correct : V - N = 12
144	Correct	13 ms	6912 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	6656 KB	Output is correct : V - N = 12
154	Correct	13 ms	6656 KB	Output is correct : V - N = 12
155	Correct	13 ms	6912 KB	Output is correct : V - N = 12
156	Correct	15 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	6912 KB	Output is correct : V - N = 12
166	Correct	13 ms	6912 KB	Output is correct : V - N = 12
167	Correct	15 ms	6912 KB	Output is correct : V - N = 12
168	Correct	13 ms	6912 KB	Output is correct : V - N = 12
169	Correct	14 ms	6912 KB	Output is correct : V - N = 12
170	Correct	13 ms	6912 KB	Output is correct : V - N = 12
171	Correct	13 ms	6656 KB	Output is correct : V - N = 0
172	Correct	13 ms	7168 KB	Output is correct : V - N = 12
173	Correct	13 ms	6752 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