oj.uz

답안 #988502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988502 2024-05-25T04:24:26 Z cnn008 드문 곤충 (IOI22_insects) C++17
0 / 100
 6 ms 600 KB 
#include "bits/stdc++.h"
using namespace std;

#include "insects.h";

#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif

#define ll long long

const int N=1e5+5;
const int mod=1e9+7;

int cad,vis[1005],type;
int min_cardinality(int n){
	for(int i=0; i<n; i++){
		move_inside(i);
		if(press_button()>cad) cad++,vis[i]=1;
		else move_outside(i);
	}
	for(int i=0; i<n; i++){
		if(vis[i]){
			vis[i]=0;
			move_outside(i);
		}
	}
	if(cad<=30){
		for(int i=0; i<n; i++){
			if(!vis[i]){
				vis[i]=++type;
				move_inside(i);
				for(int j=i+1; j<n; j++){
					move_inside(j);
					int val=press_button();
					if(val==2) vis[j]=type;
					move_outside(j);
				}
				move_outside(i);
			}
		}
		map <int,int> mp;
		for(int i=0; i<n; i++) mp[vis[i]]++;
		int ans=INT_MAX;
		for(auto [x,y]:mp) ans=min(ans,y);
		return ans;
	}else{
		int cnt=0;
		for(int i=0; i<n; i++){
			if(!vis[i]){
				cnt++;
				vis[i]=++type;
				move_inside(i);
				int sz=1;
				for(int j=i+1; j<n; j++){
					assert(j<n);
					move_inside(j);
					if(press_button()>sz){
						sz++;
						vis[j]=type;
					}else move_outside(j);
				}
				if(press_button()<cad) return cnt;
				move_outside(i);
				for(int j=i+1; j<n; j++) if(vis[j]==type) move_outside(j);
			}
		}
	}
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:4:21: warning: extra tokens at end of #include directive
    4 | #include "insects.h";
      |                     ^
insects.cpp:72:9: warning: "/*" within comment [-Wcomment]
   72 | /**  /\_/\
      |          
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
   71 | }
      | ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Incorrect 3 ms 344 KB Integer 199 violates the range [0, 198]
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Incorrect 3 ms 344 KB Integer 199 violates the range [0, 198]
7 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Runtime error 6 ms 600 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -