oj.uz

답안 #636543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
636543 2022-08-29T13:58:34 Z MohamedAliSaidane 드문 곤충 (IOI22_insects) C++17
99.89 / 100
 65 ms 576 KB 
#include<bits/stdc++.h>
#include "insects.h"
#include <ext/pb_ds/assoc_container.hpp>
        using namespace __gnu_pbds;
        using namespace std;

        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

        typedef long long ll;
        typedef long double ld;

        //#define int ll

        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;

        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;

        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second



        int nx[8] = {0,0,1,-1, 1, 1, -1, -1}, ny[8] = {1,-1,0,0, 1, -1, 1, -1};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}

        const ll MOD = 1e9 + 7;
        ll  mod(ll x, ll m = MOD){return (x + m)%m;}
        /*
        int press_button();
        void move_inside(int i );
        void move_outside(int i);
        */
        int min_cardinality(int n)
        {
            mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
            int T = 0;
            set<int> machine;
            for(int i = 0; i < n; i++)
            {
                move_inside(i);
                machine.insert(i);
                if(press_button() > 1)
                {
                    machine.erase(i);
                    move_outside(i);
                }
                else
                {
                    T++;
                }
            }
            if(T == n)
                return 1;
            if(T == 1)
                return n;
            set<int> vis;
            vis.insert(1); vis.insert(n);
            vi s[n + 1];
            for(auto e: machine)
                s[1].pb(e);
            for(int i = 0; i < n; i++)
                s[n].pb(i);
            int debut = 2;
            int fin = n/T;
            int rep = 1;
            while(debut <= fin)
            {
                int mid = (debut + fin)/2;
                int nxt = *(vis.lower_bound(mid));
                set<int> just_added ;
                int cnt = 0;
                shuffle(all(s[nxt]), rng);
                for(auto e: s[nxt])
                {
                    if(machine.count(e) == 0)
                    {
                        move_inside(e);
                        machine.insert(e);
                        if(press_button() > mid)
                        {
                            move_outside(e);
                            machine.erase(e);
                        }
                        else
                        {
                            just_added.insert(e);
                            cnt++;
                        }
                    }
                    else
                        cnt++;
                }
                vis.insert(mid);
                for(auto e: machine)
                    s[mid].pb(e);
                if(cnt >= mid * T)
                {
                    rep = mid;
                    debut = mid + 1;
                }
                else
                {
                    fin = mid - 1;
                    for(auto e: just_added)
                        machine.erase(e), move_outside(e);
                }
            }
            return rep;
        }

/*
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 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:207:1: warning: "/*" within comment [-Wcomment]
  207 | /*
      |

Subtask #1
10.0 / 10.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 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 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 6 ms 240 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 6 ms 300 KB Output is correct
15 Correct 7 ms 300 KB Output is correct
16 Correct 5 ms 316 KB Output is correct
17 Correct 4 ms 308 KB Output is correct
18 Correct 3 ms 312 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.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 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 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 6 ms 240 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 6 ms 300 KB Output is correct
15 Correct 7 ms 300 KB Output is correct
16 Correct 5 ms 316 KB Output is correct
17 Correct 4 ms 308 KB Output is correct
18 Correct 3 ms 312 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 11 ms 324 KB Output is correct
25 Correct 29 ms 360 KB Output is correct
26 Correct 20 ms 284 KB Output is correct
27 Correct 27 ms 336 KB Output is correct
28 Correct 8 ms 316 KB Output is correct
29 Correct 28 ms 296 KB Output is correct
30 Correct 22 ms 336 KB Output is correct
31 Correct 26 ms 292 KB Output is correct
32 Correct 26 ms 336 KB Output is correct
33 Correct 23 ms 360 KB Output is correct
34 Correct 31 ms 292 KB Output is correct
35 Correct 21 ms 496 KB Output is correct
36 Correct 26 ms 328 KB Output is correct
37 Correct 24 ms 356 KB Output is correct
38 Correct 22 ms 424 KB Output is correct
39 Correct 20 ms 356 KB Output is correct
40 Correct 7 ms 304 KB Output is correct
41 Correct 10 ms 328 KB Output is correct

Subtask #3
74.89 / 75.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 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 16 ms 208 KB Output is correct
8 Correct 16 ms 356 KB Output is correct
9 Correct 57 ms 544 KB Output is correct
10 Correct 43 ms 448 KB Output is correct
11 Correct 50 ms 296 KB Output is correct
12 Correct 19 ms 308 KB Output is correct
13 Correct 56 ms 292 KB Output is correct
14 Correct 47 ms 424 KB Output is correct
15 Correct 64 ms 456 KB Output is correct
16 Correct 65 ms 420 KB Output is correct
17 Correct 61 ms 424 KB Output is correct
18 Correct 55 ms 428 KB Output is correct
19 Partially correct 52 ms 424 KB Output is partially correct
20 Correct 43 ms 444 KB Output is correct
21 Correct 55 ms 460 KB Output is correct
22 Correct 59 ms 428 KB Output is correct
23 Correct 40 ms 556 KB Output is correct
24 Correct 46 ms 456 KB Output is correct
25 Correct 21 ms 576 KB Output is correct
26 Correct 16 ms 320 KB Output is correct
27 Correct 56 ms 424 KB Output is correct
28 Correct 59 ms 452 KB Output is correct
29 Partially correct 61 ms 408 KB Output is partially correct
30 Partially correct 53 ms 424 KB Output is partially correct
31 Correct 50 ms 424 KB Output is correct
32 Correct 34 ms 420 KB Output is correct
33 Correct 56 ms 332 KB Output is correct
34 Correct 60 ms 416 KB Output is correct
35 Partially correct 56 ms 436 KB Output is partially correct
36 Partially correct 45 ms 444 KB Output is partially correct
37 Correct 60 ms 456 KB Output is correct
38 Correct 59 ms 560 KB Output is correct
39 Correct 29 ms 432 KB Output is correct
40 Correct 55 ms 428 KB Output is correct
41 Partially correct 52 ms 352 KB Output is partially correct
42 Partially correct 56 ms 456 KB Output is partially correct
43 Correct 16 ms 296 KB Output is correct
44 Correct 36 ms 292 KB Output is correct
45 Correct 42 ms 456 KB Output is correct
46 Correct 30 ms 308 KB Output is correct
47 Correct 29 ms 404 KB Output is correct
48 Correct 31 ms 400 KB Output is correct