oj.uz

Submission #991828

# Submission time Handle Problem Language Result Execution time Memory
991828 2024-06-03T08:23:29 Z danikoynov Airline Route Map (JOI18_airline) C++14
91 / 100
 469 ms 72472 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include<bits/stdc++.h>

using namespace std;

const int maxn = 2e3 + 10;
const int maxbit = 11;
const int fict = 2;
/**
from 0 to N - 1 : normal vertexes
from N to N + maxbit - 1 : binary powers
from N + maxbit to N + maxbit + fict - 1 : fictitious vertexes
vertex N + maxbit is connected to all except the binary powers

*/
void Alice( int N, int M, int A[], int B[] )
{
    if (N == 1 && M == 0)
    {
        InitG(1, 0);
        return;
    }
    vector < pair < int, int > > edges;
    for (int i = 0; i < M; i ++)
        edges.push_back({A[i], B[i]});
    for (int i = 0; i < N; i ++)
    {
        for (int bit = 0; bit < maxbit; bit ++)
        {
            if ((i & (1 << bit)) > 0)
                edges.push_back({i, N + bit});
        }
    }
    for (int i = 0; i < N + maxbit; i ++)
        edges.push_back({N + maxbit, i});
    for (int i = 0; i < N; i ++)
    {
        edges.push_back({N + maxbit + 1, i});
    }


    for (int i = N + 1; i < N + maxbit; i ++)
        edges.push_back({i - 1, i});

    InitG(N + maxbit + fict, edges.size());
    int cnt = 0;
    for (pair < int, int > cur : edges)
    {
        MakeG(cnt ++, cur.first, cur.second);
    }
}

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

using namespace std;

const int MAXN = 2e3 + 10;
struct edge
{
    int v, u;

    edge(int _v = 0, int _u = 0)
    {
        v = _v;
        u = _u;
    }
}edges[MAXN * MAXN];

int deg[MAXN], non_bin[MAXN];
vector < int > adj[MAXN];
int value[MAXN], ridx[MAXN];
vector < int > path;
void dfs(int v, int p)
{
    path.push_back(v);
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        dfs(u, v);
    }
}

const int MAXBIT = 11;
const int FICT = 2;

int tf[MAXN];
void Bob( int V, int U, int C[], int D[] )
{
    if (V == 1 && U == 0)
    {
        InitMap(1, 0);
        return;
    }
    for (int i = 0; i < U; i ++)
    {
        edges[i] = edge(C[i], D[i]);
        deg[C[i]] ++;
        deg[D[i]] ++;
        //cout << C[i] << " " << D[i] << endl;

    }
    ///exit(0);

    int mx = 0;
    for (int i = 0; i < V; i ++)
        if (deg[i] > deg[mx])
        mx = i;


    for (int i = 0; i < U; i ++)
    {
        if (C[i] == mx)
            tf[D[i]] = 1;
        else
        if (D[i] == mx)
            tf[C[i]] = 1;
    }

    tf[mx] = 1;
    int fx = 0;
    while(tf[fx] == 1)
        fx ++;


    non_bin[mx] = 1;
    non_bin[fx] = 1;

        for (int i = 0; i < U; i ++)
    {
        if (C[i] == fx)
            non_bin[D[i]] = 1;
        else
        if (D[i] == fx)
            non_bin[C[i]] = 1;
    }



    for (int i = 0; i < U; i ++)
    {
        if (non_bin[C[i]] || non_bin[D[i]])
            continue;

        adj[C[i]].push_back(D[i]);
        adj[D[i]].push_back(C[i]);
    }

    int ver = 0;
    for (int i = 0; i < V; i ++)
    {
        ///cout << "non bin " << i << " : " << non_bin[i] << " " << deg[i] << endl;
        if (non_bin[i] == 0 && deg[i] == 2)
            ver = i;
    }

    ///cout << "ver " << ver << endl;
    dfs(ver, - 1);
    reverse(path.begin(), path.end());
    //for (int p : path)
      //  cout << p << " ";
      //  cout << endl;
    for (int i = 0; i < V; i ++)
        adj[i].clear();
    for (int i = 0; i < U; i ++)
    {
                adj[C[i]].push_back(D[i]);
        adj[D[i]].push_back(C[i]);
    }
    for (int i = 0; i < path.size(); i ++)
    {
        value[path[i]] = (1 << i);
    }

    vector < pair < int, int > > ls;
    for (int i = 0; i < V; i ++)
    {
        for (int u : adj[i])
        {
            if (non_bin[u] == 0)
            ridx[i] += value[u];
        }
    }


    for (int i = 0; i < U; i ++)
    {
        if (C[i] == mx || D[i] == mx)
            continue;
            if (C[i] == fx || D[i] == fx)
            continue;
        if (non_bin[C[i]] == 0 || non_bin[D[i]] == 0)
            continue;
        ls.push_back({ridx[C[i]], ridx[D[i]]});
        ///cout << "edge " << ls.back().first << " " << ls.back().second << endl;

    }

    InitMap(V - FICT - MAXBIT, ls.size());
    for (pair < int, int > cur : ls)
        MakeMap(cur.first, cur.second);




}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:121:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |     for (int i = 0; i < path.size(); i ++)
      |                     ~~^~~~~~~~~~~~~
Bob.cpp:139:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  139 |         if (C[i] == mx || D[i] == mx)
      |         ^~
Bob.cpp:141:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  141 |             if (C[i] == fx || D[i] == fx)
      |             ^~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 48644 KB Output is correct
2 Correct 10 ms 48652 KB Output is correct
3 Correct 8 ms 48644 KB Output is correct
4 Correct 7 ms 46604 KB Output is correct
5 Correct 8 ms 48640 KB Output is correct
6 Correct 8 ms 48644 KB Output is correct
7 Correct 7 ms 48492 KB Output is correct
8 Correct 7 ms 48644 KB Output is correct
9 Correct 7 ms 48720 KB Output is correct
10 Correct 7 ms 46600 KB Output is correct
11 Correct 8 ms 48612 KB Output is correct
12 Correct 6 ms 48644 KB Output is correct
13 Correct 8 ms 48652 KB Output is correct
14 Correct 8 ms 48644 KB Output is correct
15 Correct 6 ms 48644 KB Output is correct
16 Correct 6 ms 48644 KB Output is correct
17 Correct 7 ms 48744 KB Output is correct
18 Correct 7 ms 48512 KB Output is correct
19 Correct 6 ms 48652 KB Output is correct
20 Correct 7 ms 48640 KB Output is correct
21 Correct 8 ms 48644 KB Output is correct
22 Correct 8 ms 48644 KB Output is correct
23 Correct 6 ms 48648 KB Output is correct
24 Correct 8 ms 46604 KB Output is correct
25 Correct 8 ms 48640 KB Output is correct
26 Correct 7 ms 48736 KB Output is correct
27 Correct 8 ms 48644 KB Output is correct
28 Correct 6 ms 48648 KB Output is correct
29 Correct 7 ms 48640 KB Output is correct
30 Correct 6 ms 46604 KB Output is correct
31 Correct 7 ms 46596 KB Output is correct
32 Correct 6 ms 46604 KB Output is correct
33 Correct 7 ms 46604 KB Output is correct
34 Correct 7 ms 46596 KB Output is correct
35 Correct 7 ms 46596 KB Output is correct
36 Correct 6 ms 48508 KB Output is correct
37 Correct 6 ms 48744 KB Output is correct
38 Correct 7 ms 48644 KB Output is correct
39 Correct 7 ms 48644 KB Output is correct
40 Correct 7 ms 48644 KB Output is correct
41 Correct 7 ms 48520 KB Output is correct
42 Correct 7 ms 48600 KB Output is correct
43 Correct 6 ms 48652 KB Output is correct
44 Correct 7 ms 46604 KB Output is correct
45 Correct 6 ms 46596 KB Output is correct
46 Correct 6 ms 48640 KB Output is correct
47 Correct 7 ms 48644 KB Output is correct
48 Correct 7 ms 48652 KB Output is correct
49 Correct 7 ms 48644 KB Output is correct
50 Correct 7 ms 46596 KB Output is correct
51 Correct 7 ms 42388 KB Output is correct
52 Correct 6 ms 48636 KB Output is correct
53 Correct 6 ms 46600 KB Output is correct
54 Correct 6 ms 48640 KB Output is correct
55 Correct 7 ms 48640 KB Output is correct
56 Correct 8 ms 48592 KB Output is correct
57 Correct 8 ms 48644 KB Output is correct
58 Correct 6 ms 48644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 48644 KB Output is correct
2 Correct 10 ms 48652 KB Output is correct
3 Correct 8 ms 48644 KB Output is correct
4 Correct 7 ms 46604 KB Output is correct
5 Correct 8 ms 48640 KB Output is correct
6 Correct 8 ms 48644 KB Output is correct
7 Correct 7 ms 48492 KB Output is correct
8 Correct 7 ms 48644 KB Output is correct
9 Correct 7 ms 48720 KB Output is correct
10 Correct 7 ms 46600 KB Output is correct
11 Correct 8 ms 48612 KB Output is correct
12 Correct 6 ms 48644 KB Output is correct
13 Correct 8 ms 48652 KB Output is correct
14 Correct 8 ms 48644 KB Output is correct
15 Correct 6 ms 48644 KB Output is correct
16 Correct 6 ms 48644 KB Output is correct
17 Correct 7 ms 48744 KB Output is correct
18 Correct 7 ms 48512 KB Output is correct
19 Correct 6 ms 48652 KB Output is correct
20 Correct 7 ms 48640 KB Output is correct
21 Correct 8 ms 48644 KB Output is correct
22 Correct 8 ms 48644 KB Output is correct
23 Correct 6 ms 48648 KB Output is correct
24 Correct 8 ms 46604 KB Output is correct
25 Correct 8 ms 48640 KB Output is correct
26 Correct 7 ms 48736 KB Output is correct
27 Correct 8 ms 48644 KB Output is correct
28 Correct 6 ms 48648 KB Output is correct
29 Correct 7 ms 48640 KB Output is correct
30 Correct 6 ms 46604 KB Output is correct
31 Correct 7 ms 46596 KB Output is correct
32 Correct 6 ms 46604 KB Output is correct
33 Correct 7 ms 46604 KB Output is correct
34 Correct 7 ms 46596 KB Output is correct
35 Correct 7 ms 46596 KB Output is correct
36 Correct 6 ms 48508 KB Output is correct
37 Correct 6 ms 48744 KB Output is correct
38 Correct 7 ms 48644 KB Output is correct
39 Correct 7 ms 48644 KB Output is correct
40 Correct 7 ms 48644 KB Output is correct
41 Correct 7 ms 48520 KB Output is correct
42 Correct 7 ms 48600 KB Output is correct
43 Correct 6 ms 48652 KB Output is correct
44 Correct 7 ms 46604 KB Output is correct
45 Correct 6 ms 46596 KB Output is correct
46 Correct 6 ms 48640 KB Output is correct
47 Correct 7 ms 48644 KB Output is correct
48 Correct 7 ms 48652 KB Output is correct
49 Correct 7 ms 48644 KB Output is correct
50 Correct 7 ms 46596 KB Output is correct
51 Correct 7 ms 42388 KB Output is correct
52 Correct 6 ms 48636 KB Output is correct
53 Correct 6 ms 46600 KB Output is correct
54 Correct 6 ms 48640 KB Output is correct
55 Correct 7 ms 48640 KB Output is correct
56 Correct 8 ms 48592 KB Output is correct
57 Correct 8 ms 48644 KB Output is correct
58 Correct 6 ms 48644 KB Output is correct
59 Correct 8 ms 48640 KB Output is correct
60 Correct 7 ms 48760 KB Output is correct
61 Correct 10 ms 48560 KB Output is correct
62 Correct 7 ms 48480 KB Output is correct
63 Correct 8 ms 48652 KB Output is correct
64 Correct 8 ms 48644 KB Output is correct
65 Correct 8 ms 48652 KB Output is correct
66 Correct 7 ms 48644 KB Output is correct
67 Correct 8 ms 48644 KB Output is correct
68 Correct 8 ms 48604 KB Output is correct
69 Correct 8 ms 48460 KB Output is correct
70 Correct 9 ms 48640 KB Output is correct
71 Correct 7 ms 48644 KB Output is correct
72 Correct 8 ms 48468 KB Output is correct
73 Correct 8 ms 48648 KB Output is correct
74 Correct 7 ms 48644 KB Output is correct
75 Correct 7 ms 48600 KB Output is correct
76 Correct 8 ms 48640 KB Output is correct
77 Correct 6 ms 48680 KB Output is correct
78 Correct 7 ms 48648 KB Output is correct
79 Correct 8 ms 48640 KB Output is correct
80 Correct 8 ms 48652 KB Output is correct
81 Correct 8 ms 48644 KB Output is correct
82 Correct 7 ms 48644 KB Output is correct
83 Correct 6 ms 48644 KB Output is correct
84 Correct 7 ms 48544 KB Output is correct
85 Correct 8 ms 48644 KB Output is correct
86 Correct 6 ms 48644 KB Output is correct
87 Correct 8 ms 48644 KB Output is correct
88 Correct 7 ms 48640 KB Output is correct
89 Correct 6 ms 46684 KB Output is correct
90 Correct 7 ms 46596 KB Output is correct
91 Correct 6 ms 46596 KB Output is correct
92 Correct 6 ms 46604 KB Output is correct
93 Correct 7 ms 46552 KB Output is correct
94 Correct 7 ms 48640 KB Output is correct
95 Correct 8 ms 48644 KB Output is correct
96 Correct 8 ms 48492 KB Output is correct
97 Correct 7 ms 48648 KB Output is correct
98 Correct 9 ms 48644 KB Output is correct
99 Correct 7 ms 48648 KB Output is correct
100 Correct 8 ms 48644 KB Output is correct
101 Correct 7 ms 48644 KB Output is correct
102 Correct 7 ms 46596 KB Output is correct
103 Correct 7 ms 48604 KB Output is correct
104 Correct 7 ms 48644 KB Output is correct
105 Correct 8 ms 48644 KB Output is correct
106 Correct 8 ms 48452 KB Output is correct
107 Correct 8 ms 48636 KB Output is correct
108 Correct 8 ms 48644 KB Output is correct
109 Correct 7 ms 48644 KB Output is correct
110 Correct 6 ms 48644 KB Output is correct
111 Correct 8 ms 48644 KB Output is correct
112 Correct 8 ms 48644 KB Output is correct
113 Correct 8 ms 48636 KB Output is correct
114 Correct 6 ms 48640 KB Output is correct
115 Correct 8 ms 48644 KB Output is correct
116 Correct 9 ms 48616 KB Output is correct
117 Correct 8 ms 48644 KB Output is correct
118 Correct 7 ms 48604 KB Output is correct

Subtask #3
54.0 / 63.0

# Verdict Execution time Memory Grader output
1 Partially correct 469 ms 71328 KB Output is partially correct : V - N = 13
2 Partially correct 292 ms 70008 KB Output is partially correct : V - N = 13
3 Partially correct 120 ms 54152 KB Output is partially correct : V - N = 13
4 Partially correct 12 ms 49092 KB Output is partially correct : V - N = 13
5 Partially correct 93 ms 51532 KB Output is partially correct : V - N = 13
6 Partially correct 254 ms 70548 KB Output is partially correct : V - N = 13
7 Partially correct 376 ms 71256 KB Output is partially correct : V - N = 13
8 Partially correct 406 ms 72164 KB Output is partially correct : V - N = 13
9 Partially correct 182 ms 54964 KB Output is partially correct : V - N = 13
10 Partially correct 23 ms 49804 KB Output is partially correct : V - N = 13
11 Partially correct 36 ms 50212 KB Output is partially correct : V - N = 13
12 Partially correct 238 ms 60420 KB Output is partially correct : V - N = 13
13 Partially correct 349 ms 71300 KB Output is partially correct : V - N = 13
14 Partially correct 379 ms 71060 KB Output is partially correct : V - N = 13
15 Partially correct 234 ms 65860 KB Output is partially correct : V - N = 13
16 Partially correct 64 ms 50864 KB Output is partially correct : V - N = 13
17 Partially correct 14 ms 49400 KB Output is partially correct : V - N = 13
18 Partially correct 147 ms 54424 KB Output is partially correct : V - N = 13
19 Partially correct 333 ms 71404 KB Output is partially correct : V - N = 13
20 Partially correct 406 ms 71988 KB Output is partially correct : V - N = 13
21 Partially correct 87 ms 53124 KB Output is partially correct : V - N = 13
22 Partially correct 73 ms 51748 KB Output is partially correct : V - N = 13
23 Partially correct 39 ms 50088 KB Output is partially correct : V - N = 13
24 Partially correct 9 ms 48640 KB Output is partially correct : V - N = 13
25 Partially correct 24 ms 49528 KB Output is partially correct : V - N = 13
26 Partially correct 77 ms 51616 KB Output is partially correct : V - N = 13
27 Partially correct 114 ms 52116 KB Output is partially correct : V - N = 13
28 Partially correct 98 ms 51860 KB Output is partially correct : V - N = 13
29 Partially correct 57 ms 50072 KB Output is partially correct : V - N = 13
30 Partially correct 11 ms 49072 KB Output is partially correct : V - N = 13
31 Partially correct 11 ms 46660 KB Output is partially correct : V - N = 13
32 Partially correct 12 ms 46572 KB Output is partially correct : V - N = 13
33 Partially correct 11 ms 46556 KB Output is partially correct : V - N = 13
34 Partially correct 16 ms 46568 KB Output is partially correct : V - N = 13
35 Partially correct 14 ms 46636 KB Output is partially correct : V - N = 13
36 Partially correct 404 ms 71520 KB Output is partially correct : V - N = 13
37 Partially correct 430 ms 71824 KB Output is partially correct : V - N = 13
38 Partially correct 356 ms 71064 KB Output is partially correct : V - N = 13
39 Partially correct 401 ms 72068 KB Output is partially correct : V - N = 13
40 Partially correct 374 ms 71456 KB Output is partially correct : V - N = 13
41 Partially correct 84 ms 51864 KB Output is partially correct : V - N = 13
42 Partially correct 55 ms 50856 KB Output is partially correct : V - N = 13
43 Partially correct 71 ms 51448 KB Output is partially correct : V - N = 13
44 Partially correct 11 ms 49108 KB Output is partially correct : V - N = 13
45 Partially correct 39 ms 50116 KB Output is partially correct : V - N = 13
46 Partially correct 153 ms 54512 KB Output is partially correct : V - N = 13
47 Partially correct 63 ms 51612 KB Output is partially correct : V - N = 13
48 Partially correct 171 ms 54920 KB Output is partially correct : V - N = 13
49 Partially correct 35 ms 50084 KB Output is partially correct : V - N = 13
50 Partially correct 14 ms 49328 KB Output is partially correct : V - N = 13
51 Partially correct 292 ms 70352 KB Output is partially correct : V - N = 13
52 Partially correct 13 ms 48952 KB Output is partially correct : V - N = 13
53 Partially correct 259 ms 69848 KB Output is partially correct : V - N = 13
54 Partially correct 367 ms 71980 KB Output is partially correct : V - N = 13
55 Partially correct 24 ms 49800 KB Output is partially correct : V - N = 13
56 Partially correct 191 ms 60144 KB Output is partially correct : V - N = 13
57 Partially correct 426 ms 70804 KB Output is partially correct : V - N = 13
58 Partially correct 51 ms 50684 KB Output is partially correct : V - N = 13
59 Partially correct 157 ms 54248 KB Output is partially correct : V - N = 13
60 Partially correct 391 ms 72472 KB Output is partially correct : V - N = 13
61 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
62 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
63 Partially correct 8 ms 48640 KB Output is partially correct : V - N = 13
64 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
65 Partially correct 6 ms 48640 KB Output is partially correct : V - N = 13
66 Partially correct 10 ms 48644 KB Output is partially correct : V - N = 13
67 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
68 Partially correct 7 ms 48652 KB Output is partially correct : V - N = 13
69 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
70 Partially correct 7 ms 48652 KB Output is partially correct : V - N = 13
71 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
72 Partially correct 7 ms 48668 KB Output is partially correct : V - N = 13
73 Partially correct 8 ms 48636 KB Output is partially correct : V - N = 13
74 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
75 Partially correct 7 ms 48604 KB Output is partially correct : V - N = 13
76 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
77 Partially correct 6 ms 48644 KB Output is partially correct : V - N = 13
78 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
79 Partially correct 7 ms 48652 KB Output is partially correct : V - N = 13
80 Partially correct 9 ms 48644 KB Output is partially correct : V - N = 13
81 Partially correct 7 ms 48600 KB Output is partially correct : V - N = 13
82 Partially correct 6 ms 48600 KB Output is partially correct : V - N = 13
83 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
84 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
85 Partially correct 6 ms 48652 KB Output is partially correct : V - N = 13
86 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
87 Partially correct 7 ms 48612 KB Output is partially correct : V - N = 13
88 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
89 Partially correct 7 ms 48652 KB Output is partially correct : V - N = 13
90 Partially correct 8 ms 48640 KB Output is partially correct : V - N = 13
91 Partially correct 6 ms 46604 KB Output is partially correct : V - N = 13
92 Partially correct 7 ms 46692 KB Output is partially correct : V - N = 13
93 Partially correct 8 ms 46596 KB Output is partially correct : V - N = 13
94 Partially correct 8 ms 46596 KB Output is partially correct : V - N = 13
95 Partially correct 7 ms 46592 KB Output is partially correct : V - N = 13
96 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
97 Partially correct 7 ms 48736 KB Output is partially correct : V - N = 13
98 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
99 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
100 Partially correct 8 ms 48640 KB Output is partially correct : V - N = 13
101 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
102 Partially correct 7 ms 48648 KB Output is partially correct : V - N = 13
103 Partially correct 7 ms 48616 KB Output is partially correct : V - N = 13
104 Partially correct 7 ms 46692 KB Output is partially correct : V - N = 13
105 Partially correct 10 ms 48484 KB Output is partially correct : V - N = 13
106 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
107 Partially correct 7 ms 48676 KB Output is partially correct : V - N = 13
108 Partially correct 9 ms 48592 KB Output is partially correct : V - N = 13
109 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
110 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
111 Partially correct 8 ms 48636 KB Output is partially correct : V - N = 13
112 Partially correct 7 ms 48588 KB Output is partially correct : V - N = 13
113 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
114 Partially correct 6 ms 48644 KB Output is partially correct : V - N = 13
115 Partially correct 7 ms 48576 KB Output is partially correct : V - N = 13
116 Partially correct 6 ms 48640 KB Output is partially correct : V - N = 13
117 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
118 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
119 Partially correct 8 ms 48640 KB Output is partially correct : V - N = 13
120 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
121 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
122 Partially correct 7 ms 48648 KB Output is partially correct : V - N = 13
123 Partially correct 7 ms 48572 KB Output is partially correct : V - N = 13
124 Partially correct 6 ms 46388 KB Output is partially correct : V - N = 13
125 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
126 Partially correct 7 ms 48604 KB Output is partially correct : V - N = 13
127 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
128 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
129 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
130 Partially correct 8 ms 46528 KB Output is partially correct : V - N = 13
131 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
132 Partially correct 7 ms 48652 KB Output is partially correct : V - N = 13
133 Partially correct 8 ms 48604 KB Output is partially correct : V - N = 13
134 Partially correct 8 ms 48740 KB Output is partially correct : V - N = 13
135 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
136 Partially correct 6 ms 48640 KB Output is partially correct : V - N = 13
137 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
138 Partially correct 10 ms 48520 KB Output is partially correct : V - N = 13
139 Partially correct 9 ms 48596 KB Output is partially correct : V - N = 13
140 Partially correct 7 ms 48612 KB Output is partially correct : V - N = 13
141 Partially correct 10 ms 48576 KB Output is partially correct : V - N = 13
142 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
143 Partially correct 9 ms 48616 KB Output is partially correct : V - N = 13
144 Partially correct 6 ms 46592 KB Output is partially correct : V - N = 13
145 Partially correct 8 ms 48652 KB Output is partially correct : V - N = 13
146 Partially correct 8 ms 48640 KB Output is partially correct : V - N = 13
147 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
148 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
149 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
150 Partially correct 7 ms 46592 KB Output is partially correct : V - N = 13
151 Partially correct 7 ms 46528 KB Output is partially correct : V - N = 13
152 Partially correct 8 ms 46604 KB Output is partially correct : V - N = 13
153 Partially correct 10 ms 46440 KB Output is partially correct : V - N = 13
154 Partially correct 9 ms 46844 KB Output is partially correct : V - N = 13
155 Partially correct 7 ms 46592 KB Output is partially correct : V - N = 13
156 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
157 Partially correct 8 ms 48460 KB Output is partially correct : V - N = 13
158 Partially correct 6 ms 48648 KB Output is partially correct : V - N = 13
159 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
160 Partially correct 9 ms 48496 KB Output is partially correct : V - N = 13
161 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
162 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
163 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
164 Partially correct 7 ms 46592 KB Output is partially correct : V - N = 13
165 Partially correct 8 ms 46596 KB Output is partially correct : V - N = 13
166 Partially correct 9 ms 48644 KB Output is partially correct : V - N = 13
167 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
168 Partially correct 7 ms 48468 KB Output is partially correct : V - N = 13
169 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
170 Partially correct 6 ms 46596 KB Output is partially correct : V - N = 13
171 Correct 6 ms 42500 KB Output is correct : V - N = 0
172 Partially correct 7 ms 48444 KB Output is partially correct : V - N = 13
173 Partially correct 7 ms 46592 KB Output is partially correct : V - N = 13
174 Partially correct 7 ms 48640 KB Output is partially correct : V - N = 13
175 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
176 Partially correct 8 ms 48644 KB Output is partially correct : V - N = 13
177 Partially correct 7 ms 48644 KB Output is partially correct : V - N = 13
178 Partially correct 8 ms 48648 KB Output is partially correct : V - N = 13