oj.uz

답안 #936447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936447 2024-03-01T19:59:23 Z EJIC_B_KEDAX 버섯 세기 (IOI20_mushrooms) C++17
92.2449 / 100
 7 ms 852 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
 
using ll = long long;
 
using namespace std;
 
const int lovv66 = 83;
 
mt19937 mt(time(nullptr));
 
int count_mushrooms(int n) {
    vector<int> p(n - 1);
    for (int i = 0; i < n - 1; i++) {
        p[i] = i + 1;
    }
    if (n - 1 >= 2) {
	    shuffle(p.begin(), p.end(), mt);
	    use_machine(p);
	}
    shuffle(p.begin(), p.end(), mt);
    vector<int> a(1, 0), b;
    int x = 0, ans = 1;
    int iter = 0;

    while (x < n - 1) {
        vector<int> ask;
        if (a.size() > b.size()) {
            int ind = 0, len = -1, start = x;
            while (x < n - 1 && ind < a.size() && (iter >= lovv66 || ind < 2)) {
                ask.push_back(a[ind++]);
                ask.push_back(p[x++]);
                len++;
            }
            int cnt = use_machine(ask);
            if (cnt & 1) {
                b.push_back(p[x - 1]);
            } else {
                a.push_back(p[x - 1]);
                ans++;
            }
            cnt /= 2;
            if (!cnt) {
                for (int i = start; i < x - 1; i++) {
                    a.push_back(p[i]);
                }
            } else if (cnt == len) {
                for (int i = start; i < x - 1; i++) {
                    b.push_back(p[i]);
                }
            }
            ans += len - cnt;
        } else {
            int ind = 0, len = -1, start = x;
            while (x < n - 1 && ind < b.size() && (iter >= lovv66 || ind < 2)) {
                ask.push_back(b[ind++]);
                ask.push_back(p[x++]);
                len++;
            }
            int cnt = use_machine(ask);
            if (cnt & 1) {
                a.push_back(p[x - 1]);
                ans++;
            } else {
                b.push_back(p[x - 1]);
            }
            cnt /= 2;
            if (!cnt) {
                for (int i = start; i < x - 1; i++) {
                    b.push_back(p[i]);
                }
            } else if (cnt == len) {
                for (int i = start; i < x - 1; i++) {
                    a.push_back(p[i]);
                }
            }
            ans += cnt;
        }
        iter++;
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:30:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |             while (x < n - 1 && ind < a.size() && (iter >= lovv66 || ind < 2)) {
      |                                 ~~~~^~~~~~~~~~
mushrooms.cpp:55:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |             while (x < n - 1 && ind < b.size() && (iter >= lovv66 || ind < 2)) {
      |                                 ~~~~^~~~~~~~~~

Subtask #1
92.2449 / 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 1 ms 436 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 812 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 6 ms 596 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Partially correct 6 ms 600 KB Output is partially correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Partially correct 7 ms 600 KB Output is partially correct
16 Partially correct 7 ms 600 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 6 ms 652 KB Output is correct
19 Partially correct 6 ms 596 KB Output is partially correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Partially correct 6 ms 600 KB Output is partially correct
23 Correct 6 ms 600 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Partially correct 6 ms 600 KB Output is partially correct
26 Partially correct 6 ms 600 KB Output is partially correct
27 Partially correct 6 ms 656 KB Output is partially correct
28 Partially correct 6 ms 600 KB Output is partially correct
29 Partially correct 7 ms 600 KB Output is partially correct
30 Partially correct 6 ms 852 KB Output is partially correct
31 Partially correct 6 ms 600 KB Output is partially correct
32 Partially correct 6 ms 600 KB Output is partially correct
33 Partially correct 6 ms 600 KB Output is partially correct
34 Partially correct 6 ms 600 KB Output is partially correct
35 Partially correct 6 ms 600 KB Output is partially correct
36 Partially correct 7 ms 600 KB Output is partially correct
37 Partially correct 6 ms 600 KB Output is partially correct
38 Partially correct 7 ms 600 KB Output is partially correct
39 Partially correct 6 ms 600 KB Output is partially correct
40 Partially correct 6 ms 600 KB Output is partially correct
41 Partially correct 6 ms 600 KB Output is partially correct
42 Partially correct 6 ms 600 KB Output is partially correct
43 Partially correct 6 ms 600 KB Output is partially correct
44 Partially correct 6 ms 600 KB Output is partially correct
45 Partially correct 6 ms 600 KB Output is partially correct
46 Partially correct 6 ms 600 KB Output is partially correct
47 Partially correct 7 ms 600 KB Output is partially correct
48 Partially correct 6 ms 600 KB Output is partially correct
49 Partially correct 6 ms 600 KB Output is partially correct
50 Partially correct 6 ms 600 KB Output is partially correct
51 Partially correct 6 ms 600 KB Output is partially correct
52 Partially correct 6 ms 600 KB Output is partially correct
53 Partially correct 6 ms 596 KB Output is partially correct
54 Partially correct 6 ms 600 KB Output is partially correct
55 Partially correct 6 ms 600 KB Output is partially correct
56 Partially correct 6 ms 600 KB Output is partially correct
57 Partially correct 6 ms 600 KB Output is partially correct
58 Partially correct 7 ms 624 KB Output is partially correct
59 Partially correct 6 ms 600 KB Output is partially correct
60 Partially correct 6 ms 600 KB Output is partially correct
61 Partially correct 6 ms 600 KB Output is partially correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 0 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 0 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 1 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 1 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 1 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 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