oj.uz

답안 #172354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172354 2020-01-01T10:45:19 Z AlexLuchianov 커다란 상품 (IOI17_prize) C++14
97.68 / 100
 73 ms 5256 KB 
#include "prize.h"
#include <cmath>
#include <iostream>
#include <cassert>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 200000;

int identity = 0, diamond = -1;

int queries = 0;

std::vector<int> already[1 + nmax];

std::vector<int> realask(int x){
  if(already[x].size() == 0) {
    std::vector<int> sol = ask(x);
    already[x] = sol;
    if(sol[0] + sol[1] == 0)
      diamond = x;
  }
  return already[x];
}

void solve(int from, int to, int left, int right){

  ///invalid interval
  if(to < from) {
    //std::cout << "Invalid\n";
    return ;
  }
  ///no special element here :(
  if(identity == left + right) {
    //std::cout << "Muggle\n";
    return ;
  }

  ///diamond was already found
  if(0 <= diamond) {
    //std::cout << "Already\n";
    return ;
  }

  int mid = (from + to) / 2;
  std::vector<int> sol = realask(mid);
  if(sol[0] + sol[1] == identity){
    solve(from, mid - 1, left, sol[1]);
    solve(mid + 1, to, sol[0], right);
  } else {
    int mid2 = mid + 1;
    while(mid2 <= to){
      sol = realask(mid2);
      if(sol[0] + sol[1] == identity) {
        solve(mid2 + 1, to, sol[0], right);
        break;
      }
      mid2++;
    }
    mid2 = mid - 1;
    while(from <= mid2){
      sol = realask(mid2);
      if(sol[0] + sol[1] == identity){
        solve(from, mid2 - 1, left, sol[1]);
        break;
      }
      mid2--;
    }
  }
}

int find_best(int n) {
	int special = 0;
	int n2 = sqrt(n);
	while(1 <= n2){
    special += n2;
    n2 = sqrt(n2 - 1);
	}
	//special = 0;
	//std::cout << n << " " << special << '\n';
	assert(special <= 800);

  for(int i = 0;i < MIN(special + 1, n - 1); i++){
    std::vector<int> sol = realask(i);
    identity = MAX(identity, sol[0] + sol[1]);
  }
  solve(0, n - 1, 0, 0);
  assert(0 <= diamond);
  assert(queries <= 10000);
	return diamond;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
77.68 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4984 KB Output is correct
2 Correct 11 ms 5092 KB Output is correct
3 Correct 11 ms 4984 KB Output is correct
4 Correct 11 ms 4984 KB Output is correct
5 Correct 10 ms 4984 KB Output is correct
6 Correct 8 ms 5128 KB Output is correct
7 Correct 9 ms 5128 KB Output is correct
8 Correct 10 ms 5012 KB Output is correct
9 Correct 8 ms 5020 KB Output is correct
10 Correct 10 ms 5112 KB Output is correct
11 Correct 13 ms 4984 KB Output is correct
12 Correct 10 ms 4984 KB Output is correct
13 Correct 9 ms 5056 KB Output is correct
14 Correct 9 ms 4984 KB Output is correct
15 Correct 15 ms 5044 KB Output is correct
16 Correct 49 ms 5248 KB Output is correct
17 Correct 12 ms 4984 KB Output is correct
18 Partially correct 36 ms 5220 KB Partially correct - number of queries: 5089
19 Correct 12 ms 5032 KB Output is correct
20 Correct 13 ms 5156 KB Output is correct
21 Correct 17 ms 5080 KB Output is correct
22 Correct 10 ms 5112 KB Output is correct
23 Correct 9 ms 5128 KB Output is correct
24 Correct 10 ms 4984 KB Output is correct
25 Correct 33 ms 5032 KB Output is correct
26 Correct 39 ms 5112 KB Output is correct
27 Correct 9 ms 5128 KB Output is correct
28 Correct 28 ms 5148 KB Output is correct
29 Correct 40 ms 5104 KB Output is correct
30 Partially correct 52 ms 5112 KB Partially correct - number of queries: 5058
31 Correct 8 ms 5020 KB Output is correct
32 Correct 12 ms 4984 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 19 ms 5056 KB Output is correct
35 Correct 13 ms 5032 KB Output is correct
36 Correct 23 ms 5052 KB Output is correct
37 Correct 13 ms 4984 KB Output is correct
38 Correct 10 ms 4984 KB Output is correct
39 Correct 35 ms 5012 KB Output is correct
40 Correct 49 ms 5112 KB Output is correct
41 Correct 30 ms 5088 KB Output is correct
42 Correct 28 ms 5156 KB Output is correct
43 Correct 20 ms 5196 KB Output is correct
44 Correct 30 ms 5112 KB Output is correct
45 Correct 24 ms 4984 KB Output is correct
46 Correct 8 ms 5128 KB Output is correct
47 Correct 18 ms 5188 KB Output is correct
48 Correct 41 ms 5112 KB Output is correct
49 Correct 16 ms 4984 KB Output is correct
50 Partially correct 60 ms 5160 KB Partially correct - number of queries: 5095
51 Correct 18 ms 5164 KB Output is correct
52 Correct 16 ms 5108 KB Output is correct
53 Correct 12 ms 4944 KB Output is correct
54 Correct 33 ms 5112 KB Output is correct
55 Correct 10 ms 4984 KB Output is correct
56 Partially correct 55 ms 5148 KB Partially correct - number of queries: 5100
57 Correct 29 ms 5100 KB Output is correct
58 Correct 22 ms 5208 KB Output is correct
59 Correct 42 ms 4984 KB Output is correct
60 Correct 34 ms 4984 KB Output is correct
61 Correct 11 ms 4984 KB Output is correct
62 Correct 8 ms 5128 KB Output is correct
63 Correct 10 ms 5056 KB Output is correct
64 Correct 11 ms 5112 KB Output is correct
65 Correct 11 ms 5012 KB Output is correct
66 Correct 15 ms 4984 KB Output is correct
67 Correct 17 ms 4988 KB Output is correct
68 Correct 11 ms 5112 KB Output is correct
69 Correct 14 ms 5028 KB Output is correct
70 Correct 12 ms 4984 KB Output is correct
71 Partially correct 55 ms 5112 KB Partially correct - number of queries: 5232
72 Correct 15 ms 5016 KB Output is correct
73 Partially correct 47 ms 5164 KB Partially correct - number of queries: 5169
74 Partially correct 39 ms 5236 KB Partially correct - number of queries: 5196
75 Correct 12 ms 4984 KB Output is correct
76 Correct 57 ms 5160 KB Output is correct
77 Partially correct 60 ms 5232 KB Partially correct - number of queries: 5198
78 Correct 16 ms 4988 KB Output is correct
79 Correct 32 ms 4984 KB Output is correct
80 Partially correct 73 ms 5112 KB Partially correct - number of queries: 5187
81 Partially correct 58 ms 5244 KB Partially correct - number of queries: 5194
82 Partially correct 64 ms 5116 KB Partially correct - number of queries: 5150
83 Correct 14 ms 4984 KB Output is correct
84 Correct 56 ms 5116 KB Output is correct
85 Partially correct 65 ms 5112 KB Partially correct - number of queries: 5221
86 Correct 9 ms 5120 KB Output is correct
87 Correct 11 ms 4984 KB Output is correct
88 Correct 11 ms 4984 KB Output is correct
89 Correct 11 ms 5032 KB Output is correct
90 Correct 8 ms 5120 KB Output is correct
91 Correct 9 ms 5128 KB Output is correct
92 Correct 12 ms 4984 KB Output is correct
93 Correct 14 ms 5024 KB Output is correct
94 Correct 10 ms 5120 KB Output is correct
95 Correct 15 ms 4984 KB Output is correct
96 Correct 15 ms 5116 KB Output is correct
97 Correct 12 ms 4984 KB Output is correct