oj.uz

답안 #1065643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065643 2024-08-19T10:19:21 Z SalihSahin 드문 곤충 (IOI22_insects) C++17
0 / 100
 30 ms 600 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> rem, nrem, out, 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);
        rem.pb(i);
        colcnt--;
      }
   }

   if(colcnt == 1){
    return N;
   }

   int bt = 0, x = 1;
   while(x*2 < N/colcnt){
     x *= 2;
     bt++;
   }
 
   int ans = 1, nxtadd = 0;
   for(int i = bt; i >= 0; i--){
      int val = (1 << i);
 
      int cnt = nxtadd;
      nxtadd = 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{
        if(i == 0){
          for(auto itr: nrem) move_outside(itr);
          rem = nrem;
        }
        else{
          int nxtval = (1 << (i-1));
          rem.clear();
          nxtadd = min((int)nrem.size(), nxtval-1);
          for(int j = nxtval-1; j < nrem.size(); j++){
            rem.pb(nrem[j]);
            move_outside(nrem[j]);
          }
        }
      }
      nrem.clear();
      out.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;
}
*/

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:122:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |           for(int j = nxtval-1; j < nrem.size(); j++){
      |                                 ~~^~~~~~~~~~~~~

Subtask #1
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 2 ms 356 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Incorrect 5 ms 344 KB Wrong answer.
13 Halted 0 ms 0 KB -

Subtask #2
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 2 ms 356 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Incorrect 5 ms 344 KB Wrong answer.
13 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 26 ms 444 KB Output is correct
10 Partially correct 30 ms 344 KB Output is partially correct
11 Correct 29 ms 440 KB Output is correct
12 Correct 9 ms 440 KB Output is correct
13 Incorrect 21 ms 600 KB Wrong answer.
14 Halted 0 ms 0 KB -