oj.uz

답안 #72844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72844 2018-08-27T05:22:16 Z funcsr 커다란 상품 (IOI17_prize) C++17
20 / 100
 353 ms 7272 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;
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);
  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;
  vector<P> list;
  for (int mid=mm; mid>=l; mid--) list.pb(P(mm-mid, mid));
  for (int mid=mm+1; mid<=r; mid++) list.pb(P(mid-mm, mid));
  sort(all(list));

  for (P p : list) {
    int mid = p._2;
    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, 471) {
    P ret = query(i);
    mp = max(mp, ret._1+ret._2);
  }
  int r = solve(0, N-1, mp, 0);
  assert(r != -1);
  return r;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 5220 KB Output is correct
2 Correct 69 ms 5408 KB Output is correct
3 Correct 74 ms 5408 KB Output is correct
4 Correct 62 ms 5508 KB Output is correct
5 Correct 62 ms 5508 KB Output is correct
6 Correct 73 ms 5508 KB Output is correct
7 Correct 66 ms 5508 KB Output is correct
8 Correct 61 ms 5508 KB Output is correct
9 Correct 35 ms 5508 KB Output is correct
10 Correct 58 ms 5508 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 5508 KB Output is correct
2 Correct 60 ms 5508 KB Output is correct
3 Correct 59 ms 5508 KB Output is correct
4 Correct 67 ms 5508 KB Output is correct
5 Correct 65 ms 5508 KB Output is correct
6 Correct 63 ms 5508 KB Output is correct
7 Correct 62 ms 5508 KB Output is correct
8 Correct 61 ms 5508 KB Output is correct
9 Correct 37 ms 5508 KB Output is correct
10 Correct 69 ms 5508 KB Output is correct
11 Correct 120 ms 5544 KB Output is correct
12 Correct 62 ms 5544 KB Output is correct
13 Correct 233 ms 5544 KB Output is correct
14 Correct 18 ms 5544 KB Output is correct
15 Correct 102 ms 5544 KB Output is correct
16 Correct 228 ms 5544 KB Output is correct
17 Correct 80 ms 5544 KB Output is correct
18 Partially correct 326 ms 5544 KB Partially correct - number of queries: 5225
19 Correct 66 ms 5544 KB Output is correct
20 Correct 75 ms 5544 KB Output is correct
21 Correct 129 ms 5544 KB Output is correct
22 Correct 78 ms 5544 KB Output is correct
23 Correct 70 ms 5544 KB Output is correct
24 Correct 59 ms 5544 KB Output is correct
25 Correct 181 ms 5556 KB Output is correct
26 Correct 198 ms 5556 KB Output is correct
27 Correct 93 ms 5556 KB Output is correct
28 Correct 259 ms 5560 KB Output is correct
29 Correct 244 ms 5560 KB Output is correct
30 Partially correct 258 ms 5560 KB Partially correct - number of queries: 5193
31 Correct 62 ms 5560 KB Output is correct
32 Correct 165 ms 5576 KB Output is correct
33 Correct 2 ms 5576 KB Output is correct
34 Correct 124 ms 5576 KB Output is correct
35 Correct 129 ms 5576 KB Output is correct
36 Correct 105 ms 5576 KB Output is correct
37 Correct 81 ms 5576 KB Output is correct
38 Correct 60 ms 5576 KB Output is correct
39 Correct 152 ms 5576 KB Output is correct
40 Correct 267 ms 5576 KB Output is correct
41 Correct 189 ms 5576 KB Output is correct
42 Correct 205 ms 5576 KB Output is correct
43 Correct 208 ms 5576 KB Output is correct
44 Correct 153 ms 5576 KB Output is correct
45 Correct 131 ms 5576 KB Output is correct
46 Correct 69 ms 5576 KB Output is correct
47 Correct 161 ms 5576 KB Output is correct
48 Correct 274 ms 5576 KB Output is correct
49 Correct 84 ms 5576 KB Output is correct
50 Partially correct 242 ms 5576 KB Partially correct - number of queries: 5231
51 Correct 160 ms 5576 KB Output is correct
52 Correct 65 ms 5576 KB Output is correct
53 Correct 152 ms 5576 KB Output is correct
54 Correct 185 ms 5576 KB Output is correct
55 Correct 58 ms 5576 KB Output is correct
56 Partially correct 297 ms 5576 KB Partially correct - number of queries: 5231
57 Correct 246 ms 5576 KB Output is correct
58 Correct 228 ms 5576 KB Output is correct
59 Correct 239 ms 5576 KB Output is correct
60 Correct 213 ms 5576 KB Output is correct
61 Correct 138 ms 5576 KB Output is correct
62 Correct 66 ms 5576 KB Output is correct
63 Correct 184 ms 5576 KB Output is correct
64 Correct 123 ms 5576 KB Output is correct
65 Correct 96 ms 5576 KB Output is correct
66 Correct 58 ms 5576 KB Output is correct
67 Correct 67 ms 5576 KB Output is correct
68 Correct 68 ms 5576 KB Output is correct
69 Correct 67 ms 5576 KB Output is correct
70 Correct 68 ms 5576 KB Output is correct
71 Partially correct 341 ms 5576 KB Partially correct - number of queries: 5229
72 Correct 205 ms 5576 KB Output is correct
73 Partially correct 353 ms 5576 KB Partially correct - number of queries: 5166
74 Partially correct 348 ms 5576 KB Partially correct - number of queries: 5193
75 Correct 134 ms 5608 KB Output is correct
76 Correct 299 ms 5608 KB Output is correct
77 Partially correct 249 ms 5608 KB Partially correct - number of queries: 5342
78 Correct 208 ms 5608 KB Output is correct
79 Correct 242 ms 5608 KB Output is correct
80 Partially correct 281 ms 5608 KB Partially correct - number of queries: 5336
81 Partially correct 280 ms 5608 KB Partially correct - number of queries: 5349
82 Partially correct 259 ms 5608 KB Partially correct - number of queries: 5300
83 Correct 138 ms 5608 KB Output is correct
84 Correct 280 ms 5608 KB Output is correct
85 Partially correct 298 ms 5608 KB Partially correct - number of queries: 5318
86 Runtime error 89 ms 7272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -