oj.uz

답안 #145469

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145469 2019-08-20T04:16:39 Z qkxwsm Lost in the cycle (IOI19_cycle) C++14
100 / 100
 3 ms 380 KB 
#include "cycle.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N;

void solve(int L, int R)
{
	if (L > R) R += N;
	if (L == R)
	{
		if (L != 0) jump(N - L);
		return;
	}
	int mid = ((L + R + 1) >> 1) % N, d = (2 * N + 1 - mid) % N;
	// cerr << "d = " << d << endl;
	if (jump(d)) R = mid - 1;
	else L = mid;
	L += (d);
	R += (d);
	L %= N; R %= N;
	// cerr << "HI " << L << ' ' << R << endl;
	solve(L, R);
}
void escape(int n)
{
	N = n;
	jump(N - 1);
	solve(0, N - 1);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 296 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 248 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 248 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 248 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 244 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 248 KB Output is correct

Subtask #3
56.0 / 56.0

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