oj.uz

답안 #484982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484982 2021-11-05T20:57:00 Z MohamedFaresNebili 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 8 ms 328 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
 
using namespace std;
 
using ll  = long long;
using vi  = vector<int>;
 
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define all(x) (x).begin() , (x).end()
 
 
 
string s;/*
int use_machine(vector<int> a){
    int c = 0;
    for(int i = 1;i<a.size();i++){
        if(s[a[i]] != s[a[i-1]])c++;
    }
    return c;
}*/
int count_mushrooms(int n) {
    int cnt = 1;
    if(n < 226){
        
        for(int i = 1;i<n;i++){
        vector<int> a;
        a.push_back(0);
        a.push_back(i);
        int x = use_machine(a);
        if(x == 0)cnt++;
        }
        return cnt;
    }
    int k = 160;
 
 
    vector<int>arrA, arrB;
    arrA.pb(0);
    for(int i = 1;i<3;i++){
        vector<int> a;
        a.push_back(0);
        a.push_back(i);
        int x = use_machine(a);
        if(x == 0){
            arrA.pb(i);
            cnt++;
        }
        else arrB.pb(i);
    }
 
 
    for(int i = 3;i<k;i+=2){
        vector<int> a;
        if(arrA.size() > arrB.size()){
            a = {0,i,arrA[1],i+1};
            int x = use_machine(a);
            if(x == 0){
                arrA.pb(i);
                arrA.pb(i+1);
            }else if(x == 1){
                arrA.pb(i);
                arrB.pb(i+1);
            }else if(x == 2){
                arrB.pb(i);
                arrA.pb(i+1);
            }else {
                arrB.pb(i);
                arrB.pb(i+1);
            }
        }
        else {
            a = {arrB[0],i,arrB[1],i+1};
            int x = use_machine(a);
            if(x == 0){
                arrB.pb(i);
                arrB.pb(i+1);
            }
            else if( x== 1){
                arrB.pb(i);
                arrA.pb(i+1);
            }
            else if(x == 2){
                arrA.pb(i);
                arrB.pb(i+1);
            }
            else {
                arrA.pb(i);
                arrA.pb(i+1);
            }
        }
    }
 
    cnt = arrA.size();
#define sz(x) (int)x.size()
    {
        int i = k+1;
        while(i<n){
             if(sz(arrA) >= sz(arrB)){
            vector<int> a;
            for(int j : arrA){
                a.pb(j);
                a.pb(i);
                i++;
                if(i == n)break;
            }
            int x = use_machine(a);
            cnt += (int)(a.size()/2) - (x+1)/2;
            if(x%2){
                arrB.pb(a.back());
            }
            else arrA.pb(a.back());
            }
             else {
                vector<int> b;
            for(int j : arrB){
                b.pb(j);
                b.pb(i);
                i++;
                if(i == n)break;
            }
            int x = use_machine(b);
            cnt += (x+1)/2;
             if(x%2){
                arrA.pb(b.back());
            }
            else arrB.pb(b.back());
             }
 
        }
    }
 
    return cnt;
 
}/*
int main(){
    while(1){
 
        cin >> s;
        cout << count_mushrooms(s.size()) << endl;
    }
}*/

Subtask #1
92.623 / 100.0

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