oj.uz

Submission #1105707

# Submission time Handle Problem Language Result Execution time Memory
1105707 2024-10-27T11:07:02 Z azberjibiou Counting Mushrooms (IOI20_mushrooms) C++17
91.129 / 100
 7 ms 760 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define lb lower_bound
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long long ll;
using namespace std;
const int mxN=505;
const int mxM=2200005;
const int mxK=61;
const int MOD=1e9+7;
const ll INF=1e18;
const int C=55;
vector <int> A, B;
int cntA;
int idx=1;
void check_one(){
    int val=use_machine(vector <int>{0, idx});
    if(val==0) A.push_back(idx);
    else B.push_back(idx);
    idx++;
}
void check_two(){
    assert(A.size()>=2 || B.size()>=2);
    bool swp=false;
    if(A.size()<2){
        swp=true;
        swap(A, B);
    }
    int val=use_machine(vector <int> {A[0], idx, A[1], idx+1});
    if(val%2==1) B.push_back(idx+1);
    else A.push_back(idx+1);
    if(val>=2) B.push_back(idx);
    else A.push_back(idx);
    idx+=2;
    if(swp) swap(A, B);
}
void check_C(){
    bool swp=false;
    if(A.size()<B.size()){
        swp=true;
        swap(A, B);
    }
    vector <int> v;
    for(int i=0;i<A.size();i++){
        v.push_back(A[i]);
        v.push_back(idx+i);
    }
    int val=use_machine(v);
    int sz=A.size();
    //end element
    if(val%2==0) A.push_back(idx+sz-1);
    else B.push_back(idx+sz-1);
    //middle element
    if(swp) cntA+=val/2;
    else cntA+=sz-1-val/2;
    //maintain idx, A, B
    idx+=sz;
    if(swp) swap(A, B);
}
void check_end(int n){
    bool swp=false;
    if(A.size()<B.size()){
        swp=true;
        swap(A, B);
    }
    vector <int> v;
    for(int i=0;i<A.size();i++){
        v.push_back(A[i]);
        if(idx+i<n) v.push_back(idx+i);
    }
    int val=use_machine(v);
    int sz=A.size(), cnt_mid=min(n-idx, sz-1);
  	if(n==idx+sz){
      	if(val%2==0) A.push_back(idx+sz-1);
      	else B.push_back(idx+sz-1);
    }
    if(swp) cntA+=val/2;
    else cntA+=cnt_mid-val/2;
    if(swp) swap(A, B);
  	idx=n;
}
int count_mushrooms(int n) {
    A.push_back(0);
    check_one();
    if(n==2) return A.size();
    if(A.size()==1) check_one();
    while(A.size()<C && B.size()<C){
        if(idx==n) return A.size();
        else if(idx==n-1) check_one();
        else check_two();
    }
    while(idx<n){
        if(n-idx<=max(A.size(), B.size())) check_end(n);
        else check_C();
    }
    return A.size()+cntA;
}

Compilation message

mushrooms.cpp: In function 'void check_C()':
mushrooms.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0;i<A.size();i++){
      |                 ~^~~~~~~~~
mushrooms.cpp: In function 'void check_end(int)':
mushrooms.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<A.size();i++){
      |                 ~^~~~~~~~~
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:99:17: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   99 |         if(n-idx<=max(A.size(), B.size())) check_end(n);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
91.129 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 4 ms 336 KB Output is correct
11 Partially correct 5 ms 592 KB Output is partially correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Partially correct 7 ms 608 KB Output is partially correct
16 Partially correct 4 ms 336 KB Output is partially correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 5 ms 336 KB Output is correct
19 Partially correct 5 ms 336 KB Output is partially correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 5 ms 452 KB Output is correct
22 Partially correct 4 ms 508 KB Output is partially correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 3 ms 444 KB Output is correct
25 Partially correct 7 ms 700 KB Output is partially correct
26 Partially correct 4 ms 336 KB Output is partially correct
27 Partially correct 4 ms 336 KB Output is partially correct
28 Partially correct 4 ms 336 KB Output is partially correct
29 Partially correct 4 ms 336 KB Output is partially correct
30 Partially correct 5 ms 336 KB Output is partially correct
31 Partially correct 4 ms 336 KB Output is partially correct
32 Partially correct 6 ms 464 KB Output is partially correct
33 Partially correct 4 ms 336 KB Output is partially correct
34 Partially correct 4 ms 464 KB Output is partially correct
35 Partially correct 4 ms 336 KB Output is partially correct
36 Partially correct 7 ms 336 KB Output is partially correct
37 Partially correct 4 ms 336 KB Output is partially correct
38 Partially correct 4 ms 464 KB Output is partially correct
39 Partially correct 6 ms 604 KB Output is partially correct
40 Partially correct 4 ms 336 KB Output is partially correct
41 Partially correct 5 ms 336 KB Output is partially correct
42 Partially correct 4 ms 592 KB Output is partially correct
43 Partially correct 5 ms 452 KB Output is partially correct
44 Partially correct 7 ms 336 KB Output is partially correct
45 Partially correct 4 ms 592 KB Output is partially correct
46 Partially correct 5 ms 460 KB Output is partially correct
47 Partially correct 4 ms 336 KB Output is partially correct
48 Partially correct 7 ms 468 KB Output is partially correct
49 Partially correct 4 ms 476 KB Output is partially correct
50 Partially correct 4 ms 592 KB Output is partially correct
51 Partially correct 4 ms 504 KB Output is partially correct
52 Partially correct 4 ms 604 KB Output is partially correct
53 Partially correct 5 ms 628 KB Output is partially correct
54 Partially correct 4 ms 336 KB Output is partially correct
55 Partially correct 4 ms 336 KB Output is partially correct
56 Partially correct 4 ms 336 KB Output is partially correct
57 Partially correct 4 ms 336 KB Output is partially correct
58 Partially correct 4 ms 336 KB Output is partially correct
59 Partially correct 4 ms 336 KB Output is partially correct
60 Partially correct 4 ms 336 KB Output is partially correct
61 Partially correct 4 ms 336 KB Output is partially correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 1 ms 508 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct
73 Correct 1 ms 336 KB Output is correct
74 Correct 1 ms 336 KB Output is correct
75 Correct 1 ms 336 KB Output is correct
76 Correct 1 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 1 ms 336 KB Output is correct
79 Correct 1 ms 508 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 0 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 336 KB Output is correct
91 Correct 1 ms 336 KB Output is correct