oj.uz

Submission #897995

# Submission time Handle Problem Language Result Execution time Memory
897995 2024-01-04T06:56:42 Z Essa2006 Counting Mushrooms (IOI20_mushrooms) C++14
0 / 100
 1 ms 444 KB 
#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"
 
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, vr = 10;
    if(vr < 30)
        vr += 50;
    int last;
    for (int i = 1; i <= vr; i++){
        last = 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 = last + 1;
    while (i < n) {
        int j = i;
        vector<int>Ask;
        if (Z.size() > O.size()) {
            while (j < n){
                if (Z.size() < j - i + 1) {
                    j++;
                    break;
                }
                Ask.push_back(A[j]);
                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;
                O.push_back(A[i]);
            }
            else {
                int Bs = diff / 2;
                ans += all - Bs;
                Z.push_back(A[i]);
            }
        }
        
        else {
            while (j < n){
                if (O.size() < j - i + 1) {
                    j++;
                    break;
                }
                Ask.push_back(A[j]);
                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;
                Z.push_back(A[i]);
            }
            else {
                int As = diff / 2;
                ans += As;
                O.push_back(A[i]);
            }
        }
        
        i = j;
    }
    return ans;
}

Compilation message

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

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 444 KB Answer is not correct.
6 Halted 0 ms 0 KB -