oj.uz

답안 #710392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710392 2023-03-15T08:05:43 Z myrcella 드문 곤충 (IOI22_insects) C++17
10 / 100
 371 ms 316 KB 
//by szh
#include<bits/stdc++.h>
#include "insects.h"
using namespace std;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
 
const int maxn = 2010;
int typ[maxn];
bool in[maxn];
int cnt[maxn];
/*
const 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) {
	int cur = 0;
	rep(i,0,N) {
		move_inside(i);
      	in[i]=true;
		int tmp = press_button();
		if (tmp==1) typ[i]=cur++;
		else rep(j,0,i) {
			if (!in[j]) continue;
			move_outside(j);
			tmp = press_button();
			if (tmp!=1) move_inside(j);
			else {
				typ[i] = typ[j];
              in[j]=false;
				break;
			}
		}
		cnt[typ[i]]++;
	}
	int ret = N;
	rep(i,0,cur) ret = min(ret,cnt[i]);
  return ret;
}
/*
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 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 4 ms 316 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 16 ms 288 KB Output is correct
9 Correct 17 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 46 ms 288 KB Output is correct
12 Correct 7 ms 312 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 13 ms 208 KB Output is correct
17 Correct 12 ms 296 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 9 ms 288 KB Output is correct
20 Correct 28 ms 288 KB Output is correct
21 Correct 40 ms 208 KB Output is correct
22 Correct 32 ms 208 KB Output is correct

Subtask #2
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 4 ms 316 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 16 ms 288 KB Output is correct
9 Correct 17 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 46 ms 288 KB Output is correct
12 Correct 7 ms 312 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 13 ms 208 KB Output is correct
17 Correct 12 ms 296 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 9 ms 288 KB Output is correct
20 Correct 28 ms 288 KB Output is correct
21 Correct 40 ms 208 KB Output is correct
22 Correct 32 ms 208 KB Output is correct
23 Correct 18 ms 316 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 129 ms 292 KB Output is correct
26 Correct 105 ms 292 KB Output is correct
27 Correct 23 ms 208 KB Output is correct
28 Incorrect 321 ms 292 KB Too many queries.
29 Halted 0 ms 0 KB -

Subtask #3
0 / 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 44 ms 316 KB Output is correct
8 Correct 20 ms 208 KB Output is correct
9 Incorrect 371 ms 208 KB Too many queries.
10 Halted 0 ms 0 KB -