oj.uz

답안 #299607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299607 2020-09-15T10:14:03 Z kevlee 커다란 상품 (IOI17_prize) C++17
100 / 100
 74 ms 5396 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define SQ 450
vi mem[200005];
int prize = -1, maxx;
void solve(int l, int r, int aim) {
  if (l > r || aim <= 0 || prize != -1) return;
  //cout << l << ' ' << r << ' ' << aim << endl;
  int mid = (l + r) >> 1;
  vi res = mem[mid];
  if (res.empty()) {
    mem[mid] = ask(mid);
    res = mem[mid];
  }
  //cout << res[0] << "  " << res[1] << endl;
  if (res[0] + res[1] == 0) {
    prize = mid;
    //cout << "Found up there" << endl;
    return;
  }
  if (res[0] + res[1] == maxx) {
    //cout << "hello " <<mem[l-1][0] << endl;
    solve(l, mid - 1, res[0] - mem[l-1][0]);
    solve(mid + 1, r, aim - (res[0] - mem[l-1][0]));
  } else {
    int pointer = mid;
    while (pointer < r) {
      pointer++;
      res = mem[pointer];
      if (res.empty()) {
        mem[pointer] = ask(pointer);
        res = mem[pointer];
      }
      if (res[0] + res[1] == 0) {
        prize = pointer;
        //cout << "Found up there" << endl;
        return;
      }
      if (res[0] + res[1] == maxx) {
        solve(l, mid - 1, res[0] - mem[l-1][0] - (pointer - mid));
        solve(pointer + 1, r, aim - (res[0] - mem[l-1][0]));
        return;
      }
    }
    solve(l, mid - 1, aim - (r - mid + 1));
  }
}
int find_best(int n) {
  if (n <= 5000) {
    FOR(i, 0, n-1) {
      vi tmp = ask(i);
      if (tmp[0] + tmp[1] == 0) return i;
    }
  }
  //----
  int cnt = 0;
  for (int i = 0; i < n; i += 500) {
    cnt++;
    mem[i] = ask(i);
    if (mem[i][0] + mem[i][1] == 0) return i; 
    maxx = max(maxx, mem[i][0] + mem[i][1]);
  }
  FOR(i, 0, n-1) {
    if (i % 500 == 0) continue;
    if (cnt >= 500) break;
    cnt++;
    mem[i] = ask(i);
    if (mem[i][0] + mem[i][1] == 0) return i; 
    maxx = max(maxx, mem[i][0] + mem[i][1]);
  }
  vi seg;
  for (int i = 0; i < n; ) {
    while (i < n) {
      if (mem[i].empty()) {
        mem[i] = ask(i);
        if (mem[i][0] + mem[i][1] == 0) return i;
      }
      if (mem[i][0] + mem[i][1] == maxx) {
        break;
      }
      i++;
    }
    if (i < n && mem[i][0] + mem[i][1] == maxx) seg.pb(i);
    i++;
    while (i < n) {
      if (i % 500 == 0) break;
      i++;
    }
  }
  int last = -1, sum = 0;
  for (int pos: seg) {
    ///cout << pos << ": " << mem[pos][0] - sum << endl;
    solve(last + 1, pos - 1, mem[pos][0] - sum);
    sum = mem[pos][0];
    last = pos;
  }
  assert(last != -1);
  solve(last + 1, n - 1, mem[last][1]);
	return prize;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4992 KB Output is correct
2 Correct 9 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 11 ms 5120 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 9 ms 4992 KB Output is correct
10 Correct 9 ms 4992 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 7 ms 5080 KB Output is correct
3 Correct 9 ms 4992 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 5 ms 5176 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 9 ms 4992 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 13 ms 4992 KB Output is correct
12 Correct 11 ms 4992 KB Output is correct
13 Correct 16 ms 4992 KB Output is correct
14 Correct 10 ms 4992 KB Output is correct
15 Correct 11 ms 4992 KB Output is correct
16 Correct 38 ms 5120 KB Output is correct
17 Correct 9 ms 4992 KB Output is correct
18 Correct 45 ms 5120 KB Output is correct
19 Correct 9 ms 4992 KB Output is correct
20 Correct 17 ms 5024 KB Output is correct
21 Correct 23 ms 5112 KB Output is correct
22 Correct 11 ms 4992 KB Output is correct
23 Correct 8 ms 4992 KB Output is correct
24 Correct 9 ms 4992 KB Output is correct
25 Correct 25 ms 5112 KB Output is correct
26 Correct 25 ms 5112 KB Output is correct
27 Correct 11 ms 4992 KB Output is correct
28 Correct 60 ms 5112 KB Output is correct
29 Correct 40 ms 5268 KB Output is correct
30 Correct 71 ms 5112 KB Output is correct
31 Correct 6 ms 5216 KB Output is correct
32 Correct 14 ms 4992 KB Output is correct
33 Correct 5 ms 4992 KB Output is correct
34 Correct 31 ms 5112 KB Output is correct
35 Correct 14 ms 4992 KB Output is correct
36 Correct 16 ms 4992 KB Output is correct
37 Correct 13 ms 4992 KB Output is correct
38 Correct 9 ms 4992 KB Output is correct
39 Correct 16 ms 5196 KB Output is correct
40 Correct 45 ms 5112 KB Output is correct
41 Correct 38 ms 5396 KB Output is correct
42 Correct 30 ms 5136 KB Output is correct
43 Correct 40 ms 5112 KB Output is correct
44 Correct 19 ms 5120 KB Output is correct
45 Correct 31 ms 5112 KB Output is correct
46 Correct 9 ms 4992 KB Output is correct
47 Correct 23 ms 5112 KB Output is correct
48 Correct 34 ms 5120 KB Output is correct
49 Correct 11 ms 4992 KB Output is correct
50 Correct 56 ms 5368 KB Output is correct
51 Correct 21 ms 5120 KB Output is correct
52 Correct 9 ms 5024 KB Output is correct
53 Correct 13 ms 4992 KB Output is correct
54 Correct 27 ms 5112 KB Output is correct
55 Correct 9 ms 4992 KB Output is correct
56 Correct 44 ms 5120 KB Output is correct
57 Correct 24 ms 5288 KB Output is correct
58 Correct 52 ms 5112 KB Output is correct
59 Correct 41 ms 5240 KB Output is correct
60 Correct 42 ms 5112 KB Output is correct
61 Correct 11 ms 4992 KB Output is correct
62 Correct 6 ms 5080 KB Output is correct
63 Correct 13 ms 4992 KB Output is correct
64 Correct 10 ms 4992 KB Output is correct
65 Correct 12 ms 4992 KB Output is correct
66 Correct 12 ms 4992 KB Output is correct
67 Correct 13 ms 4992 KB Output is correct
68 Correct 16 ms 4992 KB Output is correct
69 Correct 10 ms 4992 KB Output is correct
70 Correct 11 ms 4992 KB Output is correct
71 Correct 73 ms 5112 KB Output is correct
72 Correct 11 ms 4992 KB Output is correct
73 Correct 51 ms 5152 KB Output is correct
74 Correct 63 ms 5112 KB Output is correct
75 Correct 11 ms 4992 KB Output is correct
76 Correct 43 ms 5196 KB Output is correct
77 Correct 51 ms 5112 KB Output is correct
78 Correct 8 ms 5076 KB Output is correct
79 Correct 40 ms 5116 KB Output is correct
80 Correct 43 ms 5112 KB Output is correct
81 Correct 59 ms 5240 KB Output is correct
82 Correct 42 ms 5144 KB Output is correct
83 Correct 9 ms 4992 KB Output is correct
84 Correct 68 ms 5112 KB Output is correct
85 Correct 74 ms 5112 KB Output is correct
86 Correct 53 ms 5116 KB Output is correct
87 Correct 17 ms 4992 KB Output is correct
88 Correct 51 ms 5112 KB Output is correct
89 Correct 51 ms 5112 KB Output is correct
90 Correct 8 ms 5068 KB Output is correct
91 Correct 29 ms 5120 KB Output is correct
92 Correct 20 ms 5076 KB Output is correct
93 Correct 41 ms 5112 KB Output is correct
94 Correct 45 ms 5112 KB Output is correct
95 Correct 41 ms 5112 KB Output is correct
96 Correct 42 ms 5116 KB Output is correct
97 Correct 39 ms 5240 KB Output is correct