oj.uz

Submission #989530

# Submission time Handle Problem Language Result Execution time Memory
989530 2024-05-28T08:59:31 Z GrindMachine Airline Route Map (JOI18_airline) C++17
100 / 100
 439 ms 29584 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read some comments about the solution long back, dont really remember much from there (except that we had to somehow encode the bits of each node)

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Alicelib.h"

void Alice( int n, int m, int A[], int B[] ){
	// InitG( 4, 3 );
	// MakeG( 0, 1, 2 );
	// MakeG( 1, 1, 3 );
	// MakeG( 2, 2, 3 );

    if(n == 1){
        InitG(1,0);
        return;
    }

    if(n == 2){
        InitG(2,m);
        if(m){
            MakeG(0,A[0],B[0]);
        }
        return;
    }

    if(n == 3){
        int val = 0;
        int b = 0;
        set<pii> edges;
        rep(i,m){
            int u = A[i], v = B[i];
            if(u > v) swap(u,v);
            edges.insert({u,v});
        }

        rep(u,n){
            for(int v = u+1; v < n; ++v){
                if(edges.count({u,v})){
                    val |= (1<<b);
                }
                b++;    
            }
        }

        InitG(9,val);
        rep1(i,val){
            MakeG(i-1,0,i);
        }

        return;
    }

    vector<pii> edges;
    vector<int> deg(n+15);

    auto add_edge = [&](int u, int v){
        edges.pb({u,v});
        deg[u]++, deg[v]++;
    };

    rep(i,m){
        add_edge(A[i],B[i]);
    }

    rep(i,n){
        rep(bit,10){
            if((i+1)&(1<<bit)){
                add_edge(i,n+bit);
            }
        }
    }

    rep(i,n){
        add_edge(i,n+10);
    }

    add_edge(n+10,n+11);

    rep(bit,9){
        add_edge(n+bit,n+bit+1);
    }

    rep(i,n){
        if(deg[i] == n+1){
            add_edge(i,n+11);
        }
    }

    InitG(n+12,sz(edges));

    // rep(i,n+12){
    //     cout << deg[i] << " ";
    // }
    // cout << endl;

    rep(i,sz(edges)){
        MakeG(i,edges[i].ff,edges[i].ss);
    }
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read some comments about the solution long back, dont really remember much from there (except that we had to somehow encode the bits of each node)

*/

const int MOD = 1e9 + 7;
const int N = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Boblib.h"

vector<int> adj[N];

void Bob( int n, int m, int C[], int D[] ){
	// InitMap( 4, 3 );
	// MakeMap( 0, 1 );
	// MakeMap( 0, 2 );
	// MakeMap( 0, 3 );

	if(n == 1){
		InitMap(1,0);
		return;
	}

	if(n == 2){
		InitMap(2,m);
		if(m){
			MakeMap(0,1);
		}
		return;
	}

	if(n == 9){
		vector<pii> edges;
		rep(bit,3){
			if(m&(1<<bit)){
				if(bit == 0){
					edges.pb({0,1});
				}
				else if(bit == 1){
					edges.pb({0,2});
				}
				else{
					edges.pb({1,2});
				}
			}
		}

		InitMap(3,sz(edges));
		for(auto [u,v] : edges){
			MakeMap(u,v);
		}
		
		return;
	}

	int on = n-12;

	vector<int> deg(n);
	rep(i,m){
		int u = C[i], v = D[i];
		deg[u]++, deg[v]++;
		adj[u].pb(v), adj[v].pb(u);
	}

	vector<bool> bad(n);

	rep(i,n){
		if(deg[i] == on+1){
			bad[i] = 1;
			trav(j,adj[i]){
				bad[j] = 1;
			}
		}
	}

	pii smallest = {inf1,inf1};
	rep(i,n){
		if(!bad[i]){
			pii px = {deg[i],i};
			amin(smallest,px);
		}
	}

	int curr = smallest.ss;
	vector<int> bits;
	while(curr != -1){
		bits.pb(curr);
		bad[curr] = 1;
		int nxt = -1;
		trav(j,adj[curr]){
			if(!bad[j]){
				assert(nxt == -1);
				nxt = j;
			}
		}

		curr = nxt;
	}

	reverse(all(bits));

	vector<bool> is_bit(n);
	trav(i,bits) is_bit[i] = 1;
	assert(sz(bits) == 10);

	// trav(i,bits){
	// 	cout << deg[i] << endl;
	// }

	vector<int> id(n);

	rep(i,sz(bits)){
		int u = bits[i];
		trav(v,adj[u]){
			if(is_bit[v]) conts;
			id[v] |= (1<<i);
		}
	}

	vector<pii> edges;

	rep(i,m){
		int u = C[i], v = D[i];
		if(id[u] and id[v]){
			edges.pb({id[u],id[v]});
		}
	}	

	InitMap(on,sz(edges));
	for(auto [u,v] : edges){
		u--, v--;
		MakeMap(u,v);
	}
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4896 KB Output is correct
2 Correct 3 ms 4884 KB Output is correct
3 Correct 2 ms 4888 KB Output is correct
4 Correct 1 ms 4884 KB Output is correct
5 Correct 2 ms 4888 KB Output is correct
6 Correct 2 ms 4888 KB Output is correct
7 Correct 2 ms 4888 KB Output is correct
8 Correct 1 ms 4896 KB Output is correct
9 Correct 2 ms 4884 KB Output is correct
10 Correct 1 ms 4880 KB Output is correct
11 Correct 3 ms 4896 KB Output is correct
12 Correct 2 ms 4888 KB Output is correct
13 Correct 2 ms 4884 KB Output is correct
14 Correct 2 ms 4888 KB Output is correct
15 Correct 2 ms 4888 KB Output is correct
16 Correct 3 ms 4884 KB Output is correct
17 Correct 2 ms 4896 KB Output is correct
18 Correct 2 ms 4888 KB Output is correct
19 Correct 2 ms 4888 KB Output is correct
20 Correct 3 ms 4888 KB Output is correct
21 Correct 1 ms 4888 KB Output is correct
22 Correct 1 ms 4888 KB Output is correct
23 Correct 2 ms 4888 KB Output is correct
24 Correct 3 ms 4880 KB Output is correct
25 Correct 3 ms 4888 KB Output is correct
26 Correct 2 ms 4884 KB Output is correct
27 Correct 3 ms 4884 KB Output is correct
28 Correct 2 ms 4888 KB Output is correct
29 Correct 1 ms 4880 KB Output is correct
30 Correct 2 ms 4892 KB Output is correct
31 Correct 1 ms 4880 KB Output is correct
32 Correct 1 ms 4884 KB Output is correct
33 Correct 1 ms 4880 KB Output is correct
34 Correct 3 ms 4884 KB Output is correct
35 Correct 2 ms 4884 KB Output is correct
36 Correct 2 ms 4888 KB Output is correct
37 Correct 3 ms 4888 KB Output is correct
38 Correct 1 ms 4880 KB Output is correct
39 Correct 3 ms 4880 KB Output is correct
40 Correct 3 ms 4884 KB Output is correct
41 Correct 2 ms 4884 KB Output is correct
42 Correct 2 ms 4888 KB Output is correct
43 Correct 3 ms 4892 KB Output is correct
44 Correct 3 ms 4880 KB Output is correct
45 Correct 1 ms 4884 KB Output is correct
46 Correct 3 ms 4888 KB Output is correct
47 Correct 2 ms 4884 KB Output is correct
48 Correct 1 ms 4884 KB Output is correct
49 Correct 2 ms 4888 KB Output is correct
50 Correct 1 ms 4884 KB Output is correct
51 Correct 3 ms 4884 KB Output is correct
52 Correct 3 ms 4884 KB Output is correct
53 Correct 2 ms 4888 KB Output is correct
54 Correct 2 ms 4896 KB Output is correct
55 Correct 2 ms 4888 KB Output is correct
56 Correct 1 ms 4896 KB Output is correct
57 Correct 3 ms 4888 KB Output is correct
58 Correct 3 ms 4896 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 29560 KB Output is correct : V - N = 12
2 Correct 284 ms 25728 KB Output is correct : V - N = 12
3 Correct 126 ms 14188 KB Output is correct : V - N = 12
4 Correct 9 ms 5412 KB Output is correct : V - N = 12
5 Correct 75 ms 10064 KB Output is correct : V - N = 12
6 Correct 232 ms 24216 KB Output is correct : V - N = 12
7 Correct 429 ms 28896 KB Output is correct : V - N = 12
8 Correct 326 ms 27724 KB Output is correct : V - N = 12
9 Correct 157 ms 16264 KB Output is correct : V - N = 12
10 Correct 17 ms 6468 KB Output is correct : V - N = 12
11 Correct 31 ms 7672 KB Output is correct : V - N = 12
12 Correct 236 ms 18448 KB Output is correct : V - N = 12
13 Correct 309 ms 28504 KB Output is correct : V - N = 12
14 Correct 359 ms 28512 KB Output is correct : V - N = 12
15 Correct 206 ms 22716 KB Output is correct : V - N = 12
16 Correct 45 ms 8372 KB Output is correct : V - N = 12
17 Correct 11 ms 5852 KB Output is correct : V - N = 12
18 Correct 146 ms 15144 KB Output is correct : V - N = 12
19 Correct 309 ms 26740 KB Output is correct : V - N = 12
20 Correct 400 ms 29252 KB Output is correct : V - N = 12
21 Correct 102 ms 12432 KB Output is correct : V - N = 12
22 Correct 76 ms 10388 KB Output is correct : V - N = 12
23 Correct 28 ms 7804 KB Output is correct : V - N = 12
24 Correct 3 ms 4888 KB Output is correct : V - N = 12
25 Correct 16 ms 6564 KB Output is correct : V - N = 12
26 Correct 57 ms 9880 KB Output is correct : V - N = 12
27 Correct 107 ms 11388 KB Output is correct : V - N = 12
28 Correct 87 ms 10736 KB Output is correct : V - N = 12
29 Correct 41 ms 7808 KB Output is correct : V - N = 12
30 Correct 5 ms 5412 KB Output is correct : V - N = 12
31 Correct 6 ms 5400 KB Output is correct : V - N = 12
32 Correct 4 ms 5396 KB Output is correct : V - N = 12
33 Correct 5 ms 5396 KB Output is correct : V - N = 12
34 Correct 5 ms 5400 KB Output is correct : V - N = 12
35 Correct 6 ms 5392 KB Output is correct : V - N = 12
36 Correct 419 ms 29584 KB Output is correct : V - N = 12
37 Correct 369 ms 29432 KB Output is correct : V - N = 12
38 Correct 374 ms 29320 KB Output is correct : V - N = 12
39 Correct 439 ms 29376 KB Output is correct : V - N = 12
40 Correct 380 ms 29556 KB Output is correct : V - N = 12
41 Correct 63 ms 9872 KB Output is correct : V - N = 12
42 Correct 50 ms 8616 KB Output is correct : V - N = 12
43 Correct 65 ms 9620 KB Output is correct : V - N = 12
44 Correct 6 ms 5372 KB Output is correct : V - N = 12
45 Correct 36 ms 7544 KB Output is correct : V - N = 12
46 Correct 126 ms 14484 KB Output is correct : V - N = 12
47 Correct 63 ms 9864 KB Output is correct : V - N = 12
48 Correct 190 ms 16292 KB Output is correct : V - N = 12
49 Correct 35 ms 7512 KB Output is correct : V - N = 12
50 Correct 11 ms 5924 KB Output is correct : V - N = 12
51 Correct 274 ms 25668 KB Output is correct : V - N = 12
52 Correct 8 ms 5412 KB Output is correct : V - N = 12
53 Correct 235 ms 23576 KB Output is correct : V - N = 12
54 Correct 333 ms 27396 KB Output is correct : V - N = 12
55 Correct 25 ms 6556 KB Output is correct : V - N = 12
56 Correct 213 ms 17892 KB Output is correct : V - N = 12
57 Correct 362 ms 28400 KB Output is correct : V - N = 12
58 Correct 52 ms 8320 KB Output is correct : V - N = 12
59 Correct 147 ms 15084 KB Output is correct : V - N = 12
60 Correct 364 ms 28888 KB Output is correct : V - N = 12
61 Correct 3 ms 4884 KB Output is correct : V - N = 12
62 Correct 2 ms 4888 KB Output is correct : V - N = 12
63 Correct 2 ms 4888 KB Output is correct : V - N = 12
64 Correct 2 ms 4888 KB Output is correct : V - N = 12
65 Correct 2 ms 4884 KB Output is correct : V - N = 12
66 Correct 3 ms 4888 KB Output is correct : V - N = 12
67 Correct 3 ms 4896 KB Output is correct : V - N = 12
68 Correct 3 ms 4888 KB Output is correct : V - N = 12
69 Correct 2 ms 4896 KB Output is correct : V - N = 12
70 Correct 1 ms 4888 KB Output is correct : V - N = 12
71 Correct 1 ms 4888 KB Output is correct : V - N = 12
72 Correct 3 ms 4888 KB Output is correct : V - N = 12
73 Correct 2 ms 4896 KB Output is correct : V - N = 12
74 Correct 3 ms 4880 KB Output is correct : V - N = 12
75 Correct 3 ms 4884 KB Output is correct : V - N = 12
76 Correct 3 ms 4888 KB Output is correct : V - N = 12
77 Correct 3 ms 4896 KB Output is correct : V - N = 12
78 Correct 3 ms 4888 KB Output is correct : V - N = 12
79 Correct 2 ms 4888 KB Output is correct : V - N = 12
80 Correct 3 ms 4884 KB Output is correct : V - N = 12
81 Correct 3 ms 4888 KB Output is correct : V - N = 12
82 Correct 2 ms 4888 KB Output is correct : V - N = 12
83 Correct 2 ms 4896 KB Output is correct : V - N = 12
84 Correct 1 ms 4888 KB Output is correct : V - N = 12
85 Correct 2 ms 4888 KB Output is correct : V - N = 12
86 Correct 2 ms 4884 KB Output is correct : V - N = 12
87 Correct 3 ms 4888 KB Output is correct : V - N = 12
88 Correct 3 ms 4888 KB Output is correct : V - N = 12
89 Correct 3 ms 4884 KB Output is correct : V - N = 12
90 Correct 2 ms 4896 KB Output is correct : V - N = 12
91 Correct 2 ms 4884 KB Output is correct : V - N = 12
92 Correct 2 ms 5132 KB Output is correct : V - N = 12
93 Correct 1 ms 4956 KB Output is correct : V - N = 12
94 Correct 1 ms 4884 KB Output is correct : V - N = 12
95 Correct 1 ms 4884 KB Output is correct : V - N = 12
96 Correct 3 ms 4888 KB Output is correct : V - N = 12
97 Correct 3 ms 4996 KB Output is correct : V - N = 12
98 Correct 3 ms 4896 KB Output is correct : V - N = 12
99 Correct 3 ms 4896 KB Output is correct : V - N = 12
100 Correct 3 ms 4888 KB Output is correct : V - N = 12
101 Correct 3 ms 4896 KB Output is correct : V - N = 12
102 Correct 2 ms 4888 KB Output is correct : V - N = 12
103 Correct 3 ms 4888 KB Output is correct : V - N = 12
104 Correct 3 ms 4884 KB Output is correct : V - N = 12
105 Correct 3 ms 4888 KB Output is correct : V - N = 12
106 Correct 2 ms 4888 KB Output is correct : V - N = 12
107 Correct 2 ms 4888 KB Output is correct : V - N = 12
108 Correct 3 ms 4896 KB Output is correct : V - N = 12
109 Correct 2 ms 4888 KB Output is correct : V - N = 12
110 Correct 1 ms 4908 KB Output is correct : V - N = 12
111 Correct 3 ms 4888 KB Output is correct : V - N = 12
112 Correct 1 ms 4888 KB Output is correct : V - N = 12
113 Correct 2 ms 4888 KB Output is correct : V - N = 12
114 Correct 2 ms 4888 KB Output is correct : V - N = 12
115 Correct 1 ms 4888 KB Output is correct : V - N = 12
116 Correct 2 ms 4888 KB Output is correct : V - N = 12
117 Correct 3 ms 4888 KB Output is correct : V - N = 12
118 Correct 3 ms 4888 KB Output is correct : V - N = 12
119 Correct 2 ms 4888 KB Output is correct : V - N = 12
120 Correct 3 ms 4888 KB Output is correct : V - N = 12
121 Correct 2 ms 4888 KB Output is correct : V - N = 12
122 Correct 3 ms 4896 KB Output is correct : V - N = 12
123 Correct 2 ms 4884 KB Output is correct : V - N = 12
124 Correct 2 ms 4884 KB Output is correct : V - N = 12
125 Correct 2 ms 4888 KB Output is correct : V - N = 12
126 Correct 1 ms 4888 KB Output is correct : V - N = 12
127 Correct 3 ms 4888 KB Output is correct : V - N = 12
128 Correct 2 ms 4892 KB Output is correct : V - N = 12
129 Correct 2 ms 4884 KB Output is correct : V - N = 12
130 Correct 1 ms 4884 KB Output is correct : V - N = 12
131 Correct 2 ms 4968 KB Output is correct : V - N = 12
132 Correct 3 ms 4896 KB Output is correct : V - N = 12
133 Correct 2 ms 4888 KB Output is correct : V - N = 12
134 Correct 3 ms 4892 KB Output is correct : V - N = 12
135 Correct 1 ms 4888 KB Output is correct : V - N = 12
136 Correct 3 ms 4892 KB Output is correct : V - N = 12
137 Correct 1 ms 4888 KB Output is correct : V - N = 12
138 Correct 2 ms 4888 KB Output is correct : V - N = 12
139 Correct 1 ms 4896 KB Output is correct : V - N = 12
140 Correct 3 ms 4884 KB Output is correct : V - N = 12
141 Correct 3 ms 4888 KB Output is correct : V - N = 12
142 Correct 1 ms 4888 KB Output is correct : V - N = 12
143 Correct 1 ms 4888 KB Output is correct : V - N = 12
144 Correct 2 ms 4880 KB Output is correct : V - N = 12
145 Correct 3 ms 4892 KB Output is correct : V - N = 12
146 Correct 1 ms 4888 KB Output is correct : V - N = 12
147 Correct 2 ms 4896 KB Output is correct : V - N = 12
148 Correct 1 ms 4888 KB Output is correct : V - N = 12
149 Correct 2 ms 4884 KB Output is correct : V - N = 12
150 Correct 1 ms 4892 KB Output is correct : V - N = 12
151 Correct 2 ms 4884 KB Output is correct : V - N = 12
152 Correct 1 ms 4880 KB Output is correct : V - N = 12
153 Correct 2 ms 4884 KB Output is correct : V - N = 12
154 Correct 3 ms 4880 KB Output is correct : V - N = 12
155 Correct 1 ms 4884 KB Output is correct : V - N = 12
156 Correct 2 ms 4888 KB Output is correct : V - N = 12
157 Correct 1 ms 4884 KB Output is correct : V - N = 12
158 Correct 2 ms 4856 KB Output is correct : V - N = 12
159 Correct 3 ms 4888 KB Output is correct : V - N = 12
160 Correct 1 ms 4896 KB Output is correct : V - N = 12
161 Correct 2 ms 4888 KB Output is correct : V - N = 12
162 Correct 2 ms 4880 KB Output is correct : V - N = 12
163 Correct 2 ms 4888 KB Output is correct : V - N = 12
164 Correct 1 ms 4892 KB Output is correct : V - N = 12
165 Correct 2 ms 4880 KB Output is correct : V - N = 12
166 Correct 2 ms 4888 KB Output is correct : V - N = 12
167 Correct 1 ms 4896 KB Output is correct : V - N = 12
168 Correct 1 ms 4896 KB Output is correct : V - N = 12
169 Correct 3 ms 4884 KB Output is correct : V - N = 12
170 Correct 2 ms 4884 KB Output is correct : V - N = 12
171 Correct 1 ms 4880 KB Output is correct : V - N = 0
172 Correct 3 ms 4888 KB Output is correct : V - N = 0
173 Correct 2 ms 4880 KB Output is correct : V - N = 0
174 Correct 1 ms 4888 KB Output is correct : V - N = 6
175 Correct 1 ms 4888 KB Output is correct : V - N = 6
176 Correct 2 ms 4888 KB Output is correct : V - N = 12
177 Correct 2 ms 4888 KB Output is correct : V - N = 12
178 Correct 2 ms 4884 KB Output is correct : V - N = 12