답안 #226241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
226241	2020-04-23T07:37:52 Z	kym	Lost in the cycle (IOI19_cycle)	C++17	100 / 100	6 ms	384 KB

cycle

#include "cycle.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define testing 1
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = -1;
#if !testing
#define cerr if(0)cout
#endif
int msb(unsigned int x) {
	return 31-__builtin_clz(x);
}

void escape(int n) {
	int lag = 0;
	for(int i = msb(n);i>=0;--i) {
		if((1<<i)+lag==n)continue;
		bool res = jump((1<<i)+lag);
		lag = 0;
		if(!res) {
			lag += n - (1<<i);
		}
	}
	if(lag) {
		jump(lag);
	}
	
}

Subtask #1
11.0 / 11.0

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

Subtask #2
33.0 / 33.0

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

Subtask #3
56.0 / 56.0

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

답안 #226241

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 33.0 / 33.0

Subtask #3 56.0 / 56.0

Subtask #1
11.0 / 11.0

Subtask #2
33.0 / 33.0

Subtask #3
56.0 / 56.0