oj.uz

Submission #627484

# Submission time Handle Problem Language Result Execution time Memory
627484 2022-08-12T15:33:42 Z inwbear Rarest Insects (IOI22_insects) C++17
25 / 100
 321 ms 448 KB 
#include "insects.h"
#include<bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;

int cc[2005],re,sq;
pair<int,int>pos[2005];
bool ins[2005];

int min_cardinality(int N) {
  re=N;
  vector<int>v;
  vector<pair<int,int> >fr;
  for(int i=0;i<N;i++){
    move_inside(i);
    if(press_button()>1){
      move_outside(i);
      fr.pb({i,false});
    }
    else v.pb(i),ins[i]=true;
  }
  if(v.size()!=(int)sqrt(v.size())*(int)sqrt(v.size()))sq=(int)sqrt(v.size())+1;
  else sq=(int)sqrt(v.size());
  for(int i=0;i<v.size();i++)move_outside(v[i]);
  for(int i=0;i<v.size();i+=sq){
    for(int j=i;j<v.size()&&j<i+sq;j++){
      move_inside(v[j]);
    }
    for(int j=0;j<fr.size();j++){
      if(fr[j].S)continue;
      move_inside(fr[j].F);
      if(press_button()>1){
        fr[j].S=true;
        pos[fr[j].F].F=i/sq;
      }
      move_outside(fr[j].F);
    }
    for(int j=i;j<v.size()&&j<i+sq;j++){
      move_outside(v[j]);
    }
  }
  for(int i=0;i<sq;i++){
    for(int j=i;j<v.size();j+=sq){
      move_inside(v[j]);
    }
    for(int j=0;j<fr.size();j++){
      if(!fr[j].S)continue;
      move_inside(fr[j].F);
      if(press_button()>1){
        fr[j].S=false;
        pos[fr[j].F].S=i;
      }
      move_outside(fr[j].F);
    }
    for(int j=i;j<v.size();j+=sq){
      move_inside(v[j]);
    }
  }
  //for(int i=0;i<v.size();i++)printf("{%d}",v[i]);
  //for(int i=0;i<fr.size();i++)printf("[%d %d]",pos[fr[i].F].F,pos[fr[i].F].S);
  for(int i=0;i<fr.size();i++){
    cc[v[(pos[fr[i].F].F*sq)+pos[fr[i].F].S]]++;
  }
  for(int i=0;i<v.size();i++)re=min(re,cc[v[i]]+1);
  return re;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:24:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |   if(v.size()!=(int)sqrt(v.size())*(int)sqrt(v.size()))sq=(int)sqrt(v.size())+1;
      |      ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
insects.cpp:26:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for(int i=0;i<v.size();i++)move_outside(v[i]);
      |               ~^~~~~~~~~
insects.cpp:27:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for(int i=0;i<v.size();i+=sq){
      |               ~^~~~~~~~~
insects.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int j=i;j<v.size()&&j<i+sq;j++){
      |                 ~^~~~~~~~~
insects.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int j=0;j<fr.size();j++){
      |                 ~^~~~~~~~~~
insects.cpp:40:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int j=i;j<v.size()&&j<i+sq;j++){
      |                 ~^~~~~~~~~
insects.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int j=i;j<v.size();j+=sq){
      |                 ~^~~~~~~~~
insects.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int j=0;j<fr.size();j++){
      |                 ~^~~~~~~~~~
insects.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int j=i;j<v.size();j+=sq){
      |                 ~^~~~~~~~~
insects.cpp:63:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for(int i=0;i<fr.size();i++){
      |               ~^~~~~~~~~~
insects.cpp:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   for(int i=0;i<v.size();i++)re=min(re,cc[v[i]]+1);
      |               ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 260 KB Output is correct
6 Correct 7 ms 312 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 11 ms 312 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 6 ms 320 KB Output is correct
11 Correct 10 ms 312 KB Output is correct
12 Correct 8 ms 312 KB Output is correct
13 Correct 8 ms 316 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 11 ms 316 KB Output is correct
17 Correct 10 ms 312 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 13 ms 320 KB Output is correct
20 Correct 20 ms 312 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 11 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 260 KB Output is correct
6 Correct 7 ms 312 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 11 ms 312 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 6 ms 320 KB Output is correct
11 Correct 10 ms 312 KB Output is correct
12 Correct 8 ms 312 KB Output is correct
13 Correct 8 ms 316 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 11 ms 316 KB Output is correct
17 Correct 10 ms 312 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 13 ms 320 KB Output is correct
20 Correct 20 ms 312 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 11 ms 208 KB Output is correct
23 Correct 31 ms 308 KB Output is correct
24 Correct 8 ms 316 KB Output is correct
25 Correct 75 ms 308 KB Output is correct
26 Correct 33 ms 208 KB Output is correct
27 Correct 22 ms 320 KB Output is correct
28 Correct 30 ms 304 KB Output is correct
29 Correct 20 ms 324 KB Output is correct
30 Correct 81 ms 316 KB Output is correct
31 Correct 26 ms 316 KB Output is correct
32 Correct 50 ms 324 KB Output is correct
33 Correct 51 ms 336 KB Output is correct
34 Correct 37 ms 320 KB Output is correct
35 Correct 42 ms 316 KB Output is correct
36 Correct 33 ms 320 KB Output is correct
37 Correct 87 ms 316 KB Output is correct
38 Correct 104 ms 312 KB Output is correct
39 Correct 120 ms 320 KB Output is correct
40 Correct 92 ms 316 KB Output is correct
41 Correct 79 ms 320 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Partially correct 0 ms 208 KB Output is partially correct
3 Partially correct 1 ms 208 KB Output is partially correct
4 Partially correct 0 ms 208 KB Output is partially correct
5 Partially correct 1 ms 208 KB Output is partially correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 53 ms 320 KB Output is correct
8 Partially correct 22 ms 316 KB Output is partially correct
9 Partially correct 91 ms 332 KB Output is partially correct
10 Partially correct 99 ms 332 KB Output is partially correct
11 Correct 48 ms 328 KB Output is correct
12 Partially correct 38 ms 308 KB Output is partially correct
13 Partially correct 61 ms 348 KB Output is partially correct
14 Partially correct 153 ms 328 KB Output is partially correct
15 Partially correct 81 ms 332 KB Output is partially correct
16 Partially correct 79 ms 448 KB Output is partially correct
17 Partially correct 87 ms 336 KB Output is partially correct
18 Partially correct 100 ms 324 KB Output is partially correct
19 Partially correct 124 ms 448 KB Output is partially correct
20 Partially correct 79 ms 320 KB Output is partially correct
21 Partially correct 133 ms 320 KB Output is partially correct
22 Partially correct 215 ms 336 KB Output is partially correct
23 Partially correct 235 ms 336 KB Output is partially correct
24 Partially correct 286 ms 312 KB Output is partially correct
25 Partially correct 321 ms 336 KB Output is partially correct
26 Partially correct 197 ms 328 KB Output is partially correct
27 Partially correct 164 ms 336 KB Output is partially correct
28 Partially correct 86 ms 332 KB Output is partially correct
29 Partially correct 156 ms 332 KB Output is partially correct
30 Partially correct 137 ms 348 KB Output is partially correct
31 Partially correct 182 ms 336 KB Output is partially correct
32 Partially correct 101 ms 340 KB Output is partially correct
33 Partially correct 138 ms 324 KB Output is partially correct
34 Partially correct 115 ms 340 KB Output is partially correct
35 Partially correct 105 ms 320 KB Output is partially correct
36 Partially correct 196 ms 316 KB Output is partially correct
37 Partially correct 87 ms 328 KB Output is partially correct
38 Partially correct 213 ms 328 KB Output is partially correct
39 Partially correct 179 ms 324 KB Output is partially correct
40 Partially correct 219 ms 324 KB Output is partially correct
41 Partially correct 226 ms 340 KB Output is partially correct
42 Partially correct 112 ms 328 KB Output is partially correct
43 Partially correct 23 ms 316 KB Output is partially correct
44 Partially correct 68 ms 308 KB Output is partially correct
45 Partially correct 30 ms 336 KB Output is partially correct
46 Partially correct 48 ms 320 KB Output is partially correct
47 Incorrect 290 ms 308 KB Too many queries.
48 Halted 0 ms 0 KB -