답안 #897653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897653	2024-01-03T14:21:05 Z	Essa2006	버섯 세기 (IOI20_mushrooms)	C++14	0 / 100	0 ms	344 KB

mushrooms

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
#include "mushrooms.h"

//int cnt = 0;
//
//vector<int> B;
//
//int use_machine(vector<int> X) {
//    cnt++;
//    int res = 0;
//    for (int i = 1; i < X.size(); i++) {
//        if (B[X[i]] != B[X[i - 1]]) {
//            res++;
//        }
//    }   
//    return res;
//}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int count_mushrooms(int n) {
    
	vector<int> A(n);
    vector<int> Z = {0}, O;
    for (int i = 0; i < n; i++) {
        A[i] = i;
    }
    shuffle(A.begin() + 1, A.end(), rng);
    
    int ans = 1;
    
    int fir, sec;
    
    int cur = use_machine({A[0], A[1]});
    
    if (cur) {
        O.push_back(A[1]);
    }   
    else{
        Z.push_back(A[1]);
        ans++;
    }
    
    int vr = 2;
    
    for (int i = 1; i <= vr; i++){
        
        int cur = use_machine({Z.front(), A[i]});
        
        if (cur) {
            O.push_back(A[i]);
        }
        else {
            Z.push_back(A[i]);
            ans++;
        }
        
        if (n == i + 1) {
            return ans;
        }
    }
    
    

    int i = vr + 1;
    while (i < n - 1) {
        int j = i;
        vector<int>Ask;
        if (Z.size() > O.size()) {
            while (j < n){
                Ask.push_back(A[j]);
                if (Z.size() < j - i + 1 || j == n - 1) {
                    j++;
                    break;
                }
                Ask.push_back(Z[j - i]);
                j++;
            }
            int diff = use_machine(Ask);
            int all = (Ask.size() + 1) / 2;
            if (diff & 1) {
                int Bs = (diff + 1) / 2;
                ans += all - Bs;
            }
            else {
                int diff2 = use_machine({Z.front(), A[i]});
                if (diff2) {
                    O.push_back(A[i]);
                    O.push_back(A[j - 1]);
                    ans += all - (diff + 2)/ 2;
                }
                else {
                    Z.push_back(A[i]);
                    Z.push_back(A[j - 1]);
                    ans += all - diff / 2;
                }
            }
        }
        
        else {
            while (j < n){
                Ask.push_back(A[j]);
                if (O.size() < j - i + 1 || j == n - 1) {
                    j++;
                    break;
                }
                Ask.push_back(O[j - i]);
                j++;
            }
            int diff = use_machine(Ask);
            int all = (Ask.size() + 1) / 2;
            if (diff & 1) {
                int As = (diff + 1) / 2;
                ans += As;
            }
            else {
                int diff2 = use_machine({O.front(), A[i]});
                if (diff2) {
                    Z.push_back(A[i]);
                    Z.push_back(A[j - 1]);
                    ans += (diff / 2 + 1);
                }
                else {
                    O.push_back(A[i]);
                    O.push_back(A[j - 1]);
                    ans += diff / 2;
                }
            }
        }
        
        i = j;
    }
    if (i == n - 1) {
        int diff = use_machine({Z.front(), A[i]});
        ans += 1 - diff;   
    }
    return ans;
}

//int main() {
//    int n, m;
//    cin >> n >> m;
//    
//    int mx = 0;
//    for (int times = 0; times < m; times++) {
//        B.clear();
//        B.resize(n);
//        
//        cnt = 0;
//        for (int i = 0; i < n; i++) {
//            B[i] = rng() % 2;
//        }
//
//        int res = count_mushrooms(n);
//        mx = max(mx, cnt);
//    }
//    cout << mx;
//}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:79:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   79 |                 if (Z.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:110:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  110 |                 if (O.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:118:17: warning: unused variable 'all' [-Wunused-variable]
  118 |             int all = (Ask.size() + 1) / 2;
      |                 ^~~
mushrooms.cpp:39:9: warning: unused variable 'fir' [-Wunused-variable]
   39 |     int fir, sec;
      |         ^~~
mushrooms.cpp:39:14: warning: unused variable 'sec' [-Wunused-variable]
   39 |     int fir, sec;
      |              ^~~

Subtask #1

0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	344 KB	Answer is not correct.
3	Halted	0 ms	0 KB	-