oj.uz

Submission #898482

# Submission time Handle Problem Language Result Execution time Memory
898482 2024-01-04T18:08:48 Z Essa2006 Counting Mushrooms (IOI20_mushrooms) C++14
89.3281 / 100
 5 ms 812 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 = 73, last = 0;
    for (int i = 1; i <= 2; 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;
        }
    }
    
    if (Z.size() > O.size()) {
        for (int i = 3; i - 2 <= vr && i + 1 < n; i += 2) {
            last = i + 1;
            int cur = use_machine({Z[0], A[i], Z[1], A[i + 1]});
            
            if (cur == 0) {
                Z.push_back(A[i]);
                Z.push_back(A[i + 1]);
                ans += 2;
            }
            else if (cur == 1) {
                Z.push_back(A[i]);
                O.push_back(A[i + 1]);
                ans++;
            }
            else if (cur == 2) {
                O.push_back(A[i]);
                Z.push_back(A[i + 1]);
                ans++;
            }
            else {
                O.push_back(A[i]);
                O.push_back(A[i + 1]);
            }
        }
    }
    else {
        for (int i = 3; i - 2 <= vr && i + 1 < n; i += 2) {
            last = i + 1;
            int cur = use_machine({O[0], A[i], O[1], A[i + 1]});
            
            if (cur == 0) {
                O.push_back(A[i]);
                O.push_back(A[i + 1]);
            }
            else if (cur == 1) {
                O.push_back(A[i]);
                Z.push_back(A[i + 1]);
                ans++;
            }
            else if (cur == 2) {
                Z.push_back(A[i]);
                O.push_back(A[i + 1]);
                ans++;
            }
            else {
                Z.push_back(A[i]);
                Z.push_back(A[i + 1]);
                ans += 2;
            }
        }
    }
    
    
 
    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) {
                    break;
                }
                Ask.push_back(A[j]);
                Ask.push_back(Z[j - i]);
                j++;
            }
            int diff = use_machine(Ask);
            int all = Ask.size() / 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) {
                    break;
                }
                Ask.push_back(A[j]);
                Ask.push_back(O[j - i]);
                j++;
            }
            int diff = use_machine(Ask);
            int all = Ask.size() / 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:101:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |                 if (Z.size() < j - i + 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:124:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |                 if (O.size() < j - i + 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:132:17: warning: unused variable 'all' [-Wunused-variable]
  132 |             int all = Ask.size() / 2;
      |                 ^~~

Subtask #1
89.3281 / 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 Correct 0 ms 444 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 4 ms 544 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 5 ms 556 KB Output is correct
10 Correct 5 ms 552 KB Output is correct
11 Partially correct 4 ms 556 KB Output is partially correct
12 Correct 4 ms 548 KB Output is correct
13 Correct 4 ms 544 KB Output is correct
14 Correct 2 ms 500 KB Output is correct
15 Partially correct 4 ms 552 KB Output is partially correct
16 Partially correct 4 ms 552 KB Output is partially correct
17 Correct 2 ms 508 KB Output is correct
18 Correct 4 ms 548 KB Output is correct
19 Partially correct 4 ms 556 KB Output is partially correct
20 Correct 4 ms 552 KB Output is correct
21 Correct 5 ms 552 KB Output is correct
22 Partially correct 4 ms 560 KB Output is partially correct
23 Correct 4 ms 556 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Partially correct 4 ms 556 KB Output is partially correct
26 Partially correct 4 ms 556 KB Output is partially correct
27 Partially correct 4 ms 556 KB Output is partially correct
28 Partially correct 4 ms 552 KB Output is partially correct
29 Partially correct 4 ms 552 KB Output is partially correct
30 Partially correct 4 ms 556 KB Output is partially correct
31 Partially correct 4 ms 560 KB Output is partially correct
32 Partially correct 4 ms 556 KB Output is partially correct
33 Partially correct 4 ms 800 KB Output is partially correct
34 Partially correct 4 ms 556 KB Output is partially correct
35 Partially correct 4 ms 552 KB Output is partially correct
36 Partially correct 4 ms 552 KB Output is partially correct
37 Partially correct 4 ms 552 KB Output is partially correct
38 Partially correct 5 ms 556 KB Output is partially correct
39 Partially correct 4 ms 556 KB Output is partially correct
40 Partially correct 4 ms 808 KB Output is partially correct
41 Partially correct 5 ms 808 KB Output is partially correct
42 Partially correct 4 ms 560 KB Output is partially correct
43 Partially correct 5 ms 552 KB Output is partially correct
44 Partially correct 4 ms 560 KB Output is partially correct
45 Partially correct 4 ms 556 KB Output is partially correct
46 Partially correct 4 ms 556 KB Output is partially correct
47 Partially correct 4 ms 556 KB Output is partially correct
48 Partially correct 4 ms 556 KB Output is partially correct
49 Partially correct 4 ms 552 KB Output is partially correct
50 Partially correct 4 ms 544 KB Output is partially correct
51 Partially correct 4 ms 804 KB Output is partially correct
52 Partially correct 5 ms 808 KB Output is partially correct
53 Partially correct 5 ms 556 KB Output is partially correct
54 Partially correct 4 ms 552 KB Output is partially correct
55 Partially correct 5 ms 808 KB Output is partially correct
56 Partially correct 4 ms 560 KB Output is partially correct
57 Partially correct 4 ms 808 KB Output is partially correct
58 Partially correct 4 ms 556 KB Output is partially correct
59 Partially correct 5 ms 812 KB Output is partially correct
60 Partially correct 4 ms 808 KB Output is partially correct
61 Partially correct 5 ms 752 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 424 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct