oj.uz

답안 #761478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761478 2023-06-19T18:57:09 Z Khizri 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 7 ms 448 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=2e4+5;
int color[mxn];
int count_mushrooms(int n) {
    if(n<=490){
        int ans=1;
        for(int i=1;i<n-1;i+=2){
            vector<int>vt={i,0,i+1};
            int k=use_machine(vt);
            ans+=(2-k);
        }
        if((n-1)%2){
            vector<int>vt={n-1,0};
            int k=use_machine(vt);
            ans+=(1-k);
        }
        return ans;
    }
    int k=90;
    vector<int>x,y;
    x.pb(0);
    int idx=0;
    for(int i=1;i<3;i++){
        if(x.size()>=k||y.size()>=k) break;
        idx=i;
        vector<int>vt={0,i};
        if(use_machine(vt)==0){
            x.pb(i);
            color[i]=1;
        }
        else{
            y.pb(i);
            color[i]=2;
        }
    }
    int t=1;
    int a,b;
    if(x.size()>=2){
        a=x[0],b=x[1];
    }
    else{
        t=0;
        a=y[0],b=y[1];
    }
    for(int i=3;i<n-1;i+=2){
        if(x.size()>=k||y.size()>=k) break;
        idx=i+1;
        vector<int>vt={i,a,i+1,b};
        int cnt=use_machine(vt);
        if(t){
            if(cnt==0){
                x.pb(i);
                x.pb(i+1);
            }
            else if(cnt==1){
                y.pb(i);
                x.pb(i+1);
            }
            else if(cnt==2){
                x.pb(i);
                y.pb(i+1);
            }
            else{
                y.pb(i);
                y.pb(i+1);
            }
        }
        else{
            if(cnt==0){
                y.pb(i);
                y.pb(i+1);
            }
            else if(cnt==1){
                x.pb(i);
                y.pb(i+1);
            }
            else if(cnt==2){
                y.pb(i);
                x.pb(i+1);
            }
            else{
                x.pb(i);
                x.pb(i+1);
            }
        }
    }
    int ok=0;
    int ans=x.size();
    if(x.size()<y.size()){
        swap(x,y);
        ok=1;
    }
    vector<int>qr;
    for(int i=idx+1;i<n;i++){
        qr.pb(i);
        if(qr.size()==x.size()||i==n-1){
            if(x.size()<y.size()){
                swap(x,y);
                ok=1-ok;
            }
            vector<int>vt;
            for(int j=0;j<qr.size();j++){
                vt.pb(qr[j]);
                vt.pb(x[j]);
            }
            int cnt=use_machine(vt);
            if(!ok){
                int say=(cnt+1)/2;
                ans+=qr.size()-say;
                if(cnt%2==0){
                    x.pb(vt[0]);
                }
                else{
                    y.pb(vt[0]);
                }
            }
            else{
                int say=(cnt+1)/2;
                ans+=say;
                if(cnt%2==0){
                    x.pb(vt[0]);
                }
                else{
                    y.pb(vt[0]);
                }
            }
            qr.clear();
        }
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:37:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         if(x.size()>=k||y.size()>=k) break;
      |            ~~~~~~~~^~~
mushrooms.cpp:37:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         if(x.size()>=k||y.size()>=k) break;
      |                         ~~~~~~~~^~~
mushrooms.cpp:59:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |         if(x.size()>=k||y.size()>=k) break;
      |            ~~~~~~~~^~~
mushrooms.cpp:59:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |         if(x.size()>=k||y.size()>=k) break;
      |                         ~~~~~~~~^~~
mushrooms.cpp:115:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             for(int j=0;j<qr.size();j++){
      |                         ~^~~~~~~~~~

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 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 208 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 324 KB Output is correct
11 Partially correct 5 ms 324 KB Output is partially correct
12 Correct 6 ms 328 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 3 ms 320 KB Output is correct
15 Partially correct 4 ms 332 KB Output is partially correct
16 Partially correct 6 ms 328 KB Output is partially correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 4 ms 328 KB Output is correct
19 Partially correct 5 ms 336 KB Output is partially correct
20 Correct 5 ms 448 KB Output is correct
21 Correct 5 ms 320 KB Output is correct
22 Partially correct 7 ms 336 KB Output is partially correct
23 Correct 4 ms 304 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Partially correct 5 ms 336 KB Output is partially correct
26 Partially correct 5 ms 336 KB Output is partially correct
27 Partially correct 5 ms 340 KB Output is partially correct
28 Partially correct 5 ms 208 KB Output is partially correct
29 Partially correct 7 ms 328 KB Output is partially correct
30 Partially correct 6 ms 336 KB Output is partially correct
31 Partially correct 6 ms 340 KB Output is partially correct
32 Partially correct 5 ms 324 KB Output is partially correct
33 Partially correct 7 ms 208 KB Output is partially correct
34 Partially correct 7 ms 332 KB Output is partially correct
35 Partially correct 5 ms 336 KB Output is partially correct
36 Partially correct 5 ms 328 KB Output is partially correct
37 Partially correct 6 ms 316 KB Output is partially correct
38 Partially correct 5 ms 340 KB Output is partially correct
39 Partially correct 6 ms 324 KB Output is partially correct
40 Partially correct 5 ms 208 KB Output is partially correct
41 Partially correct 6 ms 208 KB Output is partially correct
42 Partially correct 5 ms 208 KB Output is partially correct
43 Partially correct 5 ms 316 KB Output is partially correct
44 Partially correct 4 ms 332 KB Output is partially correct
45 Partially correct 5 ms 344 KB Output is partially correct
46 Partially correct 5 ms 336 KB Output is partially correct
47 Partially correct 5 ms 308 KB Output is partially correct
48 Partially correct 5 ms 336 KB Output is partially correct
49 Partially correct 7 ms 320 KB Output is partially correct
50 Partially correct 5 ms 332 KB Output is partially correct
51 Partially correct 5 ms 208 KB Output is partially correct
52 Partially correct 5 ms 328 KB Output is partially correct
53 Partially correct 7 ms 352 KB Output is partially correct
54 Partially correct 5 ms 336 KB Output is partially correct
55 Partially correct 5 ms 316 KB Output is partially correct
56 Partially correct 7 ms 208 KB Output is partially correct
57 Partially correct 5 ms 336 KB Output is partially correct
58 Partially correct 4 ms 336 KB Output is partially correct
59 Partially correct 4 ms 340 KB Output is partially correct
60 Partially correct 5 ms 336 KB Output is partially correct
61 Partially correct 5 ms 336 KB Output is partially correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 0 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 0 ms 208 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 0 ms 208 KB Output is correct
73 Correct 0 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 0 ms 208 KB Output is correct
83 Correct 0 ms 208 KB Output is correct
84 Correct 0 ms 208 KB Output is correct
85 Correct 0 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct