oj.uz

답안 #703547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703547 2023-02-27T16:05:39 Z SamNguyen 커다란 상품 (IOI17_prize) C++14
98.47 / 100
 53 ms 5268 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

template <class T1, class T2>
inline bool minimise(T1 &x, T2 y) {
    if (x > y) { x = y; return true; }
    return false;
}

template <class T1, class T2>
inline bool maximise(T1 &x, T2 y) {
    if (x < y) { x = y; return true; }
    return false;
}

template <class F>
int FIND_SMALLEST(int l, int r, F f) {
    int res = r + 1;
    while (l <= r) {
        int m = (l + r) / 2;
        if (f(m)) res = m, r = m - 1;
        else l = m + 1;
    }
    return res;
}

template <class F>
int FIND_LARGEST(int l, int r, F f) {
    int res = l - 1;
    while (l <= r) {
        int m = (l + r) / 2;
        if (f(m)) res = m, l = m + 1;
        else r = m - 1;
    }
    return res;
}

namespace SUB1 {
    int find_best(int n) {
        int l = 0, r = n - 1;
        while (l <= r) {
            int m = (l + r) >> 1;
            auto cnt = ask(m);

            if (cnt[0] == cnt[1])
                return m;

            if (cnt[0] < cnt[1])
                l = m + 1;
            else
                r = m - 1;
        }

        return -1;
    }
}

namespace SUB2A {
    vector<int> inds;
    int n, MAX_S;

    vector<vector<int>> cnt;

    vector<int>& count(int i) {
        if (cnt[i].empty())
            cnt[i] = ask(i);
        return cnt[i];
    }

    int count_both(int i) {
        auto &a = count(i);
        int res = a[0] + a[1];
        if (res == 0)
            throw i;
        return res;
    }

    void extract_inds() {
        int cnt = 0;

        for (int i = 0; i < n; ) {
            if (count_both(i) < MAX_S) {
                inds.push_back(i);
                i++;
                continue;
            }

            const int T = 999;
            int j = FIND_LARGEST(i, min(n - 1, i + T), [&](int j) { return count(j) == count(i); });
//            if (j > i + T)
//                cout << "Nah." << endl;

//            if (j > i + T + 1)
//                j = FIND_LARGEST(i + T + 1, n - 1, [&](int j) { return count(j) == count(i); });

//            int j = FIND_LARGEST(i, n - 1, [&](int j) { return count(j) == count(i); });
            cnt++;

            i = j + 1;
        }

//        cout << "cnt = " << cnt << endl;
    }

    int find_best(int _n) {
        n = _n;
        cnt.assign(n, vector<int>());

        try {
            MAX_S = count_both(0);
            extract_inds();
        }
        catch (int i) {
            return i;
        }
        return -1;
    }
}

int find_best(int n) {
    return SUB2A::find_best(n);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5028 KB Output is correct
2 Correct 18 ms 4996 KB Output is correct
3 Correct 14 ms 5064 KB Output is correct
4 Correct 24 ms 5064 KB Output is correct
5 Correct 15 ms 5004 KB Output is correct
6 Correct 4 ms 4988 KB Output is correct
7 Correct 11 ms 5064 KB Output is correct
8 Correct 12 ms 5028 KB Output is correct
9 Correct 14 ms 5020 KB Output is correct
10 Correct 21 ms 5008 KB Output is correct

Subtask #2
78.47 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5000 KB Output is correct
2 Correct 14 ms 5020 KB Output is correct
3 Correct 16 ms 5020 KB Output is correct
4 Correct 27 ms 5056 KB Output is correct
5 Correct 11 ms 5012 KB Output is correct
6 Correct 5 ms 5016 KB Output is correct
7 Correct 12 ms 5004 KB Output is correct
8 Correct 16 ms 5012 KB Output is correct
9 Correct 12 ms 5004 KB Output is correct
10 Correct 24 ms 5036 KB Output is correct
11 Correct 12 ms 5064 KB Output is correct
12 Correct 5 ms 5072 KB Output is correct
13 Correct 22 ms 5020 KB Output is correct
14 Correct 4 ms 848 KB Output is correct
15 Correct 11 ms 5024 KB Output is correct
16 Correct 45 ms 5136 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 49 ms 5196 KB Output is correct
19 Correct 5 ms 5020 KB Output is correct
20 Correct 16 ms 2720 KB Output is correct
21 Correct 16 ms 5016 KB Output is correct
22 Correct 6 ms 5016 KB Output is correct
23 Correct 6 ms 5008 KB Output is correct
24 Correct 4 ms 4936 KB Output is correct
25 Correct 35 ms 5064 KB Output is correct
26 Correct 35 ms 5124 KB Output is correct
27 Correct 10 ms 5072 KB Output is correct
28 Partially correct 26 ms 5268 KB Partially correct - number of queries: 5153
29 Correct 35 ms 5132 KB Output is correct
30 Correct 36 ms 5132 KB Output is correct
31 Correct 5 ms 5000 KB Output is correct
32 Correct 18 ms 5064 KB Output is correct
33 Correct 2 ms 336 KB Output is correct
34 Correct 17 ms 5008 KB Output is correct
35 Correct 12 ms 5084 KB Output is correct
36 Correct 10 ms 5016 KB Output is correct
37 Correct 9 ms 5068 KB Output is correct
38 Correct 6 ms 5072 KB Output is correct
39 Correct 24 ms 5096 KB Output is correct
40 Correct 36 ms 5208 KB Output is correct
41 Correct 25 ms 5028 KB Output is correct
42 Correct 30 ms 5140 KB Output is correct
43 Correct 31 ms 5144 KB Output is correct
44 Correct 23 ms 5020 KB Output is correct
45 Correct 22 ms 5016 KB Output is correct
46 Correct 5 ms 5020 KB Output is correct
47 Correct 30 ms 5032 KB Output is correct
48 Correct 35 ms 5088 KB Output is correct
49 Correct 7 ms 4996 KB Output is correct
50 Correct 40 ms 5144 KB Output is correct
51 Correct 19 ms 5024 KB Output is correct
52 Correct 5 ms 5064 KB Output is correct
53 Correct 20 ms 5016 KB Output is correct
54 Correct 24 ms 5024 KB Output is correct
55 Correct 4 ms 5032 KB Output is correct
56 Correct 52 ms 5088 KB Output is correct
57 Correct 18 ms 5220 KB Output is correct
58 Correct 32 ms 5064 KB Output is correct
59 Correct 36 ms 5128 KB Output is correct
60 Correct 32 ms 5064 KB Output is correct
61 Correct 18 ms 5064 KB Output is correct
62 Correct 7 ms 5028 KB Output is correct
63 Correct 18 ms 5036 KB Output is correct
64 Correct 13 ms 5024 KB Output is correct
65 Correct 20 ms 5004 KB Output is correct
66 Correct 27 ms 5064 KB Output is correct
67 Correct 13 ms 5052 KB Output is correct
68 Correct 4 ms 5024 KB Output is correct
69 Correct 26 ms 5044 KB Output is correct
70 Correct 31 ms 5024 KB Output is correct
71 Correct 40 ms 5156 KB Output is correct
72 Correct 18 ms 5064 KB Output is correct
73 Correct 26 ms 5140 KB Output is correct
74 Correct 45 ms 5168 KB Output is correct
75 Correct 29 ms 5072 KB Output is correct
76 Correct 37 ms 5164 KB Output is correct
77 Correct 50 ms 5112 KB Output is correct
78 Correct 28 ms 5064 KB Output is correct
79 Correct 36 ms 5100 KB Output is correct
80 Correct 30 ms 5184 KB Output is correct
81 Correct 41 ms 5140 KB Output is correct
82 Correct 26 ms 5116 KB Output is correct
83 Correct 32 ms 5064 KB Output is correct
84 Correct 53 ms 5172 KB Output is correct
85 Correct 50 ms 5172 KB Output is correct
86 Correct 30 ms 5024 KB Output is correct
87 Correct 28 ms 5068 KB Output is correct
88 Correct 29 ms 5064 KB Output is correct
89 Correct 28 ms 5032 KB Output is correct
90 Correct 20 ms 5028 KB Output is correct
91 Correct 18 ms 5060 KB Output is correct
92 Correct 26 ms 5064 KB Output is correct
93 Correct 20 ms 5064 KB Output is correct
94 Correct 26 ms 5048 KB Output is correct
95 Correct 20 ms 5028 KB Output is correct
96 Correct 23 ms 5128 KB Output is correct
97 Correct 23 ms 5064 KB Output is correct