답안 #225780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225780 2020-04-21T15:03:37 Z Blerargh Lost in the cycle (IOI19_cycle) C++17
0 / 100
4 ms 384 KB
#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<ld,ld> id;
typedef tuple<ll,ll,ll> tl;
typedef tuple<ll,ll,ll,ll> ql;
 
#define FOR(i, a, b) for(ll i=(a); i<=(b); i++)
#define ROF(i, a, b) for(ll i=(a); i>=(b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
#define FILL(x, n, v) fill(x, x+n, v);
#define ALL(x) x.begin(), x.end()
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 
#define f first
#define s second
#define ins insert
#define e emplace
#define eb emplace_back
#define ef emplace_front
#define p push
#define pf push_front
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ft front
#define bk back
#define pp pop
#define ppb pop_back
#define ppf pop_front
 
#define db cout<<"YEET\n";
#define ct(x) cout<<x<<'\n';
 
const ll MOD = 1e9+7; //998244353
const ll MAXN = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
 
void escape(int n){
  bool chk;
  ll half = n/2;
  if (!jump(half)){
    chk = jump(n-half);
  }
  
  ll l=0, r=half, prevjump=n;
  while (l<r){
    ll mid = (l+r)/2;
    if (jump(mid+n-prevjump)) l=mid;
    else  r=mid-1;
    prevjump = mid;
  }
  chk = jump(l+n-prevjump);
  return;
}

Compilation message

cycle.cpp: In function 'void escape(int)':
cycle.cpp:46:8: warning: variable 'chk' set but not used [-Wunused-but-set-variable]
   bool chk;
        ^~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB Invalid argument.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB Invalid argument.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB Invalid argument.
2 Halted 0 ms 0 KB -