Submission #827123

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
827123	2023-08-16T08:58:42 Z	Amylopectin	Rarest Insects (IOI22_insects)	C++17	99.95 / 100	50 ms	432 KB

insects

#include "insects.h"
#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
const int mxn = 5e3 + 10;
int io[mxn] = {},nop[mxn] = {};
vector<int> cro,fno;
int min_cardinality(int n) 
{
  int i,j,cn,cm,fn,fm,cou = 0,cl,cr,mid,ndif,of;
  move_inside(0);
  io[0] = 1;
  cou ++;
  for(i=1; i<n; i++)
  {
    move_inside(i);
    cou ++;
    io[i] = 1;
    cn = press_button();
    if(cn == 2)
    {
      move_outside(i);
      io[i] = 0;
      cou --;
    }
  }
  cl = 1;
  cr = n / cou;
  ndif = cou;
  of = 0;
  while(cl < cr)
  {
    mid = (cl+cr) / 2 + (cl+cr) % 2;
    cro.clear();
    fno.clear();
    for(i=0; i<n; i++)
    {
      if(io[i] == 0 && nop[i] == 0)
      {
        move_inside(i);
        cou ++;
        io[i] = 1;
        cn = press_button();
        if(cn > mid)
        {
          fno.push_back(i);
          move_outside(i);
          io[i] = 0;
          cou --;
        }
        else 
        {
          cro.push_back(i);
        }
        if(mid * ndif == cou)
        {
          break;
        }
      }
    }
    if(mid * ndif == cou)
    {
      cl = mid;
      of = 0;
    }
    else 
    {
      for(i=0; i<fno.size(); i++)
      {
        nop[fno[i]] = 1;
      }
      if(of == 1)
      {
        move_outside(cro[0]);
          io[cro[0]] = 0;
          cou --;
      }
      for(i=1; i<cro.size(); i++)
      {
        // if(io[i] == 1)
        // {
          move_outside(cro[i]);
          io[cro[i]] = 0;
          cou --;
        // }
      }
      of = 1;
      cr = mid-1;
    }
  }
  return cl;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:69:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |       for(i=0; i<fno.size(); i++)
      |                ~^~~~~~~~~~~
insects.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |       for(i=1; i<cro.size(); i++)
      |                ~^~~~~~~~~~~
insects.cpp:11:9: warning: unused variable 'j' [-Wunused-variable]
   11 |   int i,j,cn,cm,fn,fm,cou = 0,cl,cr,mid,ndif,of;
      |         ^
insects.cpp:11:14: warning: unused variable 'cm' [-Wunused-variable]
   11 |   int i,j,cn,cm,fn,fm,cou = 0,cl,cr,mid,ndif,of;
      |              ^~
insects.cpp:11:17: warning: unused variable 'fn' [-Wunused-variable]
   11 |   int i,j,cn,cm,fn,fm,cou = 0,cl,cr,mid,ndif,of;
      |                 ^~
insects.cpp:11:20: warning: unused variable 'fm' [-Wunused-variable]
   11 |   int i,j,cn,cm,fn,fm,cou = 0,cl,cr,mid,ndif,of;
      |                    ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	208 KB	Output is correct
6	Correct	3 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	4 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	2 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	4 ms	208 KB	Output is correct
13	Correct	4 ms	208 KB	Output is correct
14	Correct	5 ms	208 KB	Output is correct
15	Correct	3 ms	208 KB	Output is correct
16	Correct	5 ms	208 KB	Output is correct
17	Correct	5 ms	208 KB	Output is correct
18	Correct	3 ms	208 KB	Output is correct
19	Correct	5 ms	208 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	2 ms	208 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct
23	Correct	13 ms	308 KB	Output is correct
24	Correct	8 ms	208 KB	Output is correct
25	Correct	16 ms	304 KB	Output is correct
26	Correct	17 ms	312 KB	Output is correct
27	Correct	23 ms	208 KB	Output is correct
28	Correct	9 ms	312 KB	Output is correct
29	Correct	24 ms	304 KB	Output is correct
30	Correct	17 ms	312 KB	Output is correct
31	Correct	20 ms	432 KB	Output is correct
32	Correct	20 ms	208 KB	Output is correct
33	Correct	18 ms	304 KB	Output is correct
34	Correct	17 ms	308 KB	Output is correct
35	Correct	20 ms	312 KB	Output is correct
36	Correct	16 ms	292 KB	Output is correct
37	Correct	23 ms	208 KB	Output is correct
38	Correct	16 ms	312 KB	Output is correct
39	Correct	18 ms	308 KB	Output is correct
40	Correct	12 ms	312 KB	Output is correct
41	Correct	8 ms	300 KB	Output is correct

Subtask #3
74.95 / 75.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	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	36 ms	292 KB	Output is correct
8	Correct	16 ms	208 KB	Output is correct
9	Correct	26 ms	296 KB	Output is correct
10	Correct	36 ms	308 KB	Output is correct
11	Correct	36 ms	292 KB	Output is correct
12	Correct	20 ms	308 KB	Output is correct
13	Correct	48 ms	308 KB	Output is correct
14	Correct	50 ms	304 KB	Output is correct
15	Correct	37 ms	300 KB	Output is correct
16	Correct	29 ms	296 KB	Output is correct
17	Correct	39 ms	316 KB	Output is correct
18	Correct	44 ms	308 KB	Output is correct
19	Correct	42 ms	304 KB	Output is correct
20	Correct	41 ms	304 KB	Output is correct
21	Correct	33 ms	304 KB	Output is correct
22	Correct	34 ms	300 KB	Output is correct
23	Correct	41 ms	308 KB	Output is correct
24	Correct	40 ms	304 KB	Output is correct
25	Correct	26 ms	308 KB	Output is correct
26	Correct	13 ms	304 KB	Output is correct
27	Correct	49 ms	320 KB	Output is correct
28	Correct	38 ms	292 KB	Output is correct
29	Correct	39 ms	208 KB	Output is correct
30	Correct	34 ms	304 KB	Output is correct
31	Correct	50 ms	308 KB	Output is correct
32	Correct	38 ms	300 KB	Output is correct
33	Correct	46 ms	304 KB	Output is correct
34	Correct	40 ms	308 KB	Output is correct
35	Partially correct	38 ms	304 KB	Output is partially correct
36	Correct	44 ms	304 KB	Output is correct
37	Correct	49 ms	300 KB	Output is correct
38	Correct	50 ms	304 KB	Output is correct
39	Correct	38 ms	296 KB	Output is correct
40	Correct	29 ms	312 KB	Output is correct
41	Correct	38 ms	296 KB	Output is correct
42	Partially correct	37 ms	312 KB	Output is partially correct
43	Correct	11 ms	308 KB	Output is correct
44	Correct	32 ms	300 KB	Output is correct
45	Correct	18 ms	296 KB	Output is correct
46	Correct	20 ms	304 KB	Output is correct
47	Correct	21 ms	300 KB	Output is correct
48	Correct	20 ms	304 KB	Output is correct

Submission #827123

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 74.95 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
74.95 / 75.0