oj.uz

답안 #72827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72827 2018-08-27T03:54:06 Z funcsr 커다란 상품 (IOI17_prize) C++17
20 / 100
 96 ms 3792 KB 
#include "prize.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
#define rep(i,n)for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
typedef pair<int, int> P;
mt19937 mt_rand(114514);
int mp = 0;
P cache[200000];
int Q=0;
P query(int x) {
  if (cache[x] != P(-1, -1)) return cache[x];
  Q++;
  assert(Q<=10000);
  //if(Q%100==0)cout<<"Q="<<Q<<"\n";
  vector<int> ret = ask(x);
  return cache[x] = {ret[0], ret[1]};
}

int solve(int l, int r, int num, int left) {
  assert(num >= 0 && left >= 0);
  if (num == 0) return -1;
  //cout<<"solve("<<l<<","<<r<<", num="<<num<<")\n";
  int mm = (l+r)/2;
  for (int mid=mm; mid>=l; mid--) {
    P ret = query(mid);
    if (ret._1+ret._2 == 0) return mid;
    if (ret._1+ret._2 != mp) continue;
    if (mid > l) {
      int o = solve(l, mid-1, ret._1-left, left);
      if (o != -1) return o;
    }
    if (mid < r) {
      int o = solve(mid+1, r, num-(ret._1-left), ret._1);
      if (o != -1) return o;
    }
    return -1;
  }
  for (int mid=mm+1; mid<=r; mid++) {
    P ret = query(mid);
    if (ret._1+ret._2 == 0) return mid;
    if (ret._1+ret._2 != mp) continue;
    if (mid > l) {
      int o = solve(l, mid-1, ret._1-left, left);
      if (o != -1) return o;
    }
    if (mid < r) {
      int o = solve(mid+1, r, num-(ret._1-left), ret._1);
      if (o != -1) return o;
    }
    return -1;
  }
  return -1;
}

int find_best(int N) {
  rep(i, N) cache[i] = P(-1, -1);
  if (N <= 5000) {
    rep(i, N) {
      P ret = query(i);
      if (ret._1+ret._2 == 0) return i;
    }
    abort();
  }
  rep(i, 447) {
    P ret = query(i);
    mp = max(mp, ret._1+ret._2);
  }
  //cout<<"mp="<<mp<<"\n";
  int r = solve(0, N-1, mp, 0);
  assert(r != -1);
  return r;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2108 KB Output is correct
2 Correct 8 ms 2232 KB Output is correct
3 Correct 9 ms 2232 KB Output is correct
4 Correct 7 ms 2232 KB Output is correct
5 Correct 11 ms 2232 KB Output is correct
6 Correct 8 ms 2232 KB Output is correct
7 Correct 10 ms 2232 KB Output is correct
8 Correct 5 ms 2232 KB Output is correct
9 Correct 13 ms 2232 KB Output is correct
10 Correct 9 ms 2232 KB Output is correct
11 Correct 7 ms 2232 KB Output is correct
12 Correct 16 ms 2232 KB Output is correct
13 Correct 20 ms 2232 KB Output is correct
14 Correct 11 ms 2232 KB Output is correct
15 Correct 24 ms 2232 KB Output is correct
16 Correct 44 ms 2232 KB Output is correct
17 Correct 13 ms 2232 KB Output is correct
18 Partially correct 52 ms 2232 KB Partially correct - number of queries: 5201
19 Correct 13 ms 2232 KB Output is correct
20 Correct 27 ms 2232 KB Output is correct
21 Correct 47 ms 2232 KB Output is correct
22 Correct 14 ms 2232 KB Output is correct
23 Correct 6 ms 2232 KB Output is correct
24 Correct 8 ms 2232 KB Output is correct
25 Correct 37 ms 2232 KB Output is correct
26 Correct 38 ms 2232 KB Output is correct
27 Correct 9 ms 2232 KB Output is correct
28 Correct 45 ms 2232 KB Output is correct
29 Correct 36 ms 2232 KB Output is correct
30 Partially correct 66 ms 2232 KB Partially correct - number of queries: 5169
31 Correct 8 ms 2232 KB Output is correct
32 Correct 10 ms 2232 KB Output is correct
33 Correct 2 ms 2232 KB Output is correct
34 Correct 25 ms 2232 KB Output is correct
35 Correct 13 ms 2232 KB Output is correct
36 Correct 26 ms 2232 KB Output is correct
37 Correct 14 ms 2232 KB Output is correct
38 Correct 11 ms 2232 KB Output is correct
39 Correct 25 ms 2232 KB Output is correct
40 Correct 57 ms 2232 KB Output is correct
41 Correct 37 ms 2232 KB Output is correct
42 Correct 30 ms 2232 KB Output is correct
43 Correct 36 ms 2232 KB Output is correct
44 Correct 40 ms 2232 KB Output is correct
45 Correct 10 ms 2232 KB Output is correct
46 Correct 8 ms 2232 KB Output is correct
47 Correct 27 ms 2232 KB Output is correct
48 Correct 37 ms 2232 KB Output is correct
49 Correct 14 ms 2232 KB Output is correct
50 Partially correct 26 ms 2232 KB Partially correct - number of queries: 5207
51 Correct 27 ms 2232 KB Output is correct
52 Correct 18 ms 2232 KB Output is correct
53 Correct 10 ms 2232 KB Output is correct
54 Correct 44 ms 2232 KB Output is correct
55 Correct 12 ms 2232 KB Output is correct
56 Partially correct 58 ms 2232 KB Partially correct - number of queries: 5207
57 Correct 37 ms 2232 KB Output is correct
58 Correct 20 ms 2232 KB Output is correct
59 Correct 38 ms 2232 KB Output is correct
60 Correct 26 ms 2232 KB Output is correct
61 Correct 9 ms 2232 KB Output is correct
62 Correct 8 ms 2232 KB Output is correct
63 Correct 10 ms 2232 KB Output is correct
64 Correct 6 ms 2232 KB Output is correct
65 Correct 12 ms 2232 KB Output is correct
66 Correct 15 ms 2232 KB Output is correct
67 Correct 7 ms 2232 KB Output is correct
68 Runtime error 96 ms 3792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -