oj.uz

Submission #784954

# Submission time Handle Problem Language Result Execution time Memory
784954 2023-07-16T20:32:18 Z Sam_a17 The Big Prize (IOI17_prize) C++17
20 / 100
 86 ms 2800 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ld long double
#define ll long long

#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define lb lower_bound
#define ub upper_bound

// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);

std::vector<int> ask(int i);
const int N = 2e5 + 10;
pair<int, int> a[N];
int used[N];

int find_best(int n) {
  memset(used, -1, sizeof(used));

  int mxi = 0;
  for(int i = 0; i < 50; i++) {
    int cur = myrand() % n;
    while (used[cur] == 1) {
      cur = myrand() % n;
    }
    
    auto u = ask(cur);

    a[cur].first = u[0];
    a[cur].second = u[1];
    
    if((u[0] + u[1]) == 0) {
      return cur;
    }

    mxi = max(mxi, u[0] + u[1]);
    used[cur] = 1;
  }

  for(int i = 0; i < n; i++) {
    int ina = i, inb = n - 1, answ = i;
    int lx, rx;
    if(used[i] != -1) {
      lx = a[i].first;
      rx = a[i].second;
    } else {
      auto u = ask(i);

      a[i].first = u[0];
      a[i].second = u[1];

      lx = u[0], rx = u[1];
      used[i] = 1;
    }

    if((lx + rx) == 0) {
      return i;
    }

    if((lx + rx) != mxi) {
      continue;
    }

    while(ina <= inb) {
      int mid = (ina + inb) / 2;
      int l = 0, r = 0;
      if(used[mid] != -1) {
        l = a[mid].first;
        r = a[mid].second;
      } else {
        auto u = ask(mid);

        a[mid].first = u[0];
        a[mid].second = u[1];

        l = u[0], r = u[1];
        used[i] = 1;
      }

      if((l + r) == 0) {
        return mid;
      }

      if(l == lx && (l + r) == (lx + rx)) {
        answ = mid;
        ina = mid + 1;
      } else {
        inb = mid - 1;
      }
    }

    i = answ;
  }

  // xd
  return -1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1232 KB Output is correct
2 Correct 1 ms 1260 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 1 ms 1196 KB Output is correct
5 Correct 1 ms 1256 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 1 ms 1220 KB Output is correct
8 Correct 1 ms 1220 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1232 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1200 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 1 ms 1220 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 1 ms 1220 KB Output is correct
6 Correct 1 ms 1196 KB Output is correct
7 Correct 1 ms 1220 KB Output is correct
8 Correct 2 ms 1232 KB Output is correct
9 Correct 1 ms 1224 KB Output is correct
10 Correct 1 ms 1232 KB Output is correct
11 Correct 4 ms 1576 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 5 ms 1844 KB Output is correct
14 Correct 2 ms 1232 KB Output is correct
15 Correct 6 ms 1824 KB Output is correct
16 Partially correct 67 ms 2464 KB Partially correct - number of queries: 7378
17 Correct 1 ms 1232 KB Output is correct
18 Partially correct 75 ms 2556 KB Partially correct - number of queries: 8655
19 Correct 1 ms 1188 KB Output is correct
20 Correct 18 ms 1724 KB Output is correct
21 Correct 12 ms 2212 KB Output is correct
22 Correct 3 ms 1660 KB Output is correct
23 Correct 1 ms 1216 KB Output is correct
24 Correct 2 ms 1232 KB Output is correct
25 Correct 43 ms 2248 KB Output is correct
26 Correct 18 ms 2300 KB Output is correct
27 Correct 1 ms 1352 KB Output is correct
28 Partially correct 29 ms 2612 KB Partially correct - number of queries: 8228
29 Partially correct 54 ms 2432 KB Partially correct - number of queries: 6242
30 Partially correct 44 ms 2608 KB Partially correct - number of queries: 8584
31 Correct 1 ms 1196 KB Output is correct
32 Correct 5 ms 1708 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 19 ms 2064 KB Output is correct
35 Correct 2 ms 1456 KB Output is correct
36 Correct 8 ms 1968 KB Output is correct
37 Correct 3 ms 1456 KB Output is correct
38 Correct 2 ms 1200 KB Output is correct
39 Correct 36 ms 2176 KB Output is correct
40 Partially correct 31 ms 2800 KB Partially correct - number of queries: 7338
41 Partially correct 56 ms 2296 KB Partially correct - number of queries: 5196
42 Partially correct 43 ms 2328 KB Partially correct - number of queries: 5195
43 Correct 17 ms 2300 KB Output is correct
44 Correct 34 ms 2212 KB Output is correct
45 Correct 20 ms 2008 KB Output is correct
46 Correct 2 ms 1232 KB Output is correct
47 Correct 46 ms 2104 KB Output is correct
48 Partially correct 23 ms 2424 KB Partially correct - number of queries: 6407
49 Correct 4 ms 1580 KB Output is correct
50 Partially correct 86 ms 2556 KB Partially correct - number of queries: 8638
51 Correct 22 ms 2140 KB Output is correct
52 Correct 2 ms 1352 KB Output is correct
53 Correct 1 ms 1332 KB Output is correct
54 Correct 37 ms 2228 KB Output is correct
55 Correct 2 ms 1232 KB Output is correct
56 Partially correct 55 ms 2620 KB Partially correct - number of queries: 8655
57 Partially correct 23 ms 2428 KB Partially correct - number of queries: 6320
58 Partially correct 48 ms 2388 KB Partially correct - number of queries: 6427
59 Partially correct 43 ms 2288 KB Partially correct - number of queries: 5195
60 Correct 35 ms 2240 KB Output is correct
61 Correct 2 ms 1456 KB Output is correct
62 Correct 2 ms 1232 KB Output is correct
63 Correct 3 ms 1456 KB Output is correct
64 Correct 1 ms 1324 KB Output is correct
65 Correct 2 ms 1228 KB Output is correct
66 Correct 5 ms 1200 KB Output is correct
67 Correct 1 ms 1204 KB Output is correct
68 Correct 2 ms 1200 KB Output is correct
69 Correct 4 ms 1200 KB Output is correct
70 Correct 1 ms 1224 KB Output is correct
71 Partially correct 77 ms 2580 KB Partially correct - number of queries: 8867
72 Correct 7 ms 2052 KB Output is correct
73 Partially correct 84 ms 2608 KB Partially correct - number of queries: 8738
74 Partially correct 55 ms 2688 KB Partially correct - number of queries: 8798
75 Correct 3 ms 1488 KB Output is correct
76 Partially correct 58 ms 2632 KB Partially correct - number of queries: 7526
77 Partially correct 74 ms 2548 KB Partially correct - number of queries: 8732
78 Correct 8 ms 1924 KB Output is correct
79 Correct 40 ms 2556 KB Output is correct
80 Partially correct 58 ms 2580 KB Partially correct - number of queries: 8732
81 Partially correct 72 ms 2604 KB Partially correct - number of queries: 8724
82 Partially correct 54 ms 2620 KB Partially correct - number of queries: 8668
83 Correct 2 ms 1488 KB Output is correct
84 Partially correct 59 ms 2564 KB Partially correct - number of queries: 7110
85 Partially correct 70 ms 2632 KB Partially correct - number of queries: 8724
86 Incorrect 70 ms 1464 KB Incorrect
87 Halted 0 ms 0 KB -