oj.uz

답안 #759787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759787 2023-06-16T19:25:59 Z MilosMilutinovic 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 7 ms 452 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int C = 150;
int count_mushrooms(int n) {
    if (n <= 227) {
        int ans = 1;
        for (int i = 1; i < n; i++) {
            ans += !use_machine({0, i});
        }
        return ans;
    }
    vector<int> a(1, 0), b;
    for (int i = 1; i < min(n, C); i++) {
        if (a.size() >= 2) {
            int qq = use_machine({a[0], i, a[1], i + 1});
            if (qq & 1)
                b.push_back(i + 1);
            else
                a.push_back(i + 1);
            if (qq & 2)
                b.push_back(i);
            else
                a.push_back(i);
            i += 1;
            continue;
        }
        if (b.size() >= 2) {
            int qq = use_machine({b[0], i, b[1], i + 1});
            if (qq & 1)
                a.push_back(i + 1);
            else
                b.push_back(i + 1);
            if (qq & 2)
                a.push_back(i);
            else
                b.push_back(i);
            i += 1;
            continue;
        }
        if (use_machine({0, i}) == 1)
            b.push_back(i);
        else
            a.push_back(i);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int pos = 0;
    if (!a.empty())
        pos = max(pos, a.back());
    if (!b.empty())
        pos = max(pos, b.back());
    int ans = a.size();
    for (int i = pos + 1; i < n; i++) {
        int sz = max(a.size(), b.size());
        vector<int> qv;
        int cnt = 0;
        for (int j = i; j < min(i + sz, n); j++) {
            if (j != i + sz) {
                if (a.size() == sz)
                    qv.push_back(a[j - i]);
                else
                    qv.push_back(b[j - i]);
                cnt += 1;
            }
            qv.push_back(j);
        }
        int qq = use_machine(qv);
        int diff = (qq + 1) / 2;
        int same = (qv.size() - cnt  - diff);
        if (a.size() == sz)
            ans += same;
        else
            ans += diff;
        int is_match = (qq % 2 == 0 ? 1 : 0);
        if (a.size() != sz)
            is_match = 1 - is_match;
        if (is_match)
            a.push_back(qv.back());
        else
            b.push_back(qv.back());
        i = qv.back();
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:60:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |                 if (a.size() == sz)
      |                     ~~~~~~~~~^~~~~
mushrooms.cpp:71:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |         if (a.size() == sz)
      |             ~~~~~~~~~^~~~~
mushrooms.cpp:76:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |         if (a.size() != sz)
      |             ~~~~~~~~~^~~~~

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Partially correct 6 ms 208 KB Output is partially correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 308 KB Output is correct
15 Partially correct 7 ms 208 KB Output is partially correct
16 Partially correct 5 ms 208 KB Output is partially correct
17 Correct 3 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Partially correct 5 ms 336 KB Output is partially correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 5 ms 324 KB Output is correct
22 Partially correct 5 ms 336 KB Output is partially correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Partially correct 5 ms 208 KB Output is partially correct
26 Partially correct 4 ms 328 KB Output is partially correct
27 Partially correct 6 ms 332 KB Output is partially correct
28 Partially correct 5 ms 208 KB Output is partially correct
29 Partially correct 6 ms 320 KB Output is partially correct
30 Partially correct 5 ms 452 KB Output is partially correct
31 Partially correct 5 ms 208 KB Output is partially correct
32 Partially correct 6 ms 320 KB Output is partially correct
33 Partially correct 5 ms 208 KB Output is partially correct
34 Partially correct 6 ms 336 KB Output is partially correct
35 Partially correct 5 ms 320 KB Output is partially correct
36 Partially correct 5 ms 332 KB Output is partially correct
37 Partially correct 5 ms 208 KB Output is partially correct
38 Partially correct 5 ms 324 KB Output is partially correct
39 Partially correct 5 ms 208 KB Output is partially correct
40 Partially correct 5 ms 308 KB Output is partially correct
41 Partially correct 5 ms 336 KB Output is partially correct
42 Partially correct 6 ms 208 KB Output is partially correct
43 Partially correct 5 ms 336 KB Output is partially correct
44 Partially correct 6 ms 336 KB Output is partially correct
45 Partially correct 5 ms 320 KB Output is partially correct
46 Partially correct 6 ms 336 KB Output is partially correct
47 Partially correct 5 ms 208 KB Output is partially correct
48 Partially correct 5 ms 308 KB Output is partially correct
49 Partially correct 7 ms 208 KB Output is partially correct
50 Partially correct 6 ms 208 KB Output is partially correct
51 Partially correct 5 ms 208 KB Output is partially correct
52 Partially correct 5 ms 336 KB Output is partially correct
53 Partially correct 6 ms 336 KB Output is partially correct
54 Partially correct 4 ms 336 KB Output is partially correct
55 Partially correct 6 ms 316 KB Output is partially correct
56 Partially correct 5 ms 324 KB Output is partially correct
57 Partially correct 5 ms 316 KB Output is partially correct
58 Partially correct 5 ms 332 KB Output is partially correct
59 Partially correct 6 ms 208 KB Output is partially correct
60 Partially correct 5 ms 208 KB Output is partially correct
61 Partially correct 6 ms 316 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 0 ms 208 KB Output is correct
68 Correct 1 ms 272 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 0 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 0 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 1 ms 296 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 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 0 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