oj.uz

답안 #989352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989352 2024-05-28T03:48:25 Z GrindMachine 항공 노선도 (JOI18_airline) C++17
0 / 100
 458 ms 29772 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;
    }

    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);
    add_edge(n+11,n);
    rep(bit,9){
        add_edge(n+bit,n+bit+1);
    }

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

    assert(count(all(deg),n+1) == 1);

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

    // rep(i,n+13){
    //     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;
	}

	int on = n-13;

	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);
	}

	bool found = false;
	vector<bool> bad(n);
	vector<int> bits;

	rep(i,n){
		if(deg[i] == on+1){
			assert(!found);
			found = true;
			bad[i] = 1;
			int curr = -1;

			trav(j,adj[i]){
				if(deg[j] != 2){
					bad[j] = 1;
				}
				else{
					assert(curr == -1);
					curr = j;
				}
			}

			while(true){
				bits.pb(curr);
				int nxt = -1;
				trav(j,adj[curr]){
					if(bad[j]) conts;
					assert(nxt == -1);
					nxt = j;
				}

				if(nxt == -1) break;
				bad[curr] = 1;
				curr = nxt;
			}
		}
	}

	vector<bool> is_bit(n);
	trav(i,bits) is_bit[i] = 1;
	bits.erase(bits.begin());
	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
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4888 KB Output is correct
2 Correct 2 ms 4888 KB Output is correct
3 Correct 3 ms 4888 KB Output is correct
4 Correct 2 ms 6924 KB Output is correct
5 Correct 2 ms 4888 KB Output is correct
6 Correct 1 ms 4888 KB Output is correct
7 Correct 2 ms 4884 KB Output is correct
8 Correct 2 ms 4884 KB Output is correct
9 Correct 1 ms 4888 KB Output is correct
10 Correct 1 ms 4884 KB Output is correct
11 Correct 2 ms 4892 KB Output is correct
12 Correct 1 ms 4896 KB Output is correct
13 Correct 3 ms 4888 KB Output is correct
14 Correct 1 ms 4884 KB Output is correct
15 Correct 1 ms 4884 KB Output is correct
16 Correct 1 ms 4888 KB Output is correct
17 Correct 2 ms 4884 KB Output is correct
18 Correct 2 ms 4888 KB Output is correct
19 Correct 1 ms 4888 KB Output is correct
20 Correct 1 ms 4896 KB Output is correct
21 Correct 2 ms 4888 KB Output is correct
22 Correct 2 ms 4888 KB Output is correct
23 Correct 2 ms 4884 KB Output is correct
24 Correct 2 ms 4880 KB Output is correct
25 Correct 1 ms 4888 KB Output is correct
26 Correct 1 ms 4884 KB Output is correct
27 Correct 1 ms 4884 KB Output is correct
28 Correct 2 ms 4888 KB Output is correct
29 Correct 1 ms 4888 KB Output is correct
30 Correct 2 ms 4792 KB Output is correct
31 Correct 2 ms 6924 KB Output is correct
32 Correct 2 ms 4884 KB Output is correct
33 Correct 2 ms 6924 KB Output is correct
34 Correct 1 ms 4884 KB Output is correct
35 Correct 2 ms 6928 KB Output is correct
36 Correct 1 ms 4888 KB Output is correct
37 Correct 3 ms 4888 KB Output is correct
38 Correct 2 ms 4888 KB Output is correct
39 Correct 1 ms 4896 KB Output is correct
40 Correct 1 ms 4896 KB Output is correct
41 Correct 1 ms 4888 KB Output is correct
42 Correct 1 ms 4888 KB Output is correct
43 Correct 3 ms 4888 KB Output is correct
44 Correct 2 ms 4884 KB Output is correct
45 Correct 1 ms 4884 KB Output is correct
46 Correct 2 ms 4884 KB Output is correct
47 Correct 2 ms 4888 KB Output is correct
48 Correct 3 ms 4888 KB Output is correct
49 Correct 1 ms 4888 KB Output is correct
50 Correct 3 ms 4884 KB Output is correct
51 Correct 3 ms 4880 KB Output is correct
52 Correct 2 ms 4900 KB Output is correct
53 Correct 2 ms 4876 KB Output is correct
54 Runtime error 4 ms 6744 KB Execution killed with signal 6
55 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4888 KB Output is correct
2 Correct 2 ms 4888 KB Output is correct
3 Correct 3 ms 4888 KB Output is correct
4 Correct 2 ms 6924 KB Output is correct
5 Correct 2 ms 4888 KB Output is correct
6 Correct 1 ms 4888 KB Output is correct
7 Correct 2 ms 4884 KB Output is correct
8 Correct 2 ms 4884 KB Output is correct
9 Correct 1 ms 4888 KB Output is correct
10 Correct 1 ms 4884 KB Output is correct
11 Correct 2 ms 4892 KB Output is correct
12 Correct 1 ms 4896 KB Output is correct
13 Correct 3 ms 4888 KB Output is correct
14 Correct 1 ms 4884 KB Output is correct
15 Correct 1 ms 4884 KB Output is correct
16 Correct 1 ms 4888 KB Output is correct
17 Correct 2 ms 4884 KB Output is correct
18 Correct 2 ms 4888 KB Output is correct
19 Correct 1 ms 4888 KB Output is correct
20 Correct 1 ms 4896 KB Output is correct
21 Correct 2 ms 4888 KB Output is correct
22 Correct 2 ms 4888 KB Output is correct
23 Correct 2 ms 4884 KB Output is correct
24 Correct 2 ms 4880 KB Output is correct
25 Correct 1 ms 4888 KB Output is correct
26 Correct 1 ms 4884 KB Output is correct
27 Correct 1 ms 4884 KB Output is correct
28 Correct 2 ms 4888 KB Output is correct
29 Correct 1 ms 4888 KB Output is correct
30 Correct 2 ms 4792 KB Output is correct
31 Correct 2 ms 6924 KB Output is correct
32 Correct 2 ms 4884 KB Output is correct
33 Correct 2 ms 6924 KB Output is correct
34 Correct 1 ms 4884 KB Output is correct
35 Correct 2 ms 6928 KB Output is correct
36 Correct 1 ms 4888 KB Output is correct
37 Correct 3 ms 4888 KB Output is correct
38 Correct 2 ms 4888 KB Output is correct
39 Correct 1 ms 4896 KB Output is correct
40 Correct 1 ms 4896 KB Output is correct
41 Correct 1 ms 4888 KB Output is correct
42 Correct 1 ms 4888 KB Output is correct
43 Correct 3 ms 4888 KB Output is correct
44 Correct 2 ms 4884 KB Output is correct
45 Correct 1 ms 4884 KB Output is correct
46 Correct 2 ms 4884 KB Output is correct
47 Correct 2 ms 4888 KB Output is correct
48 Correct 3 ms 4888 KB Output is correct
49 Correct 1 ms 4888 KB Output is correct
50 Correct 3 ms 4884 KB Output is correct
51 Correct 3 ms 4880 KB Output is correct
52 Correct 2 ms 4900 KB Output is correct
53 Correct 2 ms 4876 KB Output is correct
54 Runtime error 4 ms 6744 KB Execution killed with signal 6
55 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 403 ms 29772 KB Output is partially correct : V - N = 13
2 Partially correct 304 ms 25740 KB Output is partially correct : V - N = 13
3 Partially correct 108 ms 14104 KB Output is partially correct : V - N = 13
4 Partially correct 7 ms 5412 KB Output is partially correct : V - N = 13
5 Partially correct 67 ms 10136 KB Output is partially correct : V - N = 13
6 Partially correct 243 ms 23756 KB Output is partially correct : V - N = 13
7 Partially correct 411 ms 28840 KB Output is partially correct : V - N = 13
8 Partially correct 314 ms 27356 KB Output is partially correct : V - N = 13
9 Partially correct 163 ms 16260 KB Output is partially correct : V - N = 13
10 Partially correct 20 ms 6472 KB Output is partially correct : V - N = 13
11 Partially correct 36 ms 7496 KB Output is partially correct : V - N = 13
12 Partially correct 191 ms 18688 KB Output is partially correct : V - N = 13
13 Partially correct 320 ms 28308 KB Output is partially correct : V - N = 13
14 Partially correct 448 ms 28488 KB Output is partially correct : V - N = 13
15 Partially correct 271 ms 22660 KB Output is partially correct : V - N = 13
16 Partially correct 51 ms 8464 KB Output is partially correct : V - N = 13
17 Partially correct 9 ms 5900 KB Output is partially correct : V - N = 13
18 Partially correct 140 ms 15192 KB Output is partially correct : V - N = 13
19 Partially correct 317 ms 26864 KB Output is partially correct : V - N = 13
20 Partially correct 458 ms 29168 KB Output is partially correct : V - N = 13
21 Partially correct 86 ms 12432 KB Output is partially correct : V - N = 13
22 Partially correct 68 ms 10580 KB Output is partially correct : V - N = 13
23 Partially correct 30 ms 8012 KB Output is partially correct : V - N = 13
24 Partially correct 5 ms 4888 KB Output is partially correct : V - N = 13
25 Partially correct 20 ms 6476 KB Output is partially correct : V - N = 13
26 Partially correct 74 ms 10084 KB Output is partially correct : V - N = 13
27 Partially correct 103 ms 11424 KB Output is partially correct : V - N = 13
28 Partially correct 85 ms 10784 KB Output is partially correct : V - N = 13
29 Partially correct 50 ms 7844 KB Output is partially correct : V - N = 13
30 Partially correct 8 ms 5412 KB Output is partially correct : V - N = 13
31 Partially correct 6 ms 7436 KB Output is partially correct : V - N = 13
32 Partially correct 4 ms 5396 KB Output is partially correct : V - N = 13
33 Partially correct 4 ms 5396 KB Output is partially correct : V - N = 13
34 Partially correct 5 ms 5396 KB Output is partially correct : V - N = 13
35 Partially correct 5 ms 5396 KB Output is partially correct : V - N = 13
36 Partially correct 359 ms 29616 KB Output is partially correct : V - N = 13
37 Partially correct 334 ms 29364 KB Output is partially correct : V - N = 13
38 Partially correct 451 ms 29280 KB Output is partially correct : V - N = 13
39 Partially correct 368 ms 29308 KB Output is partially correct : V - N = 13
40 Partially correct 356 ms 29480 KB Output is partially correct : V - N = 13
41 Partially correct 57 ms 9880 KB Output is partially correct : V - N = 13
42 Partially correct 48 ms 8652 KB Output is partially correct : V - N = 13
43 Partially correct 64 ms 9624 KB Output is partially correct : V - N = 13
44 Partially correct 6 ms 5408 KB Output is partially correct : V - N = 13
45 Partially correct 42 ms 7592 KB Output is partially correct : V - N = 13
46 Partially correct 118 ms 14444 KB Output is partially correct : V - N = 13
47 Partially correct 64 ms 9880 KB Output is partially correct : V - N = 13
48 Partially correct 164 ms 16340 KB Output is partially correct : V - N = 13
49 Partially correct 28 ms 7448 KB Output is partially correct : V - N = 13
50 Partially correct 8 ms 5928 KB Output is partially correct : V - N = 13
51 Partially correct 293 ms 25728 KB Output is partially correct : V - N = 13
52 Partially correct 6 ms 5384 KB Output is partially correct : V - N = 13
53 Partially correct 229 ms 23552 KB Output is partially correct : V - N = 13
54 Partially correct 331 ms 27384 KB Output is partially correct : V - N = 13
55 Partially correct 17 ms 6556 KB Output is partially correct : V - N = 13
56 Partially correct 186 ms 17644 KB Output is partially correct : V - N = 13
57 Partially correct 391 ms 28260 KB Output is partially correct : V - N = 13
58 Partially correct 45 ms 8348 KB Output is partially correct : V - N = 13
59 Partially correct 134 ms 14976 KB Output is partially correct : V - N = 13
60 Partially correct 366 ms 28880 KB Output is partially correct : V - N = 13
61 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
62 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
63 Partially correct 3 ms 4892 KB Output is partially correct : V - N = 13
64 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
65 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
66 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
67 Partially correct 3 ms 4904 KB Output is partially correct : V - N = 13
68 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
69 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
70 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
71 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
72 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
73 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
74 Partially correct 3 ms 4892 KB Output is partially correct : V - N = 13
75 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
76 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
77 Partially correct 2 ms 4892 KB Output is partially correct : V - N = 13
78 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
79 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
80 Partially correct 2 ms 4868 KB Output is partially correct : V - N = 13
81 Partially correct 3 ms 4812 KB Output is partially correct : V - N = 13
82 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
83 Partially correct 2 ms 4968 KB Output is partially correct : V - N = 13
84 Partially correct 2 ms 4896 KB Output is partially correct : V - N = 13
85 Partially correct 2 ms 4896 KB Output is partially correct : V - N = 13
86 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
87 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
88 Partially correct 2 ms 4896 KB Output is partially correct : V - N = 13
89 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
90 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
91 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 13
92 Partially correct 1 ms 4884 KB Output is partially correct : V - N = 13
93 Partially correct 1 ms 4896 KB Output is partially correct : V - N = 13
94 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
95 Partially correct 1 ms 4880 KB Output is partially correct : V - N = 13
96 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
97 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
98 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
99 Partially correct 4 ms 4888 KB Output is partially correct : V - N = 13
100 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
101 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
102 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
103 Partially correct 2 ms 4896 KB Output is partially correct : V - N = 13
104 Partially correct 1 ms 6924 KB Output is partially correct : V - N = 13
105 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
106 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
107 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
108 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
109 Partially correct 2 ms 4896 KB Output is partially correct : V - N = 13
110 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
111 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
112 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
113 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
114 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
115 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
116 Partially correct 2 ms 4900 KB Output is partially correct : V - N = 13
117 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
118 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
119 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
120 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
121 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
122 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 13
123 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
124 Partially correct 1 ms 4880 KB Output is partially correct : V - N = 13
125 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
126 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
127 Partially correct 3 ms 4888 KB Output is partially correct : V - N = 13
128 Partially correct 1 ms 4900 KB Output is partially correct : V - N = 13
129 Partially correct 2 ms 4892 KB Output is partially correct : V - N = 13
130 Partially correct 1 ms 4884 KB Output is partially correct : V - N = 13
131 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
132 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
133 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
134 Partially correct 1 ms 4884 KB Output is partially correct : V - N = 13
135 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
136 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
137 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
138 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
139 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 13
140 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
141 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
142 Partially correct 1 ms 4884 KB Output is partially correct : V - N = 13
143 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
144 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 13
145 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
146 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
147 Partially correct 1 ms 4900 KB Output is partially correct : V - N = 13
148 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
149 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
150 Partially correct 1 ms 4884 KB Output is partially correct : V - N = 13
151 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
152 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
153 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
154 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
155 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
156 Partially correct 2 ms 4892 KB Output is partially correct : V - N = 13
157 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
158 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
159 Partially correct 2 ms 4888 KB Output is partially correct : V - N = 13
160 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
161 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
162 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
163 Partially correct 1 ms 4888 KB Output is partially correct : V - N = 13
164 Partially correct 3 ms 4880 KB Output is partially correct : V - N = 13
165 Partially correct 3 ms 4884 KB Output is partially correct : V - N = 13
166 Partially correct 2 ms 4880 KB Output is partially correct : V - N = 13
167 Partially correct 1 ms 5004 KB Output is partially correct : V - N = 13
168 Partially correct 3 ms 4896 KB Output is partially correct : V - N = 13
169 Partially correct 2 ms 4884 KB Output is partially correct : V - N = 13
170 Partially correct 2 ms 6936 KB Output is partially correct : V - N = 13
171 Correct 2 ms 4888 KB Output is correct : V - N = 0
172 Correct 2 ms 4888 KB Output is correct : V - N = 0
173 Correct 1 ms 4888 KB Output is correct : V - N = 0
174 Runtime error 5 ms 6744 KB Execution killed with signal 6
175 Halted 0 ms 0 KB -