oj.uz

Submission #145277

# Submission time Handle Problem Language Result Execution time Memory
145277 2019-08-19T13:00:26 Z beso123 Lost in the cycle (IOI19_cycle) C++14
11 / 100
 2 ms 404 KB 
#include<bits/stdc++.h>
#include "cycle.h"
using namespace std;
int p=1,n=10;
/*bool jump(int x) {

	p = (p + x) % n;
	 cout<<p<<endl;
	return (n - p) % n <= n / 2;
}*/
void escape(int n){
 int l=0,r=0;
 if(jump(0)){
    l=0;
    r=n/2;
 }
 else{
  l=n/2+1;
  r=n-1;
 }
 int h=0;
 while(r-l>1){
    int mid=((l+r)/2); 
       jump(h);
    h=n-(l+r)/2;

    if(jump(mid))
        l=(l+r)/2;
    else
        r=(l+r)/2;
 }
 jump(h);
if(jump(r))
return;
h=n-r;
jump(h);
jump(l);
return;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 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 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 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 376 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 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 248 KB Output is correct
27 Correct 2 ms 248 KB Output is correct
28 Correct 2 ms 248 KB Output is correct
29 Correct 2 ms 248 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Incorrect 2 ms 376 KB Too many queries
10 Halted 0 ms 0 KB -

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 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 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 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 376 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 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 248 KB Output is correct
27 Correct 2 ms 248 KB Output is correct
28 Correct 2 ms 248 KB Output is correct
29 Correct 2 ms 248 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 248 KB Output is correct
38 Incorrect 2 ms 376 KB Too many queries
39 Halted 0 ms 0 KB -