답안 #897637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897637	2024-01-03T14:12:33 Z	Essa2006	버섯 세기 (IOI20_mushrooms)	C++17	25 / 100	30 ms	1060 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++;
    }
    
    if (n == 2)
        return ans;
    
    int cur2 = use_machine({A[0], A[2]});
    
    if (cur2) {
        O.push_back(A[2]);
    }   
    else{
        Z.push_back(A[2]);
        ans++;
    }
    int i = 3;
    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:70:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   70 |                 if (Z.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
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 (O.size() < j - i + 1 || j == n - 1) {
      |                     ~~~~~~~~~^~~~~~~~~~~
mushrooms.cpp:109:17: warning: unused variable 'all' [-Wunused-variable]
  109 |             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

25.0 / 100.0

#	결과	실행 시간	메모리	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	460 KB	Output is correct
7	Partially correct	4 ms	560 KB	Output is partially correct
8	Partially correct	5 ms	560 KB	Output is partially correct
9	Partially correct	5 ms	560 KB	Output is partially correct
10	Partially correct	6 ms	784 KB	Output is partially correct
11	Partially correct	5 ms	560 KB	Output is partially correct
12	Partially correct	4 ms	808 KB	Output is partially correct
13	Partially correct	4 ms	564 KB	Output is partially correct
14	Partially correct	3 ms	508 KB	Output is partially correct
15	Partially correct	5 ms	812 KB	Output is partially correct
16	Partially correct	5 ms	808 KB	Output is partially correct
17	Correct	2 ms	516 KB	Output is correct
18	Partially correct	4 ms	556 KB	Output is partially correct
19	Partially correct	5 ms	812 KB	Output is partially correct
20	Partially correct	5 ms	552 KB	Output is partially correct
21	Partially correct	6 ms	1060 KB	Output is partially correct
22	Partially correct	5 ms	564 KB	Output is partially correct
23	Partially correct	4 ms	552 KB	Output is partially correct
24	Partially correct	12 ms	344 KB	Output is partially correct
25	Partially correct	5 ms	800 KB	Output is partially correct
26	Partially correct	5 ms	560 KB	Output is partially correct
27	Partially correct	5 ms	784 KB	Output is partially correct
28	Partially correct	5 ms	556 KB	Output is partially correct
29	Partially correct	5 ms	808 KB	Output is partially correct
30	Partially correct	5 ms	552 KB	Output is partially correct
31	Partially correct	6 ms	808 KB	Output is partially correct
32	Partially correct	5 ms	552 KB	Output is partially correct
33	Partially correct	5 ms	560 KB	Output is partially correct
34	Partially correct	6 ms	796 KB	Output is partially correct
35	Partially correct	5 ms	556 KB	Output is partially correct
36	Partially correct	5 ms	556 KB	Output is partially correct
37	Partially correct	21 ms	344 KB	Output is partially correct
38	Partially correct	24 ms	344 KB	Output is partially correct
39	Partially correct	25 ms	344 KB	Output is partially correct
40	Partially correct	26 ms	344 KB	Output is partially correct
41	Partially correct	27 ms	344 KB	Output is partially correct
42	Partially correct	23 ms	344 KB	Output is partially correct
43	Partially correct	26 ms	344 KB	Output is partially correct
44	Partially correct	24 ms	344 KB	Output is partially correct
45	Partially correct	23 ms	344 KB	Output is partially correct
46	Partially correct	24 ms	344 KB	Output is partially correct
47	Partially correct	24 ms	344 KB	Output is partially correct
48	Partially correct	27 ms	344 KB	Output is partially correct
49	Partially correct	27 ms	344 KB	Output is partially correct
50	Partially correct	26 ms	344 KB	Output is partially correct
51	Partially correct	26 ms	344 KB	Output is partially correct
52	Partially correct	24 ms	344 KB	Output is partially correct
53	Partially correct	22 ms	344 KB	Output is partially correct
54	Partially correct	22 ms	344 KB	Output is partially correct
55	Partially correct	24 ms	344 KB	Output is partially correct
56	Partially correct	27 ms	344 KB	Output is partially correct
57	Partially correct	29 ms	344 KB	Output is partially correct
58	Partially correct	30 ms	344 KB	Output is partially correct
59	Partially correct	25 ms	344 KB	Output is partially correct
60	Partially correct	26 ms	344 KB	Output is partially correct
61	Partially correct	24 ms	344 KB	Output is partially correct
62	Correct	1 ms	344 KB	Output is correct
63	Correct	1 ms	344 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	1 ms	344 KB	Output is correct
68	Correct	1 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	1 ms	344 KB	Output is correct
73	Correct	1 ms	344 KB	Output is correct
74	Correct	0 ms	344 KB	Output is correct
75	Correct	0 ms	344 KB	Output is correct
76	Correct	0 ms	344 KB	Output is correct
77	Correct	1 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	1 ms	344 KB	Output is correct
83	Correct	0 ms	344 KB	Output is correct
84	Correct	1 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	0 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