oj.uz

답안 #410210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410210 2021-05-22T09:33:00 Z kaage 자매 도시 (APIO20_swap) C++17
100 / 100
 307 ms 17732 KB 
#line 1 "swap.h"
#include <vector>

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W);

int getMinimumFuelCapacity(int X, int Y);
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#ifndef __clang__
#ifdef ONLINE_JUDGE
#pragma GCC target("avx512f")
#elif defined EVAL
#else
#pragma GCC target("avx2")
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#line 41 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define REP(i, n) for (int i = 1; i <= int(n); i++)
#define all(V) V.begin(), V.end()

using i128 = __int128_t;
using u128 = __uint128_t;
using uint = unsigned int;
using lint = long long;
using ulint = unsigned long long;
using IP = std::pair<int, int>;
using LP = std::pair<lint, lint>;

constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;

template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
int popcount(uint x) {
#if __cplusplus >= 202002L
	return std::popcount(x);
#else
#ifndef __clang__
	return __builtin_popcount(x);
#endif
#endif
	x = (x & 0x55555555) + (x >> 1 & 0x55555555);
	x = (x & 0x33333333) + (x >> 2 & 0x33333333);
	x = (x & 0x0f0f0f0f) + (x >> 4 & 0x0f0f0f0f);
	x = (x & 0x00ff00ff) + (x >> 8 & 0x00ff00ff);
	return (x & 0x0000ffff) + (x >> 16 & 0x0000ffff);
}
template <class F>
inline constexpr decltype(auto) lambda_fix(F&& f) {
	return [f = std::forward<F>(f)](auto&&... args) {
		return f(f, std::forward<decltype(args)>(args)...);
	};
}
template <class T>
constexpr std::vector<T> make_vec(size_t n) {
	return std::vector<T>(n);
}
template <class T, class... Args>
constexpr auto make_vec(size_t n, Args&&... args) {
	return std::vector<decltype(make_vec<T>(args...))>(
		n, make_vec<T>(std::forward<Args>(args)...));
}
template <class T, class U>
std::istream& operator>>(std::istream& ist, std::pair<T, U>& x) {
	return ist >> x.first >> x.second;
}
template <class T, class U>
std::ostream& operator<<(std::ostream& ost, const std::pair<T, U>& x) {
	return ost << x.first << " " << x.second;
}
template <class T, class U>
constexpr inline bool chmax(T& lhs, const U& rhs) noexcept {
	if (lhs < rhs) {
		lhs = rhs;
		return true;
	}
	return false;
}
template <class T, class U>
constexpr inline bool chmin(T& lhs, const U& rhs) noexcept {
	if (lhs > rhs) {
		lhs = rhs;
		return true;
	}
	return false;
}
constexpr inline lint gcd(lint a, lint b) noexcept {
	while (b) {
		lint c = a;
		a = b;
		b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) noexcept { return a / gcd(a, b) * b; }
constexpr bool isprime(lint n) noexcept {
	if (n == 1) return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}
template <class T>
constexpr T mypow(T a, lint b) noexcept {
	T res(1);
	while (true) {
		if (b & 1) res *= a;
		b >>= 1;
		if (!b) break;
		a *= a;
	}
	return res;
}
constexpr lint modpow(lint a, lint b, lint m) noexcept {
	a %= m;
	lint res(1);
	while (b) {
		if (b & 1) {
			res *= a;
			res %= m;
		}
		a *= a;
		a %= m;
		b >>= 1;
	}
	return res;
}
template <class T>
constexpr void printArray(const std::vector<T>& vec, char split = ' ') {
	rep(i, vec.size()) {
		std::cout << vec[i];
		std::cout << (i == (int)vec.size() - 1 ? '\n' : split);
	}
}
template <class InputIter>
constexpr void printArray(InputIter l, InputIter r, char split = ' ') {
	auto rprev = std::prev(r);
	for (auto i = l; i != r; i++) {
		std::cout << *i;
		std::cout << (i == rprev ? '\n' : split);
	}
}
LP extGcd(lint a, lint b) noexcept {
	if (b == 0) return {1, 0};
	LP s = extGcd(b, a % b);
	std::swap(s.first, s.second);
	s.second -= a / b * s.first;
	return s;
}
LP ChineseRem(const lint& b1, const lint& m1, const lint& b2,
			  const lint& m2) noexcept {
	auto p = extGcd(m1, m2);
	lint g = gcd(m1, m2), l = m1 / g * m2;
	lint tmp = (b2 - b1) / g * p.first % (m2 / g);
	lint r = (b1 + m1 * tmp + l) % l;
	return {r, l};
}
int LCS(const std::string& a, const std::string& b) {
	auto dp = make_vec<int>(a.size() + 1, b.size() + 1);
	rep(i, a.size()) {
		rep(j, b.size()) {
			chmax(dp[i + 1][j], dp[i][j]);
			chmax(dp[i][j + 1], dp[i][j]);
			if (a[i] == b[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1);
		}
		chmax(dp[i + 1][b.size()], dp[i][b.size()]);
	}
	rep(j, b.size()) chmax(dp[a.size()][j + 1], dp[a.size()][j]);
	return dp[a.size()][b.size()];
}
template <class T, std::enable_if_t<std::is_convertible<int, T>::value,
									std::nullptr_t> = nullptr>
void compress(std::vector<T>& vec) {
	auto tmp = vec;
	std::sort(all(tmp));
	tmp.erase(std::unique(all(tmp)), tmp.end());
	for (T& i : vec) i = std::lower_bound(all(tmp), i) - tmp.begin();
}
template <class T>
void compress(T* l, T* r) {
	std::vector<T> tmp(l, r);
	std::sort(all(tmp));
	tmp.erase(std::unique(all(tmp)), tmp.end());
	for (auto i = l; i < r; i++) {
		*i = std::lower_bound(all(tmp), *i) - tmp.begin();
	}
}
template <class InputIter>
void compress(InputIter l, InputIter r) {
	std::vector<typename InputIter::value_type> tmp(l, r);
	std::sort(all(tmp));
	tmp.erase(std::unique(all(tmp)), tmp.end());
	for (auto i = l; i < r; i++) {
		*i = std::lower_bound(all(tmp), *i) - tmp.begin();
	}
}
#line 3 "swap.cpp"
class PersistentUnionFind {
	std::vector<IP> notparent;
	std::vector<std::vector<std::pair<int, int>>> sizevec;
	std::vector<int> ok_vec;
	int opcount = 0;

  public:
	PersistentUnionFind(unsigned int size) {
		notparent.resize(size);
		sizevec.resize(size);
		ok_vec.resize(size, INF);
		rep(i, size) {
			sizevec[i].push_back(std::make_pair(-1, 1));
			notparent[i] = std::make_pair(INF, i);
		}
	}
	int find(int n, int t = INF) {
		if (t < notparent[n].first || notparent[n].second == n) return n;
		return find(notparent[n].second, t);
	}
	void unite(int n, int m, bool f = false) {
		n = find(n), m = find(m);
		if (n == m) {
			if (f && ok_vec[n] == INF) ok_vec[n] = opcount;
			opcount++;
			return;
		}
		if (sizevec[n].back().second > sizevec[m].back().second)
			std::swap(n, m);
		notparent[n] = {opcount, m};
		if (ok_vec[m] == INF && (f || ok_vec[n] != INF)) ok_vec[m] = opcount;
		sizevec[m].emplace_back(
			opcount, sizevec[m].back().second + sizevec[n].back().second);

		opcount++;
	}
	bool same(int n, int m, int t = INF) { return find(n, t) == find(m, t); }
	bool ok(int x, int t = INF - 1) { return ok_vec[x] <= t; }
	int get_opcount() { return opcount; }
};

int N, M;
std::vector<std::pair<int, IP>> edges;
std::vector<int> avail_edges;
PersistentUnionFind uf(100010);

void init(int n, int m, std::vector<int> U, std::vector<int> V,
		  std::vector<int> W) {
	N = n, M = m;
	edges.reserve(M);
	rep(i, M) edges.push_back({W[i], {U[i], V[i]}});
	std::sort(all(edges));
	std::vector<int> degree(N);
	rep(i, M) {
		degree[edges[i].second.first]++;
		degree[edges[i].second.second]++;
		int X = uf.find(edges[i].second.first),
			Y = uf.find(edges[i].second.second);
		if (X == Y) {
			if (!uf.ok(X)) {
				uf.unite(X, Y, true);
				avail_edges.emplace_back(i);
			}
		} else {
			uf.unite(X, Y,
					 degree[edges[i].second.first] >= 3 ||
						 degree[edges[i].second.second] >= 3);
			avail_edges.emplace_back(i);
		}
	}
}

int getMinimumFuelCapacity(int X, int Y) {
	int min = -1, max = avail_edges.size();
	while (min + 1 < max) {
		int mid = (min + max) / 2;
		int root_x = uf.find(X, mid), root_y = uf.find(Y, mid);
		if (root_x != root_y)
			min = mid;
		else if (uf.ok(root_x, mid))
			max = mid;
		else
			min = mid;
	}
	if (max != M) return edges[avail_edges[max]].first;
	return -1;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6988 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6972 KB Output is correct
7 Correct 11 ms 6988 KB Output is correct
8 Correct 10 ms 6988 KB Output is correct
9 Correct 59 ms 11380 KB Output is correct
10 Correct 72 ms 12476 KB Output is correct
11 Correct 70 ms 12292 KB Output is correct
12 Correct 91 ms 12592 KB Output is correct
13 Correct 67 ms 12300 KB Output is correct
14 Correct 74 ms 11584 KB Output is correct
15 Correct 231 ms 14016 KB Output is correct
16 Correct 275 ms 13928 KB Output is correct
17 Correct 243 ms 14268 KB Output is correct
18 Correct 153 ms 13692 KB Output is correct
19 Correct 155 ms 11340 KB Output is correct
20 Correct 230 ms 15024 KB Output is correct
21 Correct 241 ms 15160 KB Output is correct
22 Correct 246 ms 15516 KB Output is correct
23 Correct 180 ms 15120 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 165 ms 14832 KB Output is correct
4 Correct 165 ms 14996 KB Output is correct
5 Correct 166 ms 15196 KB Output is correct
6 Correct 160 ms 14876 KB Output is correct
7 Correct 176 ms 15152 KB Output is correct
8 Correct 162 ms 14892 KB Output is correct
9 Correct 166 ms 14908 KB Output is correct
10 Correct 164 ms 14876 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6988 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6972 KB Output is correct
7 Correct 11 ms 6988 KB Output is correct
8 Correct 10 ms 6988 KB Output is correct
9 Correct 10 ms 6860 KB Output is correct
10 Correct 12 ms 6920 KB Output is correct
11 Correct 9 ms 6924 KB Output is correct
12 Correct 9 ms 6988 KB Output is correct
13 Correct 9 ms 6904 KB Output is correct
14 Correct 9 ms 6988 KB Output is correct
15 Correct 9 ms 6988 KB Output is correct
16 Correct 9 ms 6988 KB Output is correct
17 Correct 10 ms 6988 KB Output is correct
18 Correct 9 ms 6988 KB Output is correct
19 Correct 10 ms 6988 KB Output is correct
20 Correct 9 ms 6972 KB Output is correct
21 Correct 11 ms 6988 KB Output is correct
22 Correct 9 ms 6988 KB Output is correct
23 Correct 9 ms 6988 KB Output is correct
24 Correct 9 ms 6952 KB Output is correct
25 Correct 9 ms 6988 KB Output is correct
26 Correct 9 ms 6988 KB Output is correct
27 Correct 10 ms 6988 KB Output is correct
28 Correct 9 ms 6988 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6860 KB Output is correct
5 Correct 8 ms 6988 KB Output is correct
6 Correct 9 ms 6988 KB Output is correct
7 Correct 9 ms 6972 KB Output is correct
8 Correct 11 ms 6988 KB Output is correct
9 Correct 10 ms 6988 KB Output is correct
10 Correct 59 ms 11380 KB Output is correct
11 Correct 72 ms 12476 KB Output is correct
12 Correct 70 ms 12292 KB Output is correct
13 Correct 91 ms 12592 KB Output is correct
14 Correct 67 ms 12300 KB Output is correct
15 Correct 12 ms 6920 KB Output is correct
16 Correct 9 ms 6924 KB Output is correct
17 Correct 9 ms 6988 KB Output is correct
18 Correct 9 ms 6904 KB Output is correct
19 Correct 9 ms 6988 KB Output is correct
20 Correct 9 ms 6988 KB Output is correct
21 Correct 9 ms 6988 KB Output is correct
22 Correct 10 ms 6988 KB Output is correct
23 Correct 9 ms 6988 KB Output is correct
24 Correct 10 ms 6988 KB Output is correct
25 Correct 9 ms 6972 KB Output is correct
26 Correct 11 ms 6988 KB Output is correct
27 Correct 9 ms 6988 KB Output is correct
28 Correct 9 ms 6988 KB Output is correct
29 Correct 9 ms 6952 KB Output is correct
30 Correct 9 ms 6988 KB Output is correct
31 Correct 9 ms 6988 KB Output is correct
32 Correct 10 ms 6988 KB Output is correct
33 Correct 9 ms 6988 KB Output is correct
34 Correct 16 ms 7628 KB Output is correct
35 Correct 75 ms 12596 KB Output is correct
36 Correct 74 ms 12576 KB Output is correct
37 Correct 90 ms 12596 KB Output is correct
38 Correct 72 ms 12604 KB Output is correct
39 Correct 73 ms 12456 KB Output is correct
40 Correct 64 ms 11968 KB Output is correct
41 Correct 77 ms 12604 KB Output is correct
42 Correct 74 ms 12604 KB Output is correct
43 Correct 69 ms 12708 KB Output is correct
44 Correct 87 ms 12472 KB Output is correct
45 Correct 93 ms 13760 KB Output is correct
46 Correct 74 ms 12584 KB Output is correct
47 Correct 73 ms 12600 KB Output is correct
48 Correct 78 ms 12732 KB Output is correct
49 Correct 82 ms 12524 KB Output is correct
50 Correct 66 ms 11308 KB Output is correct
51 Correct 88 ms 12804 KB Output is correct
52 Correct 109 ms 14848 KB Output is correct
53 Correct 127 ms 16180 KB Output is correct
54 Correct 131 ms 16220 KB Output is correct
55 Correct 65 ms 12324 KB Output is correct
56 Correct 110 ms 14988 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6988 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6972 KB Output is correct
7 Correct 11 ms 6988 KB Output is correct
8 Correct 10 ms 6988 KB Output is correct
9 Correct 59 ms 11380 KB Output is correct
10 Correct 72 ms 12476 KB Output is correct
11 Correct 70 ms 12292 KB Output is correct
12 Correct 91 ms 12592 KB Output is correct
13 Correct 67 ms 12300 KB Output is correct
14 Correct 74 ms 11584 KB Output is correct
15 Correct 231 ms 14016 KB Output is correct
16 Correct 275 ms 13928 KB Output is correct
17 Correct 243 ms 14268 KB Output is correct
18 Correct 153 ms 13692 KB Output is correct
19 Correct 165 ms 14832 KB Output is correct
20 Correct 165 ms 14996 KB Output is correct
21 Correct 166 ms 15196 KB Output is correct
22 Correct 160 ms 14876 KB Output is correct
23 Correct 176 ms 15152 KB Output is correct
24 Correct 162 ms 14892 KB Output is correct
25 Correct 166 ms 14908 KB Output is correct
26 Correct 164 ms 14876 KB Output is correct
27 Correct 12 ms 6920 KB Output is correct
28 Correct 9 ms 6924 KB Output is correct
29 Correct 9 ms 6988 KB Output is correct
30 Correct 9 ms 6904 KB Output is correct
31 Correct 9 ms 6988 KB Output is correct
32 Correct 9 ms 6988 KB Output is correct
33 Correct 9 ms 6988 KB Output is correct
34 Correct 10 ms 6988 KB Output is correct
35 Correct 9 ms 6988 KB Output is correct
36 Correct 16 ms 7628 KB Output is correct
37 Correct 75 ms 12596 KB Output is correct
38 Correct 74 ms 12576 KB Output is correct
39 Correct 90 ms 12596 KB Output is correct
40 Correct 72 ms 12604 KB Output is correct
41 Correct 73 ms 12456 KB Output is correct
42 Correct 64 ms 11968 KB Output is correct
43 Correct 77 ms 12604 KB Output is correct
44 Correct 74 ms 12604 KB Output is correct
45 Correct 69 ms 12708 KB Output is correct
46 Correct 87 ms 12472 KB Output is correct
47 Correct 37 ms 7952 KB Output is correct
48 Correct 241 ms 14896 KB Output is correct
49 Correct 234 ms 14872 KB Output is correct
50 Correct 241 ms 14904 KB Output is correct
51 Correct 241 ms 14772 KB Output is correct
52 Correct 225 ms 14504 KB Output is correct
53 Correct 198 ms 13868 KB Output is correct
54 Correct 244 ms 15420 KB Output is correct
55 Correct 238 ms 14876 KB Output is correct
56 Correct 165 ms 14468 KB Output is correct
57 Correct 234 ms 15396 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6860 KB Output is correct
2 Correct 8 ms 6860 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6860 KB Output is correct
5 Correct 8 ms 6988 KB Output is correct
6 Correct 9 ms 6988 KB Output is correct
7 Correct 9 ms 6972 KB Output is correct
8 Correct 11 ms 6988 KB Output is correct
9 Correct 10 ms 6988 KB Output is correct
10 Correct 59 ms 11380 KB Output is correct
11 Correct 72 ms 12476 KB Output is correct
12 Correct 70 ms 12292 KB Output is correct
13 Correct 91 ms 12592 KB Output is correct
14 Correct 67 ms 12300 KB Output is correct
15 Correct 74 ms 11584 KB Output is correct
16 Correct 231 ms 14016 KB Output is correct
17 Correct 275 ms 13928 KB Output is correct
18 Correct 243 ms 14268 KB Output is correct
19 Correct 153 ms 13692 KB Output is correct
20 Correct 165 ms 14832 KB Output is correct
21 Correct 165 ms 14996 KB Output is correct
22 Correct 166 ms 15196 KB Output is correct
23 Correct 160 ms 14876 KB Output is correct
24 Correct 176 ms 15152 KB Output is correct
25 Correct 162 ms 14892 KB Output is correct
26 Correct 166 ms 14908 KB Output is correct
27 Correct 164 ms 14876 KB Output is correct
28 Correct 12 ms 6920 KB Output is correct
29 Correct 9 ms 6924 KB Output is correct
30 Correct 9 ms 6988 KB Output is correct
31 Correct 9 ms 6904 KB Output is correct
32 Correct 9 ms 6988 KB Output is correct
33 Correct 9 ms 6988 KB Output is correct
34 Correct 9 ms 6988 KB Output is correct
35 Correct 10 ms 6988 KB Output is correct
36 Correct 9 ms 6988 KB Output is correct
37 Correct 16 ms 7628 KB Output is correct
38 Correct 75 ms 12596 KB Output is correct
39 Correct 74 ms 12576 KB Output is correct
40 Correct 90 ms 12596 KB Output is correct
41 Correct 72 ms 12604 KB Output is correct
42 Correct 73 ms 12456 KB Output is correct
43 Correct 64 ms 11968 KB Output is correct
44 Correct 77 ms 12604 KB Output is correct
45 Correct 74 ms 12604 KB Output is correct
46 Correct 69 ms 12708 KB Output is correct
47 Correct 87 ms 12472 KB Output is correct
48 Correct 37 ms 7952 KB Output is correct
49 Correct 241 ms 14896 KB Output is correct
50 Correct 234 ms 14872 KB Output is correct
51 Correct 241 ms 14904 KB Output is correct
52 Correct 241 ms 14772 KB Output is correct
53 Correct 225 ms 14504 KB Output is correct
54 Correct 198 ms 13868 KB Output is correct
55 Correct 244 ms 15420 KB Output is correct
56 Correct 238 ms 14876 KB Output is correct
57 Correct 165 ms 14468 KB Output is correct
58 Correct 234 ms 15396 KB Output is correct
59 Correct 155 ms 11340 KB Output is correct
60 Correct 230 ms 15024 KB Output is correct
61 Correct 241 ms 15160 KB Output is correct
62 Correct 246 ms 15516 KB Output is correct
63 Correct 180 ms 15120 KB Output is correct
64 Correct 10 ms 6988 KB Output is correct
65 Correct 9 ms 6972 KB Output is correct
66 Correct 11 ms 6988 KB Output is correct
67 Correct 9 ms 6988 KB Output is correct
68 Correct 9 ms 6988 KB Output is correct
69 Correct 9 ms 6952 KB Output is correct
70 Correct 9 ms 6988 KB Output is correct
71 Correct 9 ms 6988 KB Output is correct
72 Correct 10 ms 6988 KB Output is correct
73 Correct 9 ms 6988 KB Output is correct
74 Correct 93 ms 13760 KB Output is correct
75 Correct 74 ms 12584 KB Output is correct
76 Correct 73 ms 12600 KB Output is correct
77 Correct 78 ms 12732 KB Output is correct
78 Correct 82 ms 12524 KB Output is correct
79 Correct 66 ms 11308 KB Output is correct
80 Correct 88 ms 12804 KB Output is correct
81 Correct 109 ms 14848 KB Output is correct
82 Correct 127 ms 16180 KB Output is correct
83 Correct 131 ms 16220 KB Output is correct
84 Correct 65 ms 12324 KB Output is correct
85 Correct 110 ms 14988 KB Output is correct
86 Correct 67 ms 9900 KB Output is correct
87 Correct 286 ms 14856 KB Output is correct
88 Correct 235 ms 14876 KB Output is correct
89 Correct 209 ms 14652 KB Output is correct
90 Correct 192 ms 14884 KB Output is correct
91 Correct 197 ms 14912 KB Output is correct
92 Correct 219 ms 15244 KB Output is correct
93 Correct 278 ms 16932 KB Output is correct
94 Correct 272 ms 17424 KB Output is correct
95 Correct 307 ms 17732 KB Output is correct
96 Correct 169 ms 14544 KB Output is correct
97 Correct 233 ms 16140 KB Output is correct