oj.uz

답안 #777636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777636 2023-07-09T11:41:28 Z marvinthang IOI 바이러스 (JOI21_fever) C++17
100 / 100
 3541 ms 78644 KB 
/*************************************
*    author: marvinthang             *
*    created: 09.07.2023 15:47:28    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const long long INF = 1e18;
const int MAX = 1e5 + 5;

int N, X[MAX], Y[MAX];

void init(void) {
	cin >> N;
	REP(i, N) cin >> X[i] >> Y[i];
	REPD(i, N) X[i] -= X[0], Y[i] -= Y[0];
}

int dir[MAX];

bool inter(int u, int v) {
	if (dir[u] == dir[v]) return false;
	if ((dir[u] ^ dir[v]) == 2) {
		if (BIT(dir[u], 0)) {
			if (Y[u] != Y[v]) return false;
			return dir[u] == 1 ? X[u] <= X[v] : X[u] >= X[v];
		}
		if (X[u] != X[v]) return false;
		return dir[u] ? Y[u] >= Y[v] : Y[u] <= Y[v];
	}
	if ((dir[u] ^ dir[v]) == 1) {
		if (X[u] + Y[u] != X[v] + Y[v]) return false;
		return X[u] > X[v] ? dir[u] == 0 || dir[u] == 3 : dir[v] == 0 || dir[v] == 3;
	}
	if (X[u] - Y[u] != X[v] - Y[v]) return false;
	return X[u] > X[v] ? dir[u] == 2 || dir[u] == 3 : dir[v] == 2 || dir[v] == 3;
}

long long dist[MAX][3];
bool visited[MAX];

vector <int> tadj[MAX][3];

int get_dist(int x, int y) {
	return abs(X[x] - X[y]) + abs(Y[x] - Y[y]);
}

void process(void) {
	int res = 0;
	REP(rt, 4) {
		dir[0] = 1;
		FOR(i, 1, N) {
			if (X[i] >= 0) {
				if (Y[i] >= 0) dir[i] = X[i] <= Y[i] ? 2 : 3;
				else dir[i] = X[i] <= -Y[i] ? 0 : 3;
			} else {
				if (Y[i] >= 0) dir[i] = -X[i] < Y[i] ? 2 : 1;
				else dir[i] = -X[i] < -Y[i] ? 0 : 1;
			}
		}
		map <int, set <pair <int, int>>> sum[4], diff[4], sx[4], sy[4];

		REP(i, N) {
			REP(j, 12) {
				dist[i][j] = INF;
				tadj[i][j].clear();
			}
			visited[i] = false;
			sum[dir[i]][X[i] + Y[i]].emplace(X[i], i);
			diff[dir[i]][X[i] - Y[i]].emplace(X[i], i);
			sx[dir[i]][X[i]].emplace(Y[i], i);
			sy[dir[i]][Y[i]].emplace(X[i], i);
			// REP(d, 4) {
			// 	sum[d][X[i] + Y[i]].emplace(-1e9, -1);
			// 	sum[d][X[i] + Y[i]].emplace(1e9, -1);
			// 	diff[d][X[i] - Y[i]].emplace(-1e9, -1);
			// 	diff[d][X[i] - Y[i]].emplace(1e9, -1);
			// 	sx[d][X[i]].emplace(-1e9, -1);
			// 	sx[d][X[i]].emplace(1e9, -1);
			// 	sy[d][Y[i]].emplace(-1e9, -1);
			// 	sy[d][Y[i]].emplace(1e9, -1);
			// }
		}
		REP(i, N) {
			int sdir = dir[i] ^ 1;
			int ddir = dir[i] ^ 3;
			int odir = dir[i] ^ 2;
			int s = X[i] + Y[i];
			int d = X[i] - Y[i];

			auto it = sum[dir[i]][s].find(make_pair(X[i], i));
			if (dir[i] == 0 || dir[i] == 3) {
				if (next(it) != sum[dir[i]][s].end()) tadj[i][0].push_back(next(it)->se);
			} else {
				if (it != sum[dir[i]][s].begin()) tadj[i][0].push_back(prev(it)->se);
			}

			it = diff[dir[i]][d].find(make_pair(X[i], i));
			if (dir[i] == 2 || dir[i] == 3) {
				if (next(it) != diff[dir[i]][d].end()) tadj[i][1].push_back(next(it)->se);
			} else {
				if (it != diff[dir[i]][d].begin()) tadj[i][1].push_back(prev(it)->se);
			}

			if (!BIT(dir[i], 0)) {
				it = sx[dir[i]][X[i]].find(make_pair(Y[i], i));
				if (dir[i] == 2) {
					if (next(it) != sx[dir[i]][X[i]].end()) tadj[i][2].push_back(next(it)->se);
				} else {
					if (it != sx[dir[i]][X[i]].begin()) tadj[i][2].push_back(prev(it)->se);
				}
			} else {
				it = sy[dir[i]][Y[i]].find(make_pair(X[i], i));
				if (dir[i] == 3) {
					if (next(it) != sy[dir[i]][Y[i]].end()) tadj[i][2].push_back(next(it)->se);
				} else {
					if (it != sy[dir[i]][Y[i]].begin()) tadj[i][2].push_back(prev(it)->se);
				}
			}
		}

		priority_queue <tuple <long long, int, int>, vector <tuple <long long, int, int>>, greater <tuple <long long, int, int>>> pq;
		pq.emplace(0, 0, -1);

		int cnt = 0;
		while (!pq.empty()) {
			auto [du, u, t] = pq.top(); pq.pop();
			if (t != -1) {
				if (dist[u][t] != du) continue;
				for (int v: tadj[u][t]) if (minimize(dist[v][t], du + get_dist(u, v))) pq.emplace(dist[v][t], v, t);
			}
			if (visited[u]) continue;
			visited[u] = true;

			vector <pair <int, int>> adj;
			int sdir = dir[u] ^ 1;
			int ddir = dir[u] ^ 3;
			int odir = dir[u] ^ 2;
			int s = X[u] + Y[u];
			int d = X[u] - Y[u];
			sum[dir[u]][X[u] + Y[u]].erase(make_pair(X[u], u));
			diff[dir[u]][X[u] - Y[u]].erase(make_pair(X[u], u));
			sx[dir[u]][X[u]].erase(make_pair(Y[u], u));
			sy[dir[u]][Y[u]].erase(make_pair(X[u], u));

			set<pair <int, int>>::iterator it;

			if (dir[u] == 0 || dir[u] == 3) {
				it = sum[sdir][s].lower_bound(make_pair(X[u] - du / 2, -1));
				if (it != sum[sdir][s].begin()) adj.emplace_back(0, prev(it)->se);
			} else {
				it = sum[sdir][s].lower_bound(make_pair(X[u] + (du + 1) / 2, -1));
				if (it != sum[sdir][s].end()) adj.emplace_back(0, it->se);
			}

			if (dir[u] == 2 || dir[u] == 3) {
				it = diff[ddir][d].lower_bound(make_pair(X[u] - du / 2, -1));
				if (it != diff[ddir][d].begin()) adj.emplace_back(1, prev(it)->se);
			} else {
				it = diff[ddir][d].lower_bound(make_pair(X[u] + (du + 1) / 2, -1));
				if (it != diff[ddir][d].end()) adj.emplace_back(1, it->se);
			}

			if (!BIT(dir[u], 0)) {
				if (dir[u] == 2) {
					it = sx[odir][X[u]].lower_bound(make_pair(Y[u] - du, N));
					if (it != sx[odir][X[u]].begin()) adj.emplace_back(2, prev(it)->se);
				} else {
					it = sx[odir][X[u]].lower_bound(make_pair(Y[u] + du, -1));
					if (it != sx[odir][X[u]].end()) adj.emplace_back(2, it->se);
				}
			} else {
				if (dir[u] == 3) {
					it = sy[odir][Y[u]].lower_bound(make_pair(X[u] - du, N));
					if (it != sy[odir][Y[u]].begin()) adj.emplace_back(2, prev(it)->se);
				} else {
					it = sy[odir][Y[u]].lower_bound(make_pair(X[u] + du, -1));
					if (it != sy[odir][Y[u]].end()) adj.emplace_back(2, it->se);
				}
			}

			for (auto [t, v]: adj) if (minimize(dist[v][t], get_dist(u, v))) pq.emplace(dist[v][t], v, t);
			++cnt;
		}
		maximize(res, cnt);
		REP(i, N) {
			swap(X[i], Y[i]);
			X[i] = -X[i];
		}
	}
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("fever");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

fever.cpp: In function 'void process()':
fever.cpp:124:8: warning: unused variable 'sdir' [-Wunused-variable]
  124 |    int sdir = dir[i] ^ 1;
      |        ^~~~
fever.cpp:125:8: warning: unused variable 'ddir' [-Wunused-variable]
  125 |    int ddir = dir[i] ^ 3;
      |        ^~~~
fever.cpp:126:8: warning: unused variable 'odir' [-Wunused-variable]
  126 |    int odir = dir[i] ^ 2;
      |        ^~~~
fever.cpp: In function 'int main()':
fever.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fever.cpp:235:2: note: in expansion of macro 'file'
  235 |  file("fever");
      |  ^~~~
fever.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fever.cpp:235:2: note: in expansion of macro 'file'
  235 |  file("fever");
      |  ^~~~
fever.cpp: In function 'void process()':
fever.cpp:104:16: warning: iteration 3 invokes undefined behavior [-Waggressive-loop-optimizations]
  104 |     dist[i][j] = INF;
      |     ~~~~~~~~~~~^~~~~
fever.cpp:19:58: note: within this loop
   19 | #define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
      |                                                          ^
fever.cpp:103:4: note: in expansion of macro 'REP'
  103 |    REP(j, 12) {
      |    ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 3 ms 7376 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 4 ms 7372 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7376 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7428 KB Output is correct
7 Correct 5 ms 7368 KB Output is correct
8 Correct 5 ms 7468 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 3 ms 7376 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 4 ms 7372 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7376 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct
46 Correct 4 ms 7376 KB Output is correct
47 Correct 4 ms 7380 KB Output is correct
48 Correct 3 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 5 ms 7372 KB Output is correct
51 Correct 5 ms 7428 KB Output is correct
52 Correct 5 ms 7368 KB Output is correct
53 Correct 5 ms 7468 KB Output is correct
54 Correct 4 ms 7380 KB Output is correct
55 Correct 4 ms 7380 KB Output is correct
56 Correct 4 ms 7380 KB Output is correct
57 Correct 5 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 4 ms 7372 KB Output is correct
60 Correct 4 ms 7380 KB Output is correct
61 Correct 5 ms 7380 KB Output is correct
62 Correct 4 ms 7376 KB Output is correct
63 Correct 4 ms 7380 KB Output is correct
64 Correct 5 ms 7376 KB Output is correct
65 Correct 4 ms 7380 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 3 ms 7376 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 4 ms 7372 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7376 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct
46 Correct 4 ms 7376 KB Output is correct
47 Correct 4 ms 7380 KB Output is correct
48 Correct 3 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 5 ms 7372 KB Output is correct
51 Correct 5 ms 7428 KB Output is correct
52 Correct 5 ms 7368 KB Output is correct
53 Correct 5 ms 7468 KB Output is correct
54 Correct 4 ms 7380 KB Output is correct
55 Correct 4 ms 7380 KB Output is correct
56 Correct 4 ms 7380 KB Output is correct
57 Correct 5 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 4 ms 7372 KB Output is correct
60 Correct 4 ms 7380 KB Output is correct
61 Correct 5 ms 7380 KB Output is correct
62 Correct 4 ms 7376 KB Output is correct
63 Correct 4 ms 7380 KB Output is correct
64 Correct 5 ms 7376 KB Output is correct
65 Correct 4 ms 7380 KB Output is correct
66 Correct 23 ms 9176 KB Output is correct
67 Correct 21 ms 9152 KB Output is correct
68 Correct 25 ms 9240 KB Output is correct
69 Correct 31 ms 8404 KB Output is correct
70 Correct 24 ms 8588 KB Output is correct
71 Correct 22 ms 8672 KB Output is correct
72 Correct 23 ms 9040 KB Output is correct
73 Correct 27 ms 9172 KB Output is correct
74 Correct 24 ms 9300 KB Output is correct
75 Correct 36 ms 9372 KB Output is correct
76 Correct 23 ms 9244 KB Output is correct
77 Correct 27 ms 9176 KB Output is correct
78 Correct 22 ms 9428 KB Output is correct
79 Correct 22 ms 9400 KB Output is correct
80 Correct 21 ms 9232 KB Output is correct
81 Correct 27 ms 9360 KB Output is correct
82 Correct 24 ms 9372 KB Output is correct
83 Correct 31 ms 9316 KB Output is correct
84 Correct 14 ms 8916 KB Output is correct
85 Correct 16 ms 8412 KB Output is correct
86 Correct 14 ms 8448 KB Output is correct
87 Correct 13 ms 8600 KB Output is correct
88 Correct 20 ms 9360 KB Output is correct
89 Correct 24 ms 9504 KB Output is correct
90 Correct 30 ms 9484 KB Output is correct

Subtask #6
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 3 ms 7376 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 4 ms 7372 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7376 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct
46 Correct 4 ms 7376 KB Output is correct
47 Correct 4 ms 7380 KB Output is correct
48 Correct 3 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 5 ms 7372 KB Output is correct
51 Correct 5 ms 7428 KB Output is correct
52 Correct 5 ms 7368 KB Output is correct
53 Correct 5 ms 7468 KB Output is correct
54 Correct 4 ms 7380 KB Output is correct
55 Correct 4 ms 7380 KB Output is correct
56 Correct 4 ms 7380 KB Output is correct
57 Correct 5 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 4 ms 7372 KB Output is correct
60 Correct 4 ms 7380 KB Output is correct
61 Correct 5 ms 7380 KB Output is correct
62 Correct 4 ms 7376 KB Output is correct
63 Correct 4 ms 7380 KB Output is correct
64 Correct 5 ms 7376 KB Output is correct
65 Correct 4 ms 7380 KB Output is correct
66 Correct 2032 ms 55344 KB Output is correct
67 Correct 2929 ms 67020 KB Output is correct
68 Correct 2779 ms 69240 KB Output is correct
69 Correct 2841 ms 72372 KB Output is correct
70 Correct 3411 ms 74112 KB Output is correct
71 Correct 2859 ms 69268 KB Output is correct
72 Correct 2925 ms 69080 KB Output is correct
73 Correct 2664 ms 67520 KB Output is correct
74 Correct 2739 ms 69264 KB Output is correct
75 Correct 2790 ms 70332 KB Output is correct
76 Correct 2763 ms 75576 KB Output is correct
77 Correct 2724 ms 69252 KB Output is correct
78 Correct 2901 ms 78636 KB Output is correct
79 Correct 2917 ms 78644 KB Output is correct

Subtask #7
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 3 ms 7372 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7376 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 5 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 3 ms 7380 KB Output is correct
27 Correct 5 ms 7384 KB Output is correct
28 Correct 5 ms 7368 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7372 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 3 ms 7376 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 4 ms 7372 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7376 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct
46 Correct 4 ms 7376 KB Output is correct
47 Correct 4 ms 7380 KB Output is correct
48 Correct 3 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 5 ms 7372 KB Output is correct
51 Correct 5 ms 7428 KB Output is correct
52 Correct 5 ms 7368 KB Output is correct
53 Correct 5 ms 7468 KB Output is correct
54 Correct 4 ms 7380 KB Output is correct
55 Correct 4 ms 7380 KB Output is correct
56 Correct 4 ms 7380 KB Output is correct
57 Correct 5 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 4 ms 7372 KB Output is correct
60 Correct 4 ms 7380 KB Output is correct
61 Correct 5 ms 7380 KB Output is correct
62 Correct 4 ms 7376 KB Output is correct
63 Correct 4 ms 7380 KB Output is correct
64 Correct 5 ms 7376 KB Output is correct
65 Correct 4 ms 7380 KB Output is correct
66 Correct 23 ms 9176 KB Output is correct
67 Correct 21 ms 9152 KB Output is correct
68 Correct 25 ms 9240 KB Output is correct
69 Correct 31 ms 8404 KB Output is correct
70 Correct 24 ms 8588 KB Output is correct
71 Correct 22 ms 8672 KB Output is correct
72 Correct 23 ms 9040 KB Output is correct
73 Correct 27 ms 9172 KB Output is correct
74 Correct 24 ms 9300 KB Output is correct
75 Correct 36 ms 9372 KB Output is correct
76 Correct 23 ms 9244 KB Output is correct
77 Correct 27 ms 9176 KB Output is correct
78 Correct 22 ms 9428 KB Output is correct
79 Correct 22 ms 9400 KB Output is correct
80 Correct 21 ms 9232 KB Output is correct
81 Correct 27 ms 9360 KB Output is correct
82 Correct 24 ms 9372 KB Output is correct
83 Correct 31 ms 9316 KB Output is correct
84 Correct 14 ms 8916 KB Output is correct
85 Correct 16 ms 8412 KB Output is correct
86 Correct 14 ms 8448 KB Output is correct
87 Correct 13 ms 8600 KB Output is correct
88 Correct 20 ms 9360 KB Output is correct
89 Correct 24 ms 9504 KB Output is correct
90 Correct 30 ms 9484 KB Output is correct
91 Correct 2032 ms 55344 KB Output is correct
92 Correct 2929 ms 67020 KB Output is correct
93 Correct 2779 ms 69240 KB Output is correct
94 Correct 2841 ms 72372 KB Output is correct
95 Correct 3411 ms 74112 KB Output is correct
96 Correct 2859 ms 69268 KB Output is correct
97 Correct 2925 ms 69080 KB Output is correct
98 Correct 2664 ms 67520 KB Output is correct
99 Correct 2739 ms 69264 KB Output is correct
100 Correct 2790 ms 70332 KB Output is correct
101 Correct 2763 ms 75576 KB Output is correct
102 Correct 2724 ms 69252 KB Output is correct
103 Correct 2901 ms 78636 KB Output is correct
104 Correct 2917 ms 78644 KB Output is correct
105 Correct 1448 ms 33804 KB Output is correct
106 Correct 2004 ms 40420 KB Output is correct
107 Correct 2445 ms 41476 KB Output is correct
108 Correct 2473 ms 41880 KB Output is correct
109 Correct 2100 ms 47784 KB Output is correct
110 Correct 2617 ms 62972 KB Output is correct
111 Correct 2791 ms 69240 KB Output is correct
112 Correct 2680 ms 67624 KB Output is correct
113 Correct 2831 ms 67952 KB Output is correct
114 Correct 3541 ms 57300 KB Output is correct
115 Correct 2714 ms 68448 KB Output is correct
116 Correct 2708 ms 67564 KB Output is correct
117 Correct 2710 ms 68884 KB Output is correct
118 Correct 3266 ms 66204 KB Output is correct
119 Correct 3003 ms 75580 KB Output is correct
120 Correct 2790 ms 67716 KB Output is correct
121 Correct 2750 ms 70408 KB Output is correct
122 Correct 2944 ms 71376 KB Output is correct
123 Correct 2868 ms 71928 KB Output is correct
124 Correct 2779 ms 72524 KB Output is correct
125 Correct 852 ms 56144 KB Output is correct
126 Correct 676 ms 43436 KB Output is correct
127 Correct 966 ms 41224 KB Output is correct
128 Correct 916 ms 42060 KB Output is correct
129 Correct 897 ms 50572 KB Output is correct