oj.uz

Submission #736536

# Submission time Handle Problem Language Result Execution time Memory
736536 2023-05-05T21:25:21 Z AdamGS Rarest Insects (IOI22_insects) C++17
82.27 / 100
 120 ms 400 KB 
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
int min_cardinality(int n) {
  vector<int>A, B;
  rep(i, n) {
    move_inside(i);
    if(press_button()==1) A.pb(i);
    else {
      B.pb(i);
      move_outside(i);
    }
  }
  for(auto i : A) move_outside(i);
  int po=0, ko=n/(int)A.size()-1;
  stack<pair<int,int>>S;
  S.push({-1, -1});
  mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
  rep(i, A.size()) swap(A[i], A[rng()%(i+1)]);
  int ile=0;
  while(po<ko) {
    int sr=po+(ko-po)/4+1;
    while(S.top().st>sr) {
      B.pb(S.top().nd);
      move_outside(S.top().nd);
      --ile;
      S.pop();
    }
    vector<int>tmp;
    rep(i, B.size()) swap(B[i], B[rng()%(i+1)]);
    for(auto i : B) {
      move_inside(i);
      ++ile;
      int x=press_button();
      if(x>sr) {
        move_outside(i);
        --ile;
        tmp.pb(i);
        continue;
      }
      S.push({x, i});
    }
    B=tmp;
    if(ile==(int)A.size()*sr) po=sr; else ko=sr-1;
  }
  return po+1;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
insects.cpp:24:3: note: in expansion of macro 'rep'
   24 |   rep(i, A.size()) swap(A[i], A[rng()%(i+1)]);
      |   ^~~
insects.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
insects.cpp:35:5: note: in expansion of macro 'rep'
   35 |     rep(i, B.size()) swap(B[i], B[rng()%(i+1)]);
      |     ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 11 ms 208 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 4 ms 304 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 11 ms 208 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 4 ms 304 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 32 ms 292 KB Output is correct
24 Correct 11 ms 304 KB Output is correct
25 Correct 43 ms 304 KB Output is correct
26 Correct 18 ms 304 KB Output is correct
27 Correct 59 ms 304 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 50 ms 300 KB Output is correct
30 Correct 38 ms 208 KB Output is correct
31 Correct 39 ms 336 KB Output is correct
32 Correct 37 ms 308 KB Output is correct
33 Correct 33 ms 208 KB Output is correct
34 Correct 39 ms 304 KB Output is correct
35 Correct 49 ms 336 KB Output is correct
36 Correct 32 ms 296 KB Output is correct
37 Correct 38 ms 208 KB Output is correct
38 Correct 37 ms 304 KB Output is correct
39 Correct 19 ms 208 KB Output is correct
40 Correct 14 ms 336 KB Output is correct
41 Correct 10 ms 304 KB Output is correct

Subtask #3
57.27 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Partially correct 70 ms 304 KB Output is partially correct
8 Correct 20 ms 400 KB Output is correct
9 Partially correct 92 ms 336 KB Output is partially correct
10 Partially correct 82 ms 300 KB Output is partially correct
11 Partially correct 111 ms 296 KB Output is partially correct
12 Correct 29 ms 312 KB Output is correct
13 Partially correct 98 ms 304 KB Output is partially correct
14 Partially correct 65 ms 308 KB Output is partially correct
15 Partially correct 105 ms 300 KB Output is partially correct
16 Partially correct 85 ms 308 KB Output is partially correct
17 Partially correct 93 ms 308 KB Output is partially correct
18 Partially correct 74 ms 208 KB Output is partially correct
19 Partially correct 69 ms 208 KB Output is partially correct
20 Partially correct 69 ms 288 KB Output is partially correct
21 Partially correct 102 ms 308 KB Output is partially correct
22 Partially correct 76 ms 208 KB Output is partially correct
23 Correct 55 ms 304 KB Output is correct
24 Correct 36 ms 328 KB Output is correct
25 Correct 23 ms 304 KB Output is correct
26 Correct 23 ms 304 KB Output is correct
27 Partially correct 65 ms 304 KB Output is partially correct
28 Partially correct 83 ms 208 KB Output is partially correct
29 Partially correct 77 ms 304 KB Output is partially correct
30 Partially correct 65 ms 208 KB Output is partially correct
31 Partially correct 77 ms 308 KB Output is partially correct
32 Partially correct 89 ms 300 KB Output is partially correct
33 Partially correct 49 ms 304 KB Output is partially correct
34 Partially correct 41 ms 304 KB Output is partially correct
35 Partially correct 68 ms 304 KB Output is partially correct
36 Partially correct 97 ms 296 KB Output is partially correct
37 Partially correct 35 ms 300 KB Output is partially correct
38 Partially correct 48 ms 208 KB Output is partially correct
39 Partially correct 43 ms 316 KB Output is partially correct
40 Partially correct 62 ms 308 KB Output is partially correct
41 Partially correct 77 ms 308 KB Output is partially correct
42 Partially correct 52 ms 312 KB Output is partially correct
43 Partially correct 29 ms 296 KB Output is partially correct
44 Partially correct 120 ms 296 KB Output is partially correct
45 Partially correct 95 ms 300 KB Output is partially correct
46 Correct 22 ms 304 KB Output is correct
47 Correct 34 ms 308 KB Output is correct
48 Correct 33 ms 300 KB Output is correct