oj.uz

Submission #724908

# Submission time Handle Problem Language Result Execution time Memory
724908 2023-04-16T08:25:44 Z MohamedAliSaidane Counting Mushrooms (IOI20_mushrooms) C++14
92.623 / 100
 10 ms 440 KB 
#include<bits/stdc++.h>
#include "mushrooms.h"
#include<ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vpi;

#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()

const ll MOD = 1e9 + 7, INF = 1e18;
ll mod(ll x, ll m = MOD) {return (x + m) % m;}

int N;
string S;
/*
int use_machine(vi v)
{
    int rep = 0;
    for(int i = 0; i < (int)(v.size()) - 1; i++)
        rep += (S[v[i]] != S[v[i + 1]]);
    return rep;
}
*/
int count_mushrooms(int n)
{
    char c = 'A', d= 'B';
    int a = 0, b = 1;
    int u = use_machine({0, 1});
    if(n == 2)
        return 2 - u;
    int last = 1;
    if(u == 1)
    {
        last = 2;
        if(use_machine({0, 2}))
        {
            a=  2;
            swap(c, d);

        }
        else
            b = 2;
    }
    vi A = {a, b};
    vi B;
    for(int j = 0; j <= last; j++)
        if(j != a && j != b)
            B.pb(j);
    int sza = (int)(A.size()), szb = (int)(B.size());
    int SQ  =  85;
    for(int i = last + 1; max(sza, szb) < SQ && max(sza, szb) * max(sza, szb) < n; i+= 2)
    {
        if(i == n -1)
        {
            last = i;
            if(use_machine({a, i}))
                B.pb(i);
            else
                A.pb(i);
        }
        else
        {
            last = i + 1;
            u = use_machine({a, i, b, i + 1});
            if(u == 1)
            {
                A.pb(i); B.pb(i + 1);
            }
            else if(u == 0)
            {
                A.pb(i); A.pb(i + 1);
            }
            else if(u == 2)
            {
                A.pb(i + 1);
                B.pb(i);
            }
            else
            {
                B.pb(i); B.pb(i + 1);
            }
        }
        sza = (int)(A.size());
        szb = (int)(B.size());
    }
    if(sza < szb)
    {
        swap(c, d);
        swap(A, B);
        swap(sza, szb);
    }
    int cnt = szb;
    int flag = 0;
    int Bloc = sza;
    for(int j = last + 1; j < n; j += Bloc)
    {
        vi v;
        Bloc = min(n - j, sza);
        for(int k = 0; k < Bloc; k++)
        {
            v.pb(A[k]);
            v.pb(j + k);
        }
        int r = use_machine(v);
        cnt += (r + 1)/2;
        if(r & 1)
            B.pb(j + Bloc - 1);
        else
            A.pb(j + Bloc - 1);
        sza = (int)(A.size());
        szb = (int)(B.size());
        if(szb > sza)
        {
            swap(sza, szb);
            swap(A, B);
            swap(c, d);
            cnt = j + Bloc - cnt;
        }
    }
    if(c == 'B')
        return cnt;
    else
        return n - cnt;
}
/*
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> N;
    cin >> S;
    cout << count_mushrooms(N);
}
*/

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:104:9: warning: unused variable 'flag' [-Wunused-variable]
  104 |     int flag = 0;
      |         ^~~~

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 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 6 ms 328 KB Output is correct
8 Correct 6 ms 316 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Partially correct 7 ms 312 KB Output is partially correct
12 Correct 6 ms 440 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 4 ms 320 KB Output is correct
15 Partially correct 8 ms 316 KB Output is partially correct
16 Partially correct 9 ms 208 KB Output is partially correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Partially correct 6 ms 328 KB Output is partially correct
20 Correct 6 ms 208 KB Output is correct
21 Correct 6 ms 308 KB Output is correct
22 Partially correct 8 ms 208 KB Output is partially correct
23 Correct 4 ms 332 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Partially correct 6 ms 336 KB Output is partially correct
26 Partially correct 6 ms 328 KB Output is partially correct
27 Partially correct 7 ms 312 KB Output is partially correct
28 Partially correct 7 ms 328 KB Output is partially correct
29 Partially correct 6 ms 328 KB Output is partially correct
30 Partially correct 8 ms 308 KB Output is partially correct
31 Partially correct 7 ms 320 KB Output is partially correct
32 Partially correct 8 ms 316 KB Output is partially correct
33 Partially correct 6 ms 208 KB Output is partially correct
34 Partially correct 6 ms 208 KB Output is partially correct
35 Partially correct 8 ms 368 KB Output is partially correct
36 Partially correct 7 ms 324 KB Output is partially correct
37 Partially correct 9 ms 208 KB Output is partially correct
38 Partially correct 7 ms 328 KB Output is partially correct
39 Partially correct 6 ms 336 KB Output is partially correct
40 Partially correct 6 ms 320 KB Output is partially correct
41 Partially correct 5 ms 328 KB Output is partially correct
42 Partially correct 10 ms 208 KB Output is partially correct
43 Partially correct 9 ms 320 KB Output is partially correct
44 Partially correct 6 ms 324 KB Output is partially correct
45 Partially correct 6 ms 316 KB Output is partially correct
46 Partially correct 6 ms 324 KB Output is partially correct
47 Partially correct 6 ms 208 KB Output is partially correct
48 Partially correct 7 ms 320 KB Output is partially correct
49 Partially correct 9 ms 352 KB Output is partially correct
50 Partially correct 9 ms 332 KB Output is partially correct
51 Partially correct 7 ms 320 KB Output is partially correct
52 Partially correct 8 ms 208 KB Output is partially correct
53 Partially correct 6 ms 208 KB Output is partially correct
54 Partially correct 7 ms 320 KB Output is partially correct
55 Partially correct 7 ms 336 KB Output is partially correct
56 Partially correct 6 ms 320 KB Output is partially correct
57 Partially correct 5 ms 336 KB Output is partially correct
58 Partially correct 6 ms 208 KB Output is partially correct
59 Partially correct 9 ms 208 KB Output is partially correct
60 Partially correct 7 ms 324 KB Output is partially correct
61 Partially correct 6 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 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 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 0 ms 208 KB Output is correct
73 Correct 0 ms 208 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 0 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 0 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 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct