oj.uz

Submission #627506

# Submission time Handle Problem Language Result Execution time Memory
627506 2022-08-12T15:57:23 Z inwbear Rarest Insects (IOI22_insects) C++17
42.91 / 100
 245 ms 464 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,rr;
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=sq;i<v.size();i+=sq){
    rr=0;
    for(int j=i;j<v.size()&&j<i+sq;j++){
      rr++;
      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;
        rr--;
        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]);
    }
    if(rr>0)return 1;
  }
  for(int j=0;j<fr.size();j++)fr[j].S=true;
  for(int i=1;i<sq;i++){
    rr=0;
    for(int j=i;j<v.size();j+=sq){
      move_inside(v[j]);
      rr++;
    }
    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;
        rr--;
      }
      move_outside(fr[j].F);
    }
    for(int j=i;j<v.size();j+=sq){
      move_inside(v[j]);
    }
    if(rr>0)return 1;
  }
  //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:17: 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=sq;i<v.size();i+=sq){
      |                ~^~~~~~~~~
insects.cpp:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int j=i;j<v.size()&&j<i+sq;j++){
      |                 ~^~~~~~~~~
insects.cpp:33: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]
   33 |     for(int j=0;j<fr.size();j++){
      |                 ~^~~~~~~~~~
insects.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int j=i;j<v.size()&&j<i+sq;j++){
      |                 ~^~~~~~~~~
insects.cpp:48: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]
   48 |   for(int j=0;j<fr.size();j++)fr[j].S=true;
      |               ~^~~~~~~~~~
insects.cpp:51:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int j=i;j<v.size();j+=sq){
      |                 ~^~~~~~~~~
insects.cpp:55: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]
   55 |     for(int j=0;j<fr.size();j++){
      |                 ~^~~~~~~~~~
insects.cpp:65:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int j=i;j<v.size();j+=sq){
      |                 ~^~~~~~~~~
insects.cpp:72: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]
   72 |   for(int i=0;i<fr.size();i++){
      |               ~^~~~~~~~~~
insects.cpp:75:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   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 1 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 3 ms 312 KB Output is correct
7 Correct 3 ms 308 KB Output is correct
8 Correct 12 ms 212 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 316 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 8 ms 312 KB Output is correct
19 Correct 12 ms 316 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 6 ms 208 KB Output is correct
22 Correct 3 ms 312 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 1 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 3 ms 312 KB Output is correct
7 Correct 3 ms 308 KB Output is correct
8 Correct 12 ms 212 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 316 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 8 ms 312 KB Output is correct
19 Correct 12 ms 316 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 6 ms 208 KB Output is correct
22 Correct 3 ms 312 KB Output is correct
23 Correct 10 ms 316 KB Output is correct
24 Correct 12 ms 312 KB Output is correct
25 Correct 69 ms 208 KB Output is correct
26 Correct 56 ms 316 KB Output is correct
27 Correct 19 ms 208 KB Output is correct
28 Correct 17 ms 208 KB Output is correct
29 Correct 26 ms 308 KB Output is correct
30 Correct 39 ms 316 KB Output is correct
31 Correct 26 ms 208 KB Output is correct
32 Correct 34 ms 208 KB Output is correct
33 Correct 41 ms 320 KB Output is correct
34 Correct 47 ms 208 KB Output is correct
35 Correct 42 ms 312 KB Output is correct
36 Correct 44 ms 208 KB Output is correct
37 Correct 58 ms 316 KB Output is correct
38 Correct 64 ms 312 KB Output is correct
39 Correct 123 ms 316 KB Output is correct
40 Correct 26 ms 320 KB Output is correct
41 Correct 14 ms 316 KB Output is correct

Subtask #3
17.91 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 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 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 21 ms 308 KB Output is correct
8 Correct 21 ms 208 KB Output is correct
9 Partially correct 116 ms 308 KB Output is partially correct
10 Partially correct 151 ms 324 KB Output is partially correct
11 Correct 32 ms 432 KB Output is correct
12 Correct 23 ms 316 KB Output is correct
13 Partially correct 66 ms 456 KB Output is partially correct
14 Partially correct 99 ms 324 KB Output is partially correct
15 Partially correct 69 ms 448 KB Output is partially correct
16 Partially correct 53 ms 448 KB Output is partially correct
17 Partially correct 93 ms 320 KB Output is partially correct
18 Partially correct 73 ms 440 KB Output is partially correct
19 Partially correct 70 ms 320 KB Output is partially correct
20 Partially correct 116 ms 328 KB Output is partially correct
21 Partially correct 140 ms 464 KB Output is partially correct
22 Partially correct 114 ms 332 KB Output is partially correct
23 Partially correct 189 ms 332 KB Output is partially correct
24 Partially correct 160 ms 324 KB Output is partially correct
25 Partially correct 103 ms 332 KB Output is partially correct
26 Correct 19 ms 312 KB Output is correct
27 Partially correct 129 ms 336 KB Output is partially correct
28 Partially correct 96 ms 344 KB Output is partially correct
29 Partially correct 65 ms 308 KB Output is partially correct
30 Partially correct 132 ms 328 KB Output is partially correct
31 Partially correct 151 ms 328 KB Output is partially correct
32 Partially correct 138 ms 332 KB Output is partially correct
33 Partially correct 213 ms 296 KB Output is partially correct
34 Partially correct 245 ms 428 KB Output is partially correct
35 Partially correct 179 ms 332 KB Output is partially correct
36 Partially correct 164 ms 332 KB Output is partially correct
37 Partially correct 91 ms 316 KB Output is partially correct
38 Partially correct 150 ms 320 KB Output is partially correct
39 Partially correct 115 ms 324 KB Output is partially correct
40 Partially correct 147 ms 316 KB Output is partially correct
41 Partially correct 173 ms 336 KB Output is partially correct
42 Partially correct 161 ms 316 KB Output is partially correct
43 Partially correct 21 ms 312 KB Output is partially correct
44 Correct 40 ms 328 KB Output is correct
45 Correct 21 ms 336 KB Output is correct
46 Correct 44 ms 312 KB Output is correct
47 Correct 26 ms 316 KB Output is correct
48 Correct 24 ms 316 KB Output is correct