oj.uz

Submission #531792

# Submission time Handle Problem Language Result Execution time Memory
531792 2022-03-01T14:10:24 Z BorisBarca Dreaming (IOI13_dreaming) C++14
47 / 100
 154 ms 32156 KB 
/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}


inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

#include "dreaming.h"

const int N = 1e5 + 10;

int a[N], b[N], t[N], idx, bst, d, dp[N], rj[N], sb[N];
vpi e[N];
vi comp[N];
bool bio[N];

void diam1(int node, int dad, int l){
	if (l > d){
		bst = node;
		d = l;
	}
	bio[node] = 1;
	comp[idx].PB(node);
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam1(nxt.X, node, l + nxt.Y);
	}
}

void diam2(int node, int dad, int l){
	if (l > d)
		d = l;
	bio[node] = 1;
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam2(nxt.X, node, l + nxt.Y);
	}
}

void max_lanac(int node, int dad){
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		max_lanac(nxt.X, node);
		dp[node] = max(dp[node], dp[nxt.X] + nxt.Y);
	}
}

int calc(int node, int dad, int up){
	multiset <int> ms;
	ms.INS(up);
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	int ret = INF;
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.erase(ms.find(dp[nxt.X] + nxt.Y));
		ret = min(ret, calc(nxt.X, node, *ms.rbegin() + nxt.Y));
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	ms.clear();

	rj[node] = max(dp[node], up);
	ret = min(ret, rj[node]);
	return ret;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]){
	REP(i, M){
		e[A[i]].PB({B[i], T[i]});
		e[B[i]].PB({A[i], T[i]});
	}

	int sol = 0;

	REP(i, N){
		if (bio[i])
			continue;
		bst = -1, d = -1;
		diam1(i, -1, 0);
		sol = max(sol, d);
		FORA(el, comp[idx])
			bio[el] = 0;
		diam2(bst, -1, 0);
		sol = max(sol, d);
		idx++;
	}

	vi ans;
	REP(i, idx){
		max_lanac(comp[i][0], -1);
		ans.PB(calc(comp[i][0], -1, 0));
	}
	//cout << sz(ans) << '\n';
	sort(all(ans));
	reverse(all(ans));
	sol = max(sol, ans[0] + ans[1] + L);
	if (sz(ans) > 2){
		sol = max(sol, ans[1] + ans[2] + 2 * L);
	}
	return sol;
}

void local(){
	int n, m, l; cin >> n >> m >> l;
	REP(i, m)
		cin >> a[i] >> b[i] >> t[i];
	cout << travelTime(n, m, l, a, b, t) << '\n';
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 21040 KB Output is correct
2 Correct 83 ms 20280 KB Output is correct
3 Correct 45 ms 19540 KB Output is correct
4 Correct 11 ms 7340 KB Output is correct
5 Correct 8 ms 6092 KB Output is correct
6 Correct 19 ms 8524 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 34 ms 11508 KB Output is correct
9 Correct 46 ms 16372 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 95 ms 16068 KB Output is correct
12 Correct 77 ms 18604 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4988 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 5 ms 4948 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 5 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4944 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 4 ms 4952 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 4 ms 5008 KB Output is correct
24 Correct 5 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 21040 KB Output is correct
2 Correct 83 ms 20280 KB Output is correct
3 Correct 45 ms 19540 KB Output is correct
4 Correct 11 ms 7340 KB Output is correct
5 Correct 8 ms 6092 KB Output is correct
6 Correct 19 ms 8524 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 34 ms 11508 KB Output is correct
9 Correct 46 ms 16372 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 95 ms 16068 KB Output is correct
12 Correct 77 ms 18604 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4988 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 5 ms 4948 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 5 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 3 ms 4944 KB Output is correct
30 Correct 3 ms 4944 KB Output is correct
31 Correct 4 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 4 ms 4952 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 4 ms 5008 KB Output is correct
37 Correct 5 ms 4940 KB Output is correct
38 Correct 4 ms 4940 KB Output is correct
39 Correct 72 ms 21120 KB Output is correct
40 Correct 86 ms 20292 KB Output is correct
41 Correct 52 ms 19520 KB Output is correct
42 Correct 13 ms 7352 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 5 ms 4940 KB Output is correct
45 Correct 3 ms 4940 KB Output is correct
46 Correct 3 ms 5036 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 4 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 3 ms 4940 KB Output is correct
53 Correct 4 ms 4940 KB Output is correct
54 Correct 3 ms 4940 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 98 ms 11464 KB Output is correct
58 Correct 143 ms 11564 KB Output is correct
59 Correct 99 ms 11528 KB Output is correct
60 Correct 92 ms 11472 KB Output is correct
61 Correct 92 ms 11284 KB Output is correct
62 Correct 94 ms 11392 KB Output is correct
63 Correct 86 ms 11212 KB Output is correct
64 Correct 109 ms 11200 KB Output is correct
65 Correct 154 ms 11192 KB Output is correct
66 Correct 86 ms 11200 KB Output is correct
67 Correct 114 ms 11600 KB Output is correct
68 Correct 133 ms 11556 KB Output is correct
69 Correct 148 ms 11544 KB Output is correct
70 Correct 128 ms 11580 KB Output is correct
71 Correct 3 ms 4940 KB Output is correct
72 Correct 5 ms 5196 KB Output is correct
73 Correct 4 ms 5196 KB Output is correct
74 Correct 17 ms 5196 KB Output is correct
75 Correct 6 ms 5196 KB Output is correct
76 Correct 4 ms 5196 KB Output is correct
77 Correct 6 ms 5156 KB Output is correct
78 Correct 6 ms 5196 KB Output is correct
79 Correct 5 ms 5196 KB Output is correct
80 Correct 150 ms 11488 KB Output is correct
81 Correct 110 ms 11592 KB Output is correct
82 Correct 86 ms 11332 KB Output is correct
83 Correct 120 ms 11404 KB Output is correct
84 Correct 5 ms 5196 KB Output is correct
85 Correct 4 ms 5196 KB Output is correct
86 Correct 15 ms 5160 KB Output is correct
87 Correct 15 ms 5212 KB Output is correct
88 Correct 7 ms 5196 KB Output is correct
89 Correct 6 ms 5196 KB Output is correct
90 Correct 5 ms 5196 KB Output is correct
91 Correct 5 ms 5196 KB Output is correct
92 Correct 7 ms 5196 KB Output is correct
93 Correct 6 ms 5196 KB Output is correct
94 Correct 3 ms 4940 KB Output is correct
95 Correct 3 ms 4940 KB Output is correct
96 Correct 3 ms 4940 KB Output is correct
97 Correct 3 ms 4940 KB Output is correct
98 Correct 3 ms 4940 KB Output is correct
99 Correct 3 ms 4940 KB Output is correct
100 Correct 3 ms 4940 KB Output is correct
101 Correct 3 ms 4940 KB Output is correct
102 Correct 3 ms 4940 KB Output is correct
103 Correct 3 ms 4940 KB Output is correct
104 Correct 10 ms 6092 KB Output is correct
105 Correct 19 ms 8492 KB Output is correct
106 Correct 3 ms 5068 KB Output is correct
107 Correct 48 ms 11420 KB Output is correct
108 Correct 46 ms 16344 KB Output is correct
109 Correct 3 ms 5068 KB Output is correct
110 Correct 65 ms 16140 KB Output is correct
111 Correct 135 ms 18620 KB Output is correct
112 Correct 4 ms 5068 KB Output is correct
113 Correct 129 ms 32156 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 10444 KB Output is correct
2 Correct 38 ms 10460 KB Output is correct
3 Correct 74 ms 10436 KB Output is correct
4 Correct 48 ms 10476 KB Output is correct
5 Correct 41 ms 10388 KB Output is correct
6 Correct 42 ms 11032 KB Output is correct
7 Correct 38 ms 10696 KB Output is correct
8 Correct 35 ms 10312 KB Output is correct
9 Correct 45 ms 10348 KB Output is correct
10 Correct 95 ms 10572 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 15 ms 9428 KB Output is correct
13 Correct 16 ms 9552 KB Output is correct
14 Correct 36 ms 9412 KB Output is correct
15 Correct 15 ms 9548 KB Output is correct
16 Correct 18 ms 9528 KB Output is correct
17 Correct 18 ms 9304 KB Output is correct
18 Correct 21 ms 9556 KB Output is correct
19 Correct 15 ms 9420 KB Output is correct
20 Incorrect 9 ms 4940 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4988 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 4 ms 4940 KB Output is correct
8 Correct 5 ms 4948 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 5 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4944 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 4 ms 4952 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 4 ms 5008 KB Output is correct
24 Correct 5 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 4 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 5 ms 5196 KB Output is correct
29 Correct 5 ms 5080 KB Output is correct
30 Correct 4 ms 5068 KB Output is correct
31 Correct 15 ms 5196 KB Output is correct
32 Correct 11 ms 5068 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 5 ms 5196 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 4 ms 4940 KB Output is correct
40 Correct 3 ms 4940 KB Output is correct
41 Correct 3 ms 4940 KB Output is correct
42 Correct 3 ms 5040 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 3 ms 4940 KB Output is correct
46 Correct 3 ms 4940 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 9 ms 4960 KB Output is correct
50 Correct 3 ms 5012 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Incorrect 3 ms 4940 KB Output isn't correct
53 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 21040 KB Output is correct
2 Correct 83 ms 20280 KB Output is correct
3 Correct 45 ms 19540 KB Output is correct
4 Correct 11 ms 7340 KB Output is correct
5 Correct 8 ms 6092 KB Output is correct
6 Correct 19 ms 8524 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 34 ms 11508 KB Output is correct
9 Correct 46 ms 16372 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 95 ms 16068 KB Output is correct
12 Correct 77 ms 18604 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4988 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 5 ms 4948 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 5 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 3 ms 4944 KB Output is correct
30 Correct 3 ms 4944 KB Output is correct
31 Correct 4 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 4 ms 4952 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 4 ms 5008 KB Output is correct
37 Correct 5 ms 4940 KB Output is correct
38 Correct 4 ms 4940 KB Output is correct
39 Correct 72 ms 21120 KB Output is correct
40 Correct 86 ms 20292 KB Output is correct
41 Correct 52 ms 19520 KB Output is correct
42 Correct 13 ms 7352 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 5 ms 4940 KB Output is correct
45 Correct 3 ms 4940 KB Output is correct
46 Correct 3 ms 5036 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 4 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 3 ms 4940 KB Output is correct
53 Correct 4 ms 4940 KB Output is correct
54 Correct 3 ms 4940 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 98 ms 11464 KB Output is correct
58 Correct 143 ms 11564 KB Output is correct
59 Correct 99 ms 11528 KB Output is correct
60 Correct 92 ms 11472 KB Output is correct
61 Correct 92 ms 11284 KB Output is correct
62 Correct 94 ms 11392 KB Output is correct
63 Correct 86 ms 11212 KB Output is correct
64 Correct 109 ms 11200 KB Output is correct
65 Correct 154 ms 11192 KB Output is correct
66 Correct 86 ms 11200 KB Output is correct
67 Correct 114 ms 11600 KB Output is correct
68 Correct 133 ms 11556 KB Output is correct
69 Correct 148 ms 11544 KB Output is correct
70 Correct 128 ms 11580 KB Output is correct
71 Correct 3 ms 4940 KB Output is correct
72 Correct 5 ms 5196 KB Output is correct
73 Correct 4 ms 5196 KB Output is correct
74 Correct 17 ms 5196 KB Output is correct
75 Correct 6 ms 5196 KB Output is correct
76 Correct 4 ms 5196 KB Output is correct
77 Correct 6 ms 5156 KB Output is correct
78 Correct 6 ms 5196 KB Output is correct
79 Correct 5 ms 5196 KB Output is correct
80 Correct 150 ms 11488 KB Output is correct
81 Correct 110 ms 11592 KB Output is correct
82 Correct 86 ms 11332 KB Output is correct
83 Correct 120 ms 11404 KB Output is correct
84 Correct 5 ms 5196 KB Output is correct
85 Correct 4 ms 5196 KB Output is correct
86 Correct 15 ms 5160 KB Output is correct
87 Correct 15 ms 5212 KB Output is correct
88 Correct 7 ms 5196 KB Output is correct
89 Correct 6 ms 5196 KB Output is correct
90 Correct 5 ms 5196 KB Output is correct
91 Correct 5 ms 5196 KB Output is correct
92 Correct 7 ms 5196 KB Output is correct
93 Correct 6 ms 5196 KB Output is correct
94 Correct 3 ms 4940 KB Output is correct
95 Correct 3 ms 4940 KB Output is correct
96 Correct 3 ms 4940 KB Output is correct
97 Correct 3 ms 4940 KB Output is correct
98 Correct 3 ms 4940 KB Output is correct
99 Correct 3 ms 4940 KB Output is correct
100 Correct 3 ms 4940 KB Output is correct
101 Correct 3 ms 4940 KB Output is correct
102 Correct 3 ms 4940 KB Output is correct
103 Correct 3 ms 4940 KB Output is correct
104 Correct 10 ms 6092 KB Output is correct
105 Correct 19 ms 8492 KB Output is correct
106 Correct 3 ms 5068 KB Output is correct
107 Correct 48 ms 11420 KB Output is correct
108 Correct 46 ms 16344 KB Output is correct
109 Correct 3 ms 5068 KB Output is correct
110 Correct 65 ms 16140 KB Output is correct
111 Correct 135 ms 18620 KB Output is correct
112 Correct 4 ms 5068 KB Output is correct
113 Correct 129 ms 32156 KB Output is correct
114 Correct 45 ms 10444 KB Output is correct
115 Correct 38 ms 10460 KB Output is correct
116 Correct 74 ms 10436 KB Output is correct
117 Correct 48 ms 10476 KB Output is correct
118 Correct 41 ms 10388 KB Output is correct
119 Correct 42 ms 11032 KB Output is correct
120 Correct 38 ms 10696 KB Output is correct
121 Correct 35 ms 10312 KB Output is correct
122 Correct 45 ms 10348 KB Output is correct
123 Correct 95 ms 10572 KB Output is correct
124 Correct 3 ms 4940 KB Output is correct
125 Correct 15 ms 9428 KB Output is correct
126 Correct 16 ms 9552 KB Output is correct
127 Correct 36 ms 9412 KB Output is correct
128 Correct 15 ms 9548 KB Output is correct
129 Correct 18 ms 9528 KB Output is correct
130 Correct 18 ms 9304 KB Output is correct
131 Correct 21 ms 9556 KB Output is correct
132 Correct 15 ms 9420 KB Output is correct
133 Incorrect 9 ms 4940 KB Output isn't correct
134 Halted 0 ms 0 KB -