답안 #1057886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057886	2024-08-14T07:08:43 Z	SalihSahin	드문 곤충 (IOI22_insects)	C++17	40.52 / 100	176 ms	696 KB

insects

#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) {
   vector<int> wh, nxtwh;
   vector<int> cik;

   int sz = 0;
   for(int i = 0; i < N; i++){
      move_inside(i);
      sz++;
      int val = press_button();
      if(val == 2){
        move_outside(i);
        wh.pb(i);
        sz--;
      }
      else cik.pb(i);
   }

   for(auto itr: cik){
    move_outside(itr);
   }
   cik.clear();

   if(sz > 35){
        int ans = 1;
        while(1){
           random_shuffle(wh.begin(), wh.end());
           int isz = 0;
           for(auto itr: wh){
              if(isz < sz){
                  move_inside(itr);
                  isz++;
                  int val = press_button();
                  if(val == 2){
                    move_outside(itr);
                    nxtwh.pb(itr);
                    isz--;
                  }
                  else cik.pb(itr);
              }
              else{
                  nxtwh.pb(itr);
              }
           }

           for(auto itr: cik) move_outside(itr);
           cik.clear();

           if(isz != sz){
              break;
           }
           else{
              ans++;
              wh = nxtwh;
              nxtwh.clear();
           }
       }

       return ans;
   }
   else{
      wh.clear();
      nxtwh.clear();
      for(int i = 0; i < N; i++){
          wh.pb(i);
      }
      random_shuffle(wh.begin(), wh.end());

      int sz = 0, ans = 2000;

      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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	9 ms	344 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	3 ms	432 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	436 KB	Output is correct
17	Correct	9 ms	612 KB	Output is correct
18	Correct	8 ms	344 KB	Output is correct
19	Correct	12 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	9 ms	344 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	3 ms	432 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	436 KB	Output is correct
17	Correct	9 ms	612 KB	Output is correct
18	Correct	8 ms	344 KB	Output is correct
19	Correct	12 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	9 ms	600 KB	Output is correct
24	Correct	4 ms	436 KB	Output is correct
25	Correct	103 ms	340 KB	Output is correct
26	Correct	77 ms	600 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	20 ms	600 KB	Output is correct
30	Correct	85 ms	344 KB	Output is correct
31	Correct	10 ms	436 KB	Output is correct
32	Correct	18 ms	344 KB	Output is correct
33	Correct	31 ms	696 KB	Output is correct
34	Correct	44 ms	344 KB	Output is correct
35	Correct	53 ms	440 KB	Output is correct
36	Correct	45 ms	344 KB	Output is correct
37	Correct	16 ms	600 KB	Output is correct
38	Correct	11 ms	444 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	6 ms	440 KB	Output is correct
41	Correct	6 ms	344 KB	Output is correct

Subtask #3

15.52 / 75.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	0 ms	344 KB	Output is correct
7	Correct	21 ms	440 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Partially correct	33 ms	592 KB	Output is partially correct
10	Partially correct	47 ms	600 KB	Output is partially correct
11	Correct	14 ms	600 KB	Output is correct
12	Correct	8 ms	344 KB	Output is correct
13	Partially correct	30 ms	440 KB	Output is partially correct
14	Correct	13 ms	344 KB	Output is correct
15	Partially correct	35 ms	608 KB	Output is partially correct
16	Partially correct	47 ms	344 KB	Output is partially correct
17	Partially correct	70 ms	452 KB	Output is partially correct
18	Partially correct	64 ms	592 KB	Output is partially correct
19	Partially correct	95 ms	600 KB	Output is partially correct
20	Partially correct	102 ms	344 KB	Output is partially correct
21	Partially correct	38 ms	432 KB	Output is partially correct
22	Partially correct	20 ms	344 KB	Output is partially correct
23	Correct	13 ms	604 KB	Output is correct
24	Correct	15 ms	696 KB	Output is correct
25	Correct	12 ms	344 KB	Output is correct
26	Correct	7 ms	340 KB	Output is correct
27	Partially correct	43 ms	600 KB	Output is partially correct
28	Partially correct	57 ms	600 KB	Output is partially correct
29	Partially correct	176 ms	604 KB	Output is partially correct
30	Partially correct	152 ms	452 KB	Output is partially correct
31	Partially correct	48 ms	344 KB	Output is partially correct
32	Partially correct	51 ms	600 KB	Output is partially correct
33	Correct	17 ms	448 KB	Output is correct
34	Correct	19 ms	596 KB	Output is correct
35	Partially correct	31 ms	600 KB	Output is partially correct
36	Partially correct	52 ms	344 KB	Output is partially correct
37	Partially correct	36 ms	424 KB	Output is partially correct
38	Partially correct	42 ms	444 KB	Output is partially correct
39	Partially correct	40 ms	440 KB	Output is partially correct
40	Partially correct	34 ms	436 KB	Output is partially correct
41	Partially correct	44 ms	440 KB	Output is partially correct
42	Partially correct	50 ms	604 KB	Output is partially correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	22 ms	600 KB	Output is correct
45	Correct	17 ms	344 KB	Output is correct
46	Correct	11 ms	344 KB	Output is correct
47	Correct	12 ms	344 KB	Output is correct
48	Correct	11 ms	344 KB	Output is correct