oj.uz

답안 #1058421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058421 2024-08-14T09:55:50 Z SalihSahin 드문 곤충 (IOI22_insects) C++17
96.02 / 100
 43 ms 852 KB 
#include<bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;
 
/*
static inline constexpr int kMaxQueries = 40000;
 
static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;
 
static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;
 
static std::vector<int> op_counter(3, 0);
 
static inline void protocol_violation(std::string message) {
  printf("Protocol Violation: %s\n", message.c_str());
  exit(0);
}
 
void move_inside(int i) {
  if (i < 0 || i >= N) {
    protocol_violation("invalid parameter");
  }
  ++op_counter[0];
  if (op_counter[0] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  if (!in_box[i]) {
    in_box[i] = true;
    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
    ++color_occurrences[color[i]];
    max_occurrences.insert(color_occurrences[color[i]]);
  }
}
 
void move_outside(int i) {
  if (i < 0 || i >= N) {
    protocol_violation("invalid parameter");
  }
  ++op_counter[1];
  if (op_counter[1] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  if (in_box[i]) {
    in_box[i] = false;
    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
    --color_occurrences[color[i]];
    max_occurrences.insert(color_occurrences[color[i]]);
  }
}
 
int press_button() {
  ++op_counter[2];
  if (op_counter[2] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  return *(max_occurrences.rbegin());
}
*/
int min_cardinality(int N) {
   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
   vector<int> cik;
 
   int colcnt = 0;
   for(int i = 0; i < N; i++){
      move_inside(i);
      colcnt++;
      int val = press_button();
      if(val == 2){
        move_outside(i);
        colcnt--;
      }
      else cik.pb(i);
   }
   for(auto itr: cik){
    move_outside(itr);
   }
   cik.clear();
 
   if(N/colcnt < 512){
       vector<int> rem, nrem;
       for(int i = 0; i < N; i++){
        rem.pb(i);
       }

       int bt = 0, x = 1;
       while(x * 2 <= N/colcnt){
        bt++;
        x *= 2;
       }

       int ans = 0;
       for(int i = bt; i >= 0; i--){
          int val = (1 << i);
          vector<int> out;

          int cnt = 0;

          for(auto it: rem){
             cnt++;
             move_inside(it);
             int check = press_button();
             if(check > ans + val){
                move_outside(it);
                out.pb(it);
                cnt--;
             }
             else nrem.pb(it);
          }

          if(cnt == colcnt * val){ 
             ans += val;
             rem = out;
          }
          else{
             for(auto itr: nrem) move_outside(itr);
              rem = nrem;
          }
          nrem.clear();
       }

       return ans;
   }
   else{
      vector<int> wh, nxtwh;
      for(int i = 0; i < N; i++){
          wh.pb(i);
      }
      shuffle(wh.begin(), wh.end(), rng);
 
      int sz = 0, ans = N;
 
      while(wh.size() > 0){
         sz = 0;
         for(auto itr: wh){
              move_inside(itr);
              sz++;
              int val = press_button();
              if(val != sz){
                move_outside(itr);
                nxtwh.pb(itr);
                sz--;
              }
              else cik.pb(itr);
          }
          ans = min(ans, sz);
          wh = nxtwh;
          for(auto itr: cik) move_outside(itr);
          cik.clear();
          nxtwh.clear();
      }
 
      return ans;
   }
}

/*
int main() {
  assert(1 == scanf("%d", &N));
  color.resize(N);
  in_box.assign(N, false);
 
  std::map<int, int> type_to_color;
  for (int i = 0; i < N; ++i) {
    int Ti;
    assert(1 == scanf("%d", &Ti));
    if (type_to_color.find(Ti) == type_to_color.end()) {
      int new_color = type_to_color.size();
      type_to_color[Ti] = new_color;
      max_occurrences.insert(0);
    }
    color[i] = type_to_color[Ti];
  }
 
  color_occurrences.assign(type_to_color.size(), 0);
 
  int answer = min_cardinality(N);
  int Q = *std::max_element(op_counter.begin(), op_counter.end());
  printf("%d\n", answer);
  printf("%d\n", Q);
  return 0;
}
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 436 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 436 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 3 ms 440 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 10 ms 440 KB Output is correct
24 Correct 9 ms 448 KB Output is correct
25 Correct 9 ms 440 KB Output is correct
26 Correct 18 ms 696 KB Output is correct
27 Correct 17 ms 688 KB Output is correct
28 Correct 11 ms 600 KB Output is correct
29 Correct 11 ms 444 KB Output is correct
30 Correct 23 ms 592 KB Output is correct
31 Correct 14 ms 596 KB Output is correct
32 Correct 17 ms 344 KB Output is correct
33 Correct 16 ms 852 KB Output is correct
34 Correct 12 ms 608 KB Output is correct
35 Correct 16 ms 600 KB Output is correct
36 Correct 16 ms 436 KB Output is correct
37 Correct 17 ms 440 KB Output is correct
38 Correct 17 ms 600 KB Output is correct
39 Correct 19 ms 444 KB Output is correct
40 Correct 17 ms 440 KB Output is correct
41 Correct 11 ms 344 KB Output is correct

Subtask #3
71.02 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 17 ms 608 KB Output is correct
8 Correct 20 ms 464 KB Output is correct
9 Correct 20 ms 444 KB Output is correct
10 Partially correct 34 ms 436 KB Output is partially correct
11 Correct 13 ms 416 KB Output is correct
12 Correct 35 ms 444 KB Output is correct
13 Partially correct 31 ms 672 KB Output is partially correct
14 Partially correct 32 ms 692 KB Output is partially correct
15 Correct 26 ms 344 KB Output is correct
16 Correct 29 ms 440 KB Output is correct
17 Correct 24 ms 428 KB Output is correct
18 Correct 32 ms 440 KB Output is correct
19 Partially correct 31 ms 692 KB Output is partially correct
20 Correct 24 ms 448 KB Output is correct
21 Partially correct 36 ms 440 KB Output is partially correct
22 Partially correct 27 ms 440 KB Output is partially correct
23 Partially correct 36 ms 440 KB Output is partially correct
24 Partially correct 32 ms 440 KB Output is partially correct
25 Correct 29 ms 692 KB Output is correct
26 Correct 16 ms 600 KB Output is correct
27 Correct 19 ms 428 KB Output is correct
28 Correct 22 ms 668 KB Output is correct
29 Correct 26 ms 416 KB Output is correct
30 Correct 16 ms 428 KB Output is correct
31 Partially correct 24 ms 464 KB Output is partially correct
32 Partially correct 39 ms 684 KB Output is partially correct
33 Partially correct 43 ms 684 KB Output is partially correct
34 Partially correct 36 ms 460 KB Output is partially correct
35 Correct 23 ms 432 KB Output is correct
36 Correct 30 ms 592 KB Output is correct
37 Partially correct 31 ms 616 KB Output is partially correct
38 Partially correct 43 ms 440 KB Output is partially correct
39 Correct 25 ms 600 KB Output is correct
40 Correct 25 ms 448 KB Output is correct
41 Correct 24 ms 432 KB Output is correct
42 Correct 18 ms 428 KB Output is correct
43 Correct 7 ms 436 KB Output is correct
44 Correct 34 ms 432 KB Output is correct
45 Correct 29 ms 584 KB Output is correct
46 Correct 17 ms 664 KB Output is correct
47 Correct 29 ms 440 KB Output is correct
48 Correct 18 ms 612 KB Output is correct