답안 #977983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977983 2024-05-08T15:25:00 Z mircea_007 드문 곤충 (IOI22_insects) C++17
99.56 / 100
35 ms 920 KB
#include "insects.h"
#include <vector>
     
// void move_inside(int i)
// void move_outside(int i)
// int press_button()
     
// gaseste numarul de valori distincte in N operatii
int dist_val( int N ) {
  std::vector<bool> rem( N, false );
      
  int ret = 0;
  for( int i = 0 ; i < N ; i++ ){
    move_inside( i );
     
    if( press_button() > 1 )
      move_outside( i );
    else{
      ret++;
      rem[i] = true;
    }
  }
     
  // cleanup
  for( int i = 0 ; i < N ; i++ )
    if( rem[i] )
      move_outside( i );
     
  return ret;
}
     
bool at_least_x( std::vector<int> &poz, int x, int dist ) {
  int n = (int)poz.size();
  std::vector<bool> rem( n, false );
     
  int good_poz = 0;
  for( int i = 0 ; i < n ; i++ ){
    move_inside( poz[i] );
     
    if( press_button() > x )
      move_outside( poz[i] );
    else{
      rem[i] = true;
      good_poz++;
    }
  }
     
  // cleanup
  for( int i = 0 ; i < n ; i++ )
    if( rem[i] )
      move_outside( poz[i] );
     
  bool decision = (good_poz == dist * x); // min(freq) >= x
     
  int news = 0;
  for( int i = 0 ; i < n ; i++ )
    if( rem[i] != decision )
      poz[news++] = poz[i];
  poz.erase( poz.begin() + news, poz.end() );
     
  return decision;
}
     
int min_cardinality( int N ) {
  int dist = dist_val( N );
     
  std::vector<int> poz;
  for( int i = 0 ; i < N ; i++ )
    poz.push_back( i );
     
  int st = 0, dr = N / dist + 1;
  while( dr - st > 1 ){
    int mij = (st + dr) >> 1;
    int bias = (dr - st) / 50;

    mij -= bias;
     
    if( at_least_x( poz, mij - st, dist ) )
      st = mij;
    else
      dr = mij;
  }
     
  return st;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 424 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 424 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 13 ms 600 KB Output is correct
24 Correct 9 ms 600 KB Output is correct
25 Correct 13 ms 600 KB Output is correct
26 Correct 13 ms 600 KB Output is correct
27 Correct 13 ms 600 KB Output is correct
28 Correct 8 ms 600 KB Output is correct
29 Correct 17 ms 600 KB Output is correct
30 Correct 13 ms 600 KB Output is correct
31 Correct 13 ms 424 KB Output is correct
32 Correct 15 ms 600 KB Output is correct
33 Correct 15 ms 600 KB Output is correct
34 Correct 13 ms 420 KB Output is correct
35 Correct 12 ms 600 KB Output is correct
36 Correct 13 ms 600 KB Output is correct
37 Correct 13 ms 600 KB Output is correct
38 Correct 13 ms 344 KB Output is correct
39 Correct 14 ms 672 KB Output is correct
40 Correct 14 ms 424 KB Output is correct
41 Correct 10 ms 660 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Partially correct 31 ms 608 KB Output is partially correct
8 Correct 18 ms 592 KB Output is correct
9 Correct 28 ms 600 KB Output is correct
10 Correct 25 ms 656 KB Output is correct
11 Correct 23 ms 592 KB Output is correct
12 Correct 22 ms 600 KB Output is correct
13 Correct 30 ms 432 KB Output is correct
14 Correct 29 ms 848 KB Output is correct
15 Partially correct 35 ms 656 KB Output is partially correct
16 Partially correct 26 ms 592 KB Output is partially correct
17 Partially correct 27 ms 668 KB Output is partially correct
18 Partially correct 32 ms 664 KB Output is partially correct
19 Partially correct 24 ms 652 KB Output is partially correct
20 Partially correct 32 ms 416 KB Output is partially correct
21 Correct 31 ms 920 KB Output is correct
22 Correct 24 ms 916 KB Output is correct
23 Correct 25 ms 500 KB Output is correct
24 Correct 23 ms 432 KB Output is correct
25 Correct 25 ms 592 KB Output is correct
26 Correct 19 ms 416 KB Output is correct
27 Partially correct 30 ms 412 KB Output is partially correct
28 Partially correct 27 ms 592 KB Output is partially correct
29 Partially correct 35 ms 660 KB Output is partially correct
30 Partially correct 23 ms 600 KB Output is partially correct
31 Correct 26 ms 424 KB Output is correct
32 Correct 26 ms 600 KB Output is correct
33 Correct 26 ms 656 KB Output is correct
34 Correct 32 ms 400 KB Output is correct
35 Partially correct 25 ms 656 KB Output is partially correct
36 Partially correct 27 ms 672 KB Output is partially correct
37 Correct 22 ms 420 KB Output is correct
38 Correct 27 ms 652 KB Output is correct
39 Partially correct 26 ms 664 KB Output is partially correct
40 Partially correct 30 ms 420 KB Output is partially correct
41 Partially correct 25 ms 656 KB Output is partially correct
42 Partially correct 29 ms 416 KB Output is partially correct
43 Correct 8 ms 420 KB Output is correct
44 Correct 18 ms 600 KB Output is correct
45 Partially correct 29 ms 664 KB Output is partially correct
46 Correct 24 ms 432 KB Output is correct
47 Correct 22 ms 416 KB Output is correct
48 Correct 24 ms 608 KB Output is correct