oj.uz

답안 #630826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630826 2022-08-17T07:21:22 Z uncripted 드문 곤충 (IOI22_insects) C++17
10 / 100
 404 ms 492 KB 
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;

#define pb push_back	
vector<int> v;
void cler(){
	for(int i=0; i<v.size(); i++){
		move_outside(v[i]);
	}
}
int min_cardinality(int N) {
	int n=0;

	for(int i=0; i<N; i++){
		move_inside(i);
		n++;
		if(press_button()>1){
			move_outside(i);
			n--;
		}else{
			v.pb(i);
		}
	}
	if(n<=50){
		vector<int> dif;
		int m[N+1];
		dif.pb(0);
		for(int i=0; i<N; i++){
			m[i]=0;
		}
		m[0]=1;
		for(int i=1; i<N; i++){	
		move_inside(i);
		bool f=false;
			for(int j=0; j<dif.size(); j++){
			
			
				move_inside(dif[j]);
			//	cout<<press_button()<<" "<<i<<endl;
				if(press_button()>1){
					m[j]++;
					f=true;
					move_outside(dif[j]);
					break;
				}
				move_outside(dif[j]);
			}
			if(f==false){
				dif.pb(i);
				m[dif.size()-1]++;
			}
			move_outside(i);
		}
		int minn=INT_MAX;
		for(int i=0; i<dif.size(); i++){
	//		cout<<m[i]<<" m "<<dif[i]<<endl;
			minn=min(minn, m[i]);
		}
		return minn;
	}else{
		int l=1,r=2000;
		while(l<r){
			cler();
			int m=(l+r+1)/2;
		//	cout<<m<<endl;
			int siz=0;
		
			for(int i=0; i<N; i++){
				move_inside(i);	
				siz++;
				if(press_button()>m){
					move_outside(i);
					siz--;
				}
			}
			if(siz!=n*m){
				r=m-1;
			}else{
				l=m;
			}
		}
		return l;	
	}

}

Compilation message

insects.cpp: In function 'void cler()':
insects.cpp:8:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for(int i=0; i<v.size(); i++){
      |               ~^~~~~~~~~
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:36:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |    for(int j=0; j<dif.size(); j++){
      |                 ~^~~~~~~~~~~
insects.cpp:56:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for(int i=0; i<dif.size(); i++){
      |                ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 26 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 11 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 18 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 15 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 19 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 44 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 24 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 26 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 11 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 18 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 15 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 19 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 44 ms 208 KB Output is correct
21 Correct 15 ms 208 KB Output is correct
22 Correct 24 ms 208 KB Output is correct
23 Correct 18 ms 316 KB Output is correct
24 Correct 112 ms 352 KB Output is correct
25 Correct 134 ms 208 KB Output is correct
26 Correct 101 ms 236 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 115 ms 208 KB Output is correct
29 Correct 20 ms 208 KB Output is correct
30 Correct 108 ms 216 KB Output is correct
31 Correct 18 ms 208 KB Output is correct
32 Correct 27 ms 208 KB Output is correct
33 Correct 53 ms 280 KB Output is correct
34 Correct 67 ms 208 KB Output is correct
35 Correct 114 ms 208 KB Output is correct
36 Correct 70 ms 300 KB Output is correct
37 Correct 276 ms 300 KB Output is correct
38 Incorrect 101 ms 256 KB Wrong answer.
39 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 248 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 39 ms 308 KB Output is correct
8 Partially correct 135 ms 492 KB Output is partially correct
9 Incorrect 404 ms 280 KB Too many queries.
10 Halted 0 ms 0 KB -