oj.uz

Submission #371193

# Submission time Handle Problem Language Result Execution time Memory
371193 2021-02-26T04:36:39 Z evn Lost in the cycle (IOI19_cycle) C++14
0 / 100
 1 ms 512 KB 
#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void escape(int n){
	int lo = 0;
	int hi = n-1;
	while(lo < hi){
		int mid = (lo+hi+1)/2;
		if(jump(mid)){
			lo = mid;
			if(lo != hi){
				jump(n-mid);
			}
		}
		else{
			hi = mid-1;
			if(lo != hi){
				jump(n-mid);
			}
		}
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB The exit was not found.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB The exit was not found.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB The exit was not found.
2 Halted 0 ms 0 KB -