답안 #825646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
825646	2023-08-15T06:52:33 Z	becaido	드문 곤충 (IOI22_insects)	C++17	85.01 / 100	85 ms	360 KB

insects

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "insects.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

#ifdef WAIMAI
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N);
#endif

const int SIZE = 2005;
const int K = 6;

map<int, int> mp;
int tag[SIZE], in[SIZE];

int min_cardinality(int N) {
    int sz = 0;
    FOR (i, 0, N - 1) {
        move_inside(i);
        int mx = press_button();
        if (mx == 2) move_outside(i);
        else {
            in[i] = 1;
            tag[i] = 1;
            sz++;
        }
    }
    mp[1] = sz;

    auto cal = [&](int lim) {
        if (mp.count(lim)) return mp[lim];
        int cnt = 0;
        FOR (i, 0, N - 1) if (in[i] && tag[i] > lim) {
            move_outside(i);
            in[i] = 0;
        }
        FOR (i, 0, N - 1) if (!in[i]) {
            move_inside(i);
            int mx = press_button();
            if (mx > lim) move_outside(i);
            else {
                in[i] = 1;
                tag[i] = mx;
            }
        }
        FOR (i, 0, N - 1) cnt += in[i];
        return mp[lim] = cnt;
    };

    int l = 1, r = K;
    while (r < N / sz && cal(r) == r * sz) {
        l *= K;
        r *= K;
        r = min(r, N / sz);
    }
    while (l < r) {
        int mid = (l + r) / 2 + 1;
        if (cal(mid) == mid * sz) l = mid;
        else r = mid - 1;
    }
    return l;
}

/*
in1
6
5 8 9 5 9 9
out1
1
7
*/

#ifdef WAIMAI
static inline constexpr int kMaxQueries = 40000;

static int N;
// Insect types are compressed to colors in the range [0, N).
static vector<int> color;
static vector<bool> in_box;

static vector<int> color_occurrences;
static multiset<int> max_occurrences;

static vector<int> op_counter(3, 0);

static inline void protocol_violation(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 main() {
  assert(1 == scanf("%d", &N));
  color.resize(N);
  in_box.assign(N, false);

  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 = *max_element(op_counter.begin(), op_counter.end());
  printf("%d\n", answer);
  printf("%d\n", Q);
  return 0;
}
#endif

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	5 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	5 ms	304 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	6 ms	208 KB	Output is correct
13	Correct	7 ms	208 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Correct	4 ms	208 KB	Output is correct
16	Correct	5 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	3 ms	208 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	5 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	5 ms	304 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	6 ms	208 KB	Output is correct
13	Correct	7 ms	208 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Correct	4 ms	208 KB	Output is correct
16	Correct	5 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct
23	Correct	31 ms	284 KB	Output is correct
24	Correct	6 ms	312 KB	Output is correct
25	Correct	13 ms	300 KB	Output is correct
26	Correct	31 ms	288 KB	Output is correct
27	Correct	20 ms	304 KB	Output is correct
28	Correct	9 ms	208 KB	Output is correct
29	Correct	27 ms	304 KB	Output is correct
30	Correct	30 ms	208 KB	Output is correct
31	Correct	31 ms	208 KB	Output is correct
32	Correct	31 ms	292 KB	Output is correct
33	Correct	30 ms	284 KB	Output is correct
34	Correct	28 ms	208 KB	Output is correct
35	Correct	23 ms	252 KB	Output is correct
36	Correct	19 ms	208 KB	Output is correct
37	Correct	14 ms	208 KB	Output is correct
38	Correct	24 ms	304 KB	Output is correct
39	Correct	22 ms	208 KB	Output is correct
40	Correct	16 ms	308 KB	Output is correct
41	Correct	11 ms	208 KB	Output is correct

Subtask #3
60.01 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	308 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	74 ms	300 KB	Output is partially correct
8	Correct	17 ms	208 KB	Output is correct
9	Partially correct	39 ms	208 KB	Output is partially correct
10	Partially correct	85 ms	208 KB	Output is partially correct
11	Partially correct	51 ms	208 KB	Output is partially correct
12	Correct	22 ms	304 KB	Output is correct
13	Partially correct	69 ms	208 KB	Output is partially correct
14	Partially correct	68 ms	256 KB	Output is partially correct
15	Partially correct	58 ms	284 KB	Output is partially correct
16	Partially correct	53 ms	288 KB	Output is partially correct
17	Partially correct	62 ms	284 KB	Output is partially correct
18	Partially correct	49 ms	284 KB	Output is partially correct
19	Partially correct	66 ms	304 KB	Output is partially correct
20	Partially correct	62 ms	288 KB	Output is partially correct
21	Partially correct	64 ms	284 KB	Output is partially correct
22	Partially correct	62 ms	288 KB	Output is partially correct
23	Partially correct	53 ms	208 KB	Output is partially correct
24	Partially correct	44 ms	292 KB	Output is partially correct
25	Correct	38 ms	292 KB	Output is correct
26	Correct	30 ms	208 KB	Output is correct
27	Partially correct	48 ms	296 KB	Output is partially correct
28	Partially correct	30 ms	288 KB	Output is partially correct
29	Partially correct	56 ms	288 KB	Output is partially correct
30	Partially correct	30 ms	208 KB	Output is partially correct
31	Partially correct	68 ms	304 KB	Output is partially correct
32	Partially correct	64 ms	284 KB	Output is partially correct
33	Partially correct	67 ms	208 KB	Output is partially correct
34	Partially correct	46 ms	288 KB	Output is partially correct
35	Partially correct	46 ms	300 KB	Output is partially correct
36	Partially correct	44 ms	292 KB	Output is partially correct
37	Partially correct	66 ms	360 KB	Output is partially correct
38	Partially correct	67 ms	292 KB	Output is partially correct
39	Correct	44 ms	288 KB	Output is correct
40	Correct	41 ms	288 KB	Output is correct
41	Partially correct	59 ms	288 KB	Output is partially correct
42	Partially correct	43 ms	288 KB	Output is partially correct
43	Partially correct	22 ms	208 KB	Output is partially correct
44	Partially correct	44 ms	288 KB	Output is partially correct
45	Partially correct	59 ms	288 KB	Output is partially correct
46	Correct	35 ms	208 KB	Output is correct
47	Correct	35 ms	288 KB	Output is correct
48	Correct	31 ms	304 KB	Output is correct

답안 #825646

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 60.01 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
60.01 / 75.0