oj.uz

Submission #545124

# Submission time Handle Problem Language Result Execution time Memory
545124 2022-04-03T15:42:34 Z Lobo Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 348 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
// #define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2e4 + 10;


// int s[maxn];
// int use_machine(vector<int> x) {
//     const int xs = x.size();
    
//     int diffs = 0;
//     for (int i = 1; i < xs; i++)
//         diffs += int(s[x[i]] != s[x[i-1]]);
//     return diffs;
// }

int a[maxn];

int count_mushrooms(int n) {
    int B = 75;

    vector<int> va, vb;
    a[0] = 1;
    va.pb(0);
    for(int i = 1; i < n; i++) {
        if(i == n-1 || n <= 226) {
            vector<int> vqr; vqr.pb(0); vqr.pb(i);
            if(use_machine(vqr) == 0) {
                va.pb(i);
                a[i] = 1;
            }
            else {
                vb.pb(i);
                a[i] = 1;
            }
            continue;
        }

        if(va.size() < 2 && vb.size() < 2) {
            vector<int> vqr; vqr.pb(0); vqr.pb(i);
            if(use_machine(vqr) == 0) {
                a[i] = 1;
                va.pb(i);
            }
            else {
                a[i] = 1;
                vb.pb(i);
            }
        }
        else if(va.size() >= 2) {
            vector<int> vqr;
            vqr.pb(i);
            vqr.pb(va[0]);
            vqr.pb(i+1);
            vqr.pb(va[1]);

            int qr = use_machine(vqr);
            qr = ((int) vqr.size()) -1 - qr;

            a[i] = 1;
            a[i+1] = 1;
            if(qr == 0) {
                vb.pb(i);
                vb.pb(i+1);
            }
            else if(qr == 1) {
                va.pb(i);
                vb.pb(i+1);
            }
            else if(qr == 2) {
                vb.pb(i);
                va.pb(i+1);
            }
            else {
                va.pb(i);
                va.pb(i+1);
            }
            i++;
        }
        else {
            vector<int> vqr;
            vqr.pb(i);
            vqr.pb(vb[0]);
            vqr.pb(i+1);
            vqr.pb(vb[1]);

            int qr = use_machine(vqr);
            qr = ((int) vqr.size()) -1 - qr;

            a[i] = 1;
            a[i+1] = 1;
            if(qr == 0) {
                va.pb(i);
                va.pb(i+1);
            }
            else if(qr == 1) {
                vb.pb(i);
                va.pb(i+1);
            }
            else if(qr == 2) {
                va.pb(i);
                vb.pb(i+1);
            }
            else {
                vb.pb(i);
                vb.pb(i+1);
            }
            i++;
        }

        if(va.size() >= B || vb.size() >= B) break;
    }

    int ans = va.size();

    int i = 1;
    while(i < n) {
        while(i < n && a[i]) i++;
        if(va.size() > vb.size()) {
            int j = 0;
            vector<int> vqr;
            while(j < va.size() && i < n) {
                if(a[i] != 0) {
                    i++;
                    continue;
                }
                vqr.pb(va[j++]);
                vqr.pb(i++);
            }
            if(vqr.size() == 0) continue;
            int qr = use_machine(vqr);
            qr = ((int) vqr.size()) -1 - qr;
            ans+= qr/2;


            if(qr%2 == 1) {
                va.pb(vqr.back());
                ans++;
            }
            else {
                vb.pb(vqr.back());
            }
        }
        else {
            int j = 0;
            vector<int> vqr;
            while(j < vb.size() && i < n) {
                if(a[i] != 0) {
                    i++;
                    continue;
                }
                vqr.pb(vb[j++]);
                vqr.pb(i++);
            }
            if(vqr.size() == 0) continue;
            int qr = use_machine(vqr);
            qr = ((int) vqr.size()) -1 - qr;
            ans+= ((int) vqr.size())/2 - qr/2 - 1;

            if(qr%2 == 1) {
                vb.pb(vqr.back());
            }
            else {
                va.pb(vqr.back());
                ans++;
            }
        }
    }
    return ans;


}


// int32_t main() {
//     ios::sync_with_stdio(false); cin.tie(0);

//     freopen("in.in", "r", stdin);
//     // freopen("out.out", "w", stdout);
    
//     int n;
//     cin >> n;
//     for(int i = 0; i < n; i++) {
//         int x; cin >> x;
//         s[i] = x;
//     }

//     cout << count_mushrooms(n) << endl;

// }

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:123:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  123 |         if(va.size() >= B || vb.size() >= B) break;
      |            ~~~~~~~~~~^~~~
mushrooms.cpp:123:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  123 |         if(va.size() >= B || vb.size() >= B) break;
      |                              ~~~~~~~~~~^~~~
mushrooms.cpp:134:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |             while(j < va.size() && i < n) {
      |                   ~~^~~~~~~~~~~
mushrooms.cpp:159:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |             while(j < vb.size() && i < n) {
      |                   ~~^~~~~~~~~~~

Subtask #1
92.623 / 100.0

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