oj.uz

답안 #90608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90608 2018-12-22T21:06:54 Z Milki Nizovi (COI14_nizovi) C++14
10 / 100
 159 ms 712 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 1e3 + 5;

int a, b;
int sol[MAXN];

int cmp(int x, int y){
  cout << "cmp" _ x _ y << endl;
  fflush(stdout);
  int ret; cin >> ret;
  return ret;
}

void rev(int x, int y){
  if(x == y) return;
  cout << "reverse" _ x _ y << endl;
  fflush(stdout);
}

int main(){
  cin >> a >> b;

  REP(i, a){
    int lo = a, hi = a + b;
    while(lo < hi){
      int mid = (lo + hi + 1) >> 1;
      int ans = cmp(i + 1, mid);

      if(ans <= 0)
        hi = mid - 1;
      else
        lo = mid;
    }
    sol[i] = lo;
  }
  int start = 1, len = a + 1;
  REP(i, a){
    len --;
    if(i && sol[i] == sol[i - 1] ) continue;
    if(sol[i] == a) continue;

    rev(start, sol[i]);
    rev(sol[i] - len + 1, sol[i]);
    rev(start, sol[i] - len);
    start = sol[i] - len + 2;
  }

  cout << "end";
  fflush(stdout);
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Incorrect
2 Incorrect 5 ms 452 KB Incorrect
3 Incorrect 5 ms 452 KB Incorrect
4 Incorrect 39 ms 452 KB Incorrect
5 Incorrect 18 ms 712 KB Incorrect
6 Incorrect 50 ms 712 KB Incorrect
7 Incorrect 126 ms 712 KB Incorrect
8 Incorrect 159 ms 712 KB Incorrect
9 Correct 61 ms 712 KB Output is correct
10 Incorrect 127 ms 712 KB Incorrect