oj.uz

답안 #306085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
306085 2020-09-24T13:19:38 Z SorahISA 버섯 세기 (IOI20_mushrooms) C++17
0 / 100
 14 ms 384 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

int count_mushrooms(int n) {
	const int B = (int)floor(sqrt(2 * n + 0.5));
    vector<int> m{0};
    
    for (int i = 1; i <= B; ++i) {
        m.eb(m.back() ^ use_machine({i-1, i}));
    }
    
    vector<int> tA, tB;
    for (int i = 0; i <= B; ++i) {
        if (m[i] == 0) tA.eb(i);
        if (m[i] == 1) tB.eb(i);
    }
    
    // cout << "tA : "; for (auto x : tA) cout << x << " "; cout << "\n";
    // cout << "tB : "; for (auto x : tB) cout << x << " "; cout << "\n";
    
    int ans = tA.size();
    
    if (tA.size() >= tB.size()) {
        /// 0 x 0 x 0 x 0 ... 0 x 0 x ///
        int sz = tA.size(), tok = B + 1;
        while (tok < n) {
            vector<int> tmp;
            for (int i = 0; i < sz and tok < n; ++i) {
                tmp.eb(tA[i]), tmp.eb(tok++);
            }
            ans += tmp.size() / 2 - (use_machine(tmp) + 1) / 2;
        }
    }
    else if (tB.size() > tA.size()) {
        /// 1 x 1 x 1 x 1 ... 1 x 1 x ///
        int sz = tB.size(), tok = B + 1;
        while (tok < n) {
            vector<int> tmp;
            for (int i = 0; i < sz and tok < n; ++i) {
                tmp.eb(tB[i]), tmp.eb(tok++);
            }
            ans += (use_machine(tmp) + 1) / 2;
        }
    }
    
	return ans;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Partially correct 7 ms 380 KB Output is partially correct
8 Partially correct 8 ms 384 KB Output is partially correct
9 Partially correct 10 ms 384 KB Output is partially correct
10 Partially correct 8 ms 256 KB Output is partially correct
11 Partially correct 14 ms 256 KB Output is partially correct
12 Partially correct 8 ms 256 KB Output is partially correct
13 Partially correct 9 ms 256 KB Output is partially correct
14 Partially correct 4 ms 376 KB Output is partially correct
15 Partially correct 10 ms 256 KB Output is partially correct
16 Partially correct 8 ms 256 KB Output is partially correct
17 Partially correct 5 ms 256 KB Output is partially correct
18 Partially correct 10 ms 256 KB Output is partially correct
19 Partially correct 10 ms 256 KB Output is partially correct
20 Partially correct 10 ms 256 KB Output is partially correct
21 Partially correct 8 ms 256 KB Output is partially correct
22 Partially correct 10 ms 256 KB Output is partially correct
23 Partially correct 8 ms 384 KB Output is partially correct
24 Partially correct 5 ms 256 KB Output is partially correct
25 Partially correct 9 ms 256 KB Output is partially correct
26 Partially correct 7 ms 372 KB Output is partially correct
27 Partially correct 11 ms 256 KB Output is partially correct
28 Partially correct 8 ms 256 KB Output is partially correct
29 Partially correct 9 ms 256 KB Output is partially correct
30 Partially correct 10 ms 256 KB Output is partially correct
31 Partially correct 7 ms 376 KB Output is partially correct
32 Partially correct 9 ms 256 KB Output is partially correct
33 Partially correct 7 ms 376 KB Output is partially correct
34 Partially correct 9 ms 256 KB Output is partially correct
35 Partially correct 11 ms 256 KB Output is partially correct
36 Partially correct 9 ms 256 KB Output is partially correct
37 Partially correct 7 ms 376 KB Output is partially correct
38 Partially correct 9 ms 384 KB Output is partially correct
39 Partially correct 9 ms 256 KB Output is partially correct
40 Partially correct 10 ms 256 KB Output is partially correct
41 Partially correct 9 ms 256 KB Output is partially correct
42 Partially correct 7 ms 376 KB Output is partially correct
43 Partially correct 9 ms 256 KB Output is partially correct
44 Partially correct 9 ms 256 KB Output is partially correct
45 Partially correct 11 ms 256 KB Output is partially correct
46 Partially correct 10 ms 256 KB Output is partially correct
47 Partially correct 8 ms 372 KB Output is partially correct
48 Partially correct 10 ms 256 KB Output is partially correct
49 Partially correct 10 ms 256 KB Output is partially correct
50 Partially correct 9 ms 256 KB Output is partially correct
51 Partially correct 8 ms 256 KB Output is partially correct
52 Partially correct 10 ms 256 KB Output is partially correct
53 Partially correct 10 ms 256 KB Output is partially correct
54 Partially correct 10 ms 256 KB Output is partially correct
55 Partially correct 9 ms 256 KB Output is partially correct
56 Partially correct 8 ms 256 KB Output is partially correct
57 Partially correct 8 ms 256 KB Output is partially correct
58 Partially correct 9 ms 256 KB Output is partially correct
59 Partially correct 9 ms 256 KB Output is partially correct
60 Partially correct 9 ms 256 KB Output is partially correct
61 Partially correct 9 ms 256 KB Output is partially correct
62 Incorrect 0 ms 256 KB Invalid value 2 in the query array.
63 Halted 0 ms 0 KB -