oj.uz

답안 #432619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432619 2021-06-18T11:39:26 Z Andyvanh1 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 10 ms 464 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
 
 
using namespace std;
 
#define vt vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,x) for(int (i) = 0; (i) < (x); (i)++)
 
typedef long long ll;
typedef long double ld;
typedef vt<int> vi;
typedef pair<int,int> pii;
 
int naive(int n){
  int ans = 1;
  for(int i = 1; i < n; i++){
    ans+=use_machine({0,i})^1;
}return ans;
}
 
int count_mushrooms(int n){
  if(n<=100)return naive(n);
    int h1;
    int h2;
    if(n==2){
        return 2-use_machine({0,1});
    }
    int val1 = use_machine({0,1});
    int val2 = use_machine({0,2});
    bool bol = true;
    if(val1==val2&&val1==1)h1 = 1, h2 = 2, bol = false;
    else {
        h1 = 0;
        if(!val1)h2=1;
        else h2 = 2;
    }
    int k = min(90,(int)sqrt(n));
    vi count1 = {0};
    vi count2;
    if(!val1)count1.pb(1);
    else count2.pb(1);
    if(!val2)count1.pb(2);
    else count2.pb(2);
    for(int i = 3; i < 2*k; i+=2){
        int a = use_machine({h1,i,h2,i+1});
        if(a==0){
            if(bol){
                count1.pb(i);
                count1.pb(i+1);
            }else{
                count2.pb(i);
                count2.pb(i+1);
            }
        }else if(a==1){
            if(bol){
                count1.pb(i);
                count2.pb(i+1);
            }else{
                count2.pb(i);
                count1.pb(i+1);
            }
        }else if(a==2){
            if(bol){
                count2.pb(i);
                count1.pb(i+1);
            }else{
                count1.pb(i);
                count2.pb(i+1);
            }
        }else{
            if(bol){
                count2.pb(i);
                count2.pb(i+1);
            }else{
                count1.pb(i);
                count1.pb(i+1);
            }
        }
    }
    int ans = count1.size();
    int delta = 0;
    for(int i = 2*k+1; i < n; i+=max(count1.size(),count2.size())-delta){
        int prr = max(count1.size(), count2.size());
        if(n-i<max(count1.size(),count2.size())){
            if(count2.size()>count1.size()){
                vi cur;
                for(int j = 0; j < n-i; j++){
                    cur.pb(j+i);
                    cur.pb(count2[j]);
                }
                int a = use_machine(cur);
                return ans + (a+1)/2;
 
            }else{
                vi cur;
                for(int j = 0; j < n-i; j++){
                    cur.pb(j+i);
                    cur.pb(count1[j]);
                }
                int a = use_machine(cur);
 
                return ans + n-i-(a+1)/2;
 
            }
        }else{
            if(count2.size()>count1.size()){
                vi cur;
                for(int j = 0; j < count2.size(); j++){
                    cur.pb(j+i);
                    cur.pb(count2[j]);
                }
                int a = use_machine(cur);
                ans+=(a+1)/2;
                if(a%2==0){
                    count2.pb(i);
                }else{
                    count1.pb(i);
                }
 
            }else{
                vi cur;
                for(int j = 0; j < count1.size(); j++){
                    cur.pb(j+i);
                    cur.pb(count1[j]);
                }
                int a = use_machine(cur);
                ans+=count1.size()-(a+1)/2;
                 if(a%2==0){
                    count1.pb(i);
                }else{
                    count2.pb(i);
                }
            }
        }
        delta = max(count1.size(),count2.size())-prr;
    }
    return ans;
 
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:87:15: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   87 |         if(n-i<max(count1.size(),count2.size())){
      |            ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:111:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |                 for(int j = 0; j < count2.size(); j++){
      |                                ~~^~~~~~~~~~~~~~~
mushrooms.cpp:125:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |                 for(int j = 0; j < count1.size(); j++){
      |                                ~~^~~~~~~~~~~~~~~

Subtask #1
92.623 / 100.0

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