oj.uz

Submission #784955

# Submission time Handle Problem Language Result Execution time Memory
784955 2023-07-16T20:33:02 Z Sam_a17 The Big Prize (IOI17_prize) C++17
20 / 100
 79 ms 2732 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 < 100; 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 1 ms 1348 KB Output is correct
4 Correct 1 ms 1352 KB Output is correct
5 Correct 2 ms 1452 KB Output is correct
6 Correct 1 ms 1344 KB Output is correct
7 Correct 2 ms 1360 KB Output is correct
8 Correct 2 ms 1360 KB Output is correct
9 Correct 2 ms 1360 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 1 ms 1340 KB Output is correct
2 Correct 2 ms 1460 KB Output is correct
3 Correct 1 ms 1480 KB Output is correct
4 Correct 2 ms 1360 KB Output is correct
5 Correct 2 ms 1456 KB Output is correct
6 Correct 2 ms 1324 KB Output is correct
7 Correct 1 ms 1468 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1360 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 2 ms 1684 KB Output is correct
12 Correct 2 ms 1456 KB Output is correct
13 Correct 3 ms 1988 KB Output is correct
14 Correct 3 ms 1224 KB Output is correct
15 Correct 12 ms 1868 KB Output is correct
16 Partially correct 44 ms 2504 KB Partially correct - number of queries: 7428
17 Correct 4 ms 1436 KB Output is correct
18 Partially correct 63 ms 2732 KB Partially correct - number of queries: 8701
19 Correct 2 ms 1456 KB Output is correct
20 Correct 20 ms 1676 KB Output is correct
21 Correct 13 ms 2264 KB Output is correct
22 Correct 7 ms 1768 KB Output is correct
23 Correct 2 ms 1456 KB Output is correct
24 Correct 1 ms 1352 KB Output is correct
25 Correct 44 ms 2248 KB Output is correct
26 Correct 32 ms 2292 KB Output is correct
27 Correct 3 ms 1488 KB Output is correct
28 Partially correct 53 ms 2560 KB Partially correct - number of queries: 8276
29 Partially correct 55 ms 2504 KB Partially correct - number of queries: 6290
30 Partially correct 53 ms 2620 KB Partially correct - number of queries: 8631
31 Correct 1 ms 1348 KB Output is correct
32 Correct 5 ms 1836 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 26 ms 2076 KB Output is correct
35 Correct 2 ms 1588 KB Output is correct
36 Correct 8 ms 2052 KB Output is correct
37 Correct 3 ms 1488 KB Output is correct
38 Correct 1 ms 1356 KB Output is correct
39 Correct 31 ms 2260 KB Output is correct
40 Partially correct 33 ms 2544 KB Partially correct - number of queries: 7386
41 Partially correct 19 ms 2368 KB Partially correct - number of queries: 5244
42 Partially correct 19 ms 2404 KB Partially correct - number of queries: 5242
43 Correct 17 ms 2360 KB Output is correct
44 Correct 18 ms 2216 KB Output is correct
45 Correct 14 ms 2140 KB Output is correct
46 Correct 2 ms 1308 KB Output is correct
47 Correct 19 ms 2252 KB Output is correct
48 Partially correct 50 ms 2652 KB Partially correct - number of queries: 6457
49 Correct 7 ms 1708 KB Output is correct
50 Partially correct 69 ms 2564 KB Partially correct - number of queries: 8695
51 Correct 34 ms 2228 KB Output is correct
52 Correct 2 ms 1488 KB Output is correct
53 Correct 3 ms 1564 KB Output is correct
54 Correct 17 ms 2272 KB Output is correct
55 Correct 2 ms 1360 KB Output is correct
56 Partially correct 31 ms 2628 KB Partially correct - number of queries: 8701
57 Partially correct 31 ms 2324 KB Partially correct - number of queries: 6370
58 Partially correct 36 ms 2364 KB Partially correct - number of queries: 6473
59 Partially correct 30 ms 2280 KB Partially correct - number of queries: 5241
60 Correct 33 ms 2284 KB Output is correct
61 Correct 4 ms 1592 KB Output is correct
62 Correct 1 ms 1356 KB Output is correct
63 Correct 2 ms 1632 KB Output is correct
64 Correct 2 ms 1472 KB Output is correct
65 Correct 1 ms 1352 KB Output is correct
66 Correct 3 ms 1480 KB Output is correct
67 Correct 1 ms 1356 KB Output is correct
68 Correct 5 ms 1324 KB Output is correct
69 Correct 4 ms 1452 KB Output is correct
70 Correct 1 ms 1360 KB Output is correct
71 Partially correct 52 ms 2564 KB Partially correct - number of queries: 8916
72 Correct 6 ms 2028 KB Output is correct
73 Partially correct 72 ms 2596 KB Partially correct - number of queries: 8786
74 Partially correct 70 ms 2512 KB Partially correct - number of queries: 8847
75 Correct 4 ms 1616 KB Output is correct
76 Partially correct 48 ms 2620 KB Partially correct - number of queries: 7578
77 Partially correct 58 ms 2632 KB Partially correct - number of queries: 8776
78 Correct 6 ms 2052 KB Output is correct
79 Correct 34 ms 2532 KB Output is correct
80 Partially correct 78 ms 2588 KB Partially correct - number of queries: 8785
81 Partially correct 77 ms 2600 KB Partially correct - number of queries: 8776
82 Partially correct 79 ms 2560 KB Partially correct - number of queries: 8708
83 Correct 3 ms 1616 KB Output is correct
84 Partially correct 66 ms 2568 KB Partially correct - number of queries: 7164
85 Partially correct 56 ms 2672 KB Partially correct - number of queries: 8776
86 Incorrect 69 ms 1688 KB Incorrect
87 Halted 0 ms 0 KB -