oj.uz

Submission #784980

# Submission time Handle Problem Language Result Execution time Memory
784980 2023-07-16T20:48:04 Z Sam_a17 The Big Prize (IOI17_prize) C++17
20 / 100
 87 ms 2640 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;
  int mxQ = 450;

  
  if(n >= 80000) {
    mxQ = 200;
  }

  for(int i = 0; i < mxQ; 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 1608 KB Output is correct
2 Correct 3 ms 1616 KB Output is correct
3 Correct 2 ms 1596 KB Output is correct
4 Correct 2 ms 1608 KB Output is correct
5 Correct 2 ms 1608 KB Output is correct
6 Correct 1 ms 1640 KB Output is correct
7 Correct 3 ms 1616 KB Output is correct
8 Correct 3 ms 1580 KB Output is correct
9 Correct 2 ms 1588 KB Output is correct
10 Correct 3 ms 1584 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1580 KB Output is correct
2 Correct 2 ms 1616 KB Output is correct
3 Correct 2 ms 1632 KB Output is correct
4 Correct 2 ms 1616 KB Output is correct
5 Correct 2 ms 1608 KB Output is correct
6 Correct 3 ms 1616 KB Output is correct
7 Correct 2 ms 1616 KB Output is correct
8 Correct 3 ms 1584 KB Output is correct
9 Correct 1 ms 1604 KB Output is correct
10 Correct 2 ms 1616 KB Output is correct
11 Correct 5 ms 2012 KB Output is correct
12 Correct 3 ms 1604 KB Output is correct
13 Correct 5 ms 2092 KB Output is correct
14 Correct 5 ms 1232 KB Output is correct
15 Correct 6 ms 2096 KB Output is correct
16 Partially correct 31 ms 2552 KB Partially correct - number of queries: 7525
17 Correct 2 ms 1588 KB Output is correct
18 Partially correct 80 ms 2544 KB Partially correct - number of queries: 8803
19 Correct 2 ms 1608 KB Output is correct
20 Correct 15 ms 1744 KB Output is correct
21 Correct 25 ms 2356 KB Output is correct
22 Correct 8 ms 1956 KB Output is correct
23 Correct 3 ms 1708 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Partially correct 28 ms 2396 KB Partially correct - number of queries: 5057
26 Correct 38 ms 2372 KB Output is correct
27 Correct 3 ms 1712 KB Output is correct
28 Partially correct 62 ms 2600 KB Partially correct - number of queries: 8368
29 Partially correct 70 ms 2468 KB Partially correct - number of queries: 6389
30 Partially correct 74 ms 2628 KB Partially correct - number of queries: 8721
31 Correct 2 ms 1608 KB Output is correct
32 Correct 6 ms 2000 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 11 ms 2312 KB Output is correct
35 Correct 3 ms 1720 KB Output is correct
36 Correct 20 ms 2120 KB Output is correct
37 Correct 2 ms 1740 KB Output is correct
38 Correct 2 ms 1616 KB Output is correct
39 Correct 15 ms 2372 KB Output is correct
40 Partially correct 39 ms 2620 KB Partially correct - number of queries: 7487
41 Partially correct 38 ms 2396 KB Partially correct - number of queries: 5342
42 Partially correct 19 ms 2432 KB Partially correct - number of queries: 5342
43 Correct 36 ms 2356 KB Output is correct
44 Correct 28 ms 2312 KB Output is correct
45 Correct 18 ms 2212 KB Output is correct
46 Correct 3 ms 1584 KB Output is correct
47 Correct 35 ms 2268 KB Output is correct
48 Partially correct 47 ms 2588 KB Partially correct - number of queries: 6558
49 Correct 10 ms 1828 KB Output is correct
50 Partially correct 44 ms 2552 KB Partially correct - number of queries: 8789
51 Correct 14 ms 2328 KB Output is correct
52 Correct 4 ms 1608 KB Output is correct
53 Correct 2 ms 1752 KB Output is correct
54 Correct 16 ms 2332 KB Output is correct
55 Correct 2 ms 1580 KB Output is correct
56 Partially correct 72 ms 2604 KB Partially correct - number of queries: 8801
57 Partially correct 49 ms 2416 KB Partially correct - number of queries: 6467
58 Partially correct 51 ms 2472 KB Partially correct - number of queries: 6569
59 Partially correct 45 ms 2328 KB Partially correct - number of queries: 5341
60 Correct 58 ms 2296 KB Output is correct
61 Correct 4 ms 1760 KB Output is correct
62 Correct 4 ms 1728 KB Output is correct
63 Correct 2 ms 1784 KB Output is correct
64 Correct 3 ms 1704 KB Output is correct
65 Correct 4 ms 1608 KB Output is correct
66 Correct 6 ms 1580 KB Output is correct
67 Correct 4 ms 1580 KB Output is correct
68 Correct 3 ms 1596 KB Output is correct
69 Correct 3 ms 1632 KB Output is correct
70 Correct 2 ms 1604 KB Output is correct
71 Partially correct 75 ms 2604 KB Partially correct - number of queries: 9019
72 Correct 9 ms 2216 KB Output is correct
73 Partially correct 71 ms 2572 KB Partially correct - number of queries: 8887
74 Partially correct 66 ms 2568 KB Partially correct - number of queries: 8943
75 Correct 4 ms 1864 KB Output is correct
76 Partially correct 63 ms 2516 KB Partially correct - number of queries: 7675
77 Partially correct 56 ms 2580 KB Partially correct - number of queries: 8899
78 Correct 6 ms 2236 KB Output is correct
79 Correct 26 ms 2540 KB Output is correct
80 Partially correct 87 ms 2532 KB Partially correct - number of queries: 8870
81 Partially correct 79 ms 2504 KB Partially correct - number of queries: 8894
82 Partially correct 72 ms 2608 KB Partially correct - number of queries: 8820
83 Correct 3 ms 1744 KB Output is correct
84 Partially correct 56 ms 2640 KB Partially correct - number of queries: 7269
85 Partially correct 76 ms 2600 KB Partially correct - number of queries: 8895
86 Partially correct 81 ms 2492 KB Partially correct - number of queries: 8085
87 Correct 4 ms 1736 KB Output is correct
88 Partially correct 45 ms 2600 KB Partially correct - number of queries: 7612
89 Partially correct 34 ms 2600 KB Partially correct - number of queries: 8009
90 Correct 3 ms 1616 KB Output is correct
91 Correct 26 ms 2468 KB Output is correct
92 Correct 36 ms 2408 KB Output is correct
93 Incorrect 59 ms 1956 KB Incorrect
94 Halted 0 ms 0 KB -