oj.uz

Submission #784979

# Submission time Handle Problem Language Result Execution time Memory
784979 2023-07-16T20:47:24 Z Sam_a17 The Big Prize (IOI17_prize) C++17
20 / 100
 82 ms 2728 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 = 100;
  }

  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 1360 KB Output is correct
2 Correct 1 ms 1352 KB Output is correct
3 Correct 2 ms 1360 KB Output is correct
4 Correct 2 ms 1456 KB Output is correct
5 Correct 2 ms 1348 KB Output is correct
6 Correct 1 ms 1324 KB Output is correct
7 Correct 3 ms 1456 KB Output is correct
8 Correct 2 ms 1456 KB Output is correct
9 Correct 1 ms 1352 KB Output is correct
10 Correct 2 ms 1360 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1348 KB Output is correct
2 Correct 1 ms 1348 KB Output is correct
3 Correct 2 ms 1456 KB Output is correct
4 Correct 2 ms 1360 KB Output is correct
5 Correct 2 ms 1452 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 2 ms 1352 KB Output is correct
8 Correct 1 ms 1348 KB Output is correct
9 Correct 2 ms 1352 KB Output is correct
10 Correct 2 ms 1348 KB Output is correct
11 Correct 3 ms 1712 KB Output is correct
12 Correct 2 ms 1448 KB Output is correct
13 Correct 7 ms 1988 KB Output is correct
14 Correct 8 ms 1232 KB Output is correct
15 Correct 13 ms 1972 KB Output is correct
16 Partially correct 65 ms 2432 KB Partially correct - number of queries: 7426
17 Correct 2 ms 1360 KB Output is correct
18 Partially correct 53 ms 2608 KB Partially correct - number of queries: 8704
19 Correct 2 ms 1360 KB Output is correct
20 Correct 24 ms 1676 KB Output is correct
21 Correct 29 ms 2148 KB Output is correct
22 Correct 6 ms 1696 KB Output is correct
23 Correct 1 ms 1392 KB Output is correct
24 Correct 1 ms 1352 KB Output is correct
25 Correct 42 ms 2332 KB Output is correct
26 Correct 38 ms 2352 KB Output is correct
27 Correct 2 ms 1488 KB Output is correct
28 Partially correct 82 ms 2512 KB Partially correct - number of queries: 8274
29 Partially correct 64 ms 2552 KB Partially correct - number of queries: 6292
30 Partially correct 30 ms 2628 KB Partially correct - number of queries: 8629
31 Correct 2 ms 1360 KB Output is correct
32 Correct 3 ms 1868 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 17 ms 2320 KB Output is correct
35 Correct 3 ms 1616 KB Output is correct
36 Correct 13 ms 2000 KB Output is correct
37 Correct 2 ms 1612 KB Output is correct
38 Correct 2 ms 1360 KB Output is correct
39 Correct 25 ms 2244 KB Output is correct
40 Partially correct 56 ms 2604 KB Partially correct - number of queries: 7388
41 Partially correct 19 ms 2380 KB Partially correct - number of queries: 5242
42 Partially correct 30 ms 2324 KB Partially correct - number of queries: 5242
43 Correct 17 ms 2340 KB Output is correct
44 Correct 29 ms 2212 KB Output is correct
45 Correct 26 ms 2140 KB Output is correct
46 Correct 2 ms 1360 KB Output is correct
47 Correct 16 ms 2272 KB Output is correct
48 Partially correct 24 ms 2424 KB Partially correct - number of queries: 6458
49 Correct 6 ms 1712 KB Output is correct
50 Partially correct 70 ms 2524 KB Partially correct - number of queries: 8692
51 Correct 33 ms 2256 KB Output is correct
52 Correct 2 ms 1488 KB Output is correct
53 Correct 2 ms 1488 KB Output is correct
54 Correct 33 ms 2200 KB Output is correct
55 Correct 2 ms 1360 KB Output is correct
56 Partially correct 76 ms 2508 KB Partially correct - number of queries: 8702
57 Partially correct 56 ms 2368 KB Partially correct - number of queries: 6368
58 Partially correct 49 ms 2340 KB Partially correct - number of queries: 6476
59 Partially correct 47 ms 2376 KB Partially correct - number of queries: 5244
60 Correct 38 ms 2340 KB Output is correct
61 Correct 3 ms 1588 KB Output is correct
62 Correct 2 ms 1452 KB Output is correct
63 Correct 3 ms 1488 KB Output is correct
64 Correct 2 ms 1480 KB Output is correct
65 Correct 2 ms 1352 KB Output is correct
66 Correct 3 ms 1356 KB Output is correct
67 Correct 3 ms 1456 KB Output is correct
68 Correct 5 ms 1360 KB Output is correct
69 Correct 5 ms 1456 KB Output is correct
70 Correct 2 ms 1360 KB Output is correct
71 Partially correct 58 ms 2728 KB Partially correct - number of queries: 8915
72 Correct 8 ms 2000 KB Output is correct
73 Partially correct 81 ms 2528 KB Partially correct - number of queries: 8790
74 Partially correct 31 ms 2608 KB Partially correct - number of queries: 8843
75 Correct 4 ms 1616 KB Output is correct
76 Partially correct 54 ms 2524 KB Partially correct - number of queries: 7577
77 Partially correct 57 ms 2624 KB Partially correct - number of queries: 8769
78 Correct 6 ms 2128 KB Output is correct
79 Correct 16 ms 2564 KB Output is correct
80 Partially correct 59 ms 2524 KB Partially correct - number of queries: 7645
81 Partially correct 79 ms 2512 KB Partially correct - number of queries: 8792
82 Partially correct 72 ms 2648 KB Partially correct - number of queries: 8717
83 Correct 3 ms 1616 KB Output is correct
84 Partially correct 69 ms 2536 KB Partially correct - number of queries: 7156
85 Partially correct 58 ms 2592 KB Partially correct - number of queries: 8786
86 Partially correct 51 ms 2500 KB Partially correct - number of queries: 8157
87 Correct 3 ms 1616 KB Output is correct
88 Partially correct 63 ms 2568 KB Partially correct - number of queries: 7702
89 Partially correct 46 ms 2576 KB Partially correct - number of queries: 8080
90 Correct 2 ms 1488 KB Output is correct
91 Correct 41 ms 2536 KB Output is correct
92 Correct 42 ms 2248 KB Output is correct
93 Incorrect 68 ms 1900 KB Incorrect
94 Halted 0 ms 0 KB -