oj.uz

답안 #1048219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048219 2024-08-08T05:33:33 Z becaido 커다란 상품 (IOI17_prize) C++17
20 / 100
 42 ms 2248 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#include "grader.cpp"
#else
#include "prize.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 2e5 + 5;
const int K = 450;

int mx, L[SIZE], R[SIZE];
vector<int> id;

pair<int, int> que(int i) {
    if (L[i] == -1) {
        auto v = ask(i);
        L[i] = v[0], R[i] = v[1];
    }
    return {L[i], R[i]};
}

void rec(int l, int r, int lc, int rc, int tot) {
    if (l > r || tot == 0) return;
    if (l == r) {
        id.pb(l);
        return;
    }
    int mid = (l + r) / 2;
    FOR (i, mid, r) {
        auto [lcnt, rcnt] = que(i);
        if (lcnt + rcnt != mx) {
            id.pb(i);
            continue;
        }
        lcnt -= lc, rcnt -= rc;
        rec(l, mid - 1, lc, rc + (i - mid) + rcnt, tot - (i - mid) - rcnt);
        rec(i + 1, r, lc + lcnt, rc, tot - lcnt);
        return;
    }
    rec(l, mid - 1, lc, rc + (r - mid + 1), tot - (r - mid + 1));
}

int find_best(int n) {
    FOR (i, 0, n - 1) L[i] = R[i] = -1;
    if (n < K) {
        FOR (i, 0, n - 1) {
            auto [l, r] = que(i);
            if (l == 0 && r == 0) return i;
        }
    }

    mx = 0;
    FOR (i, 0, K - 1) {
        auto [l, r] = que(i);
        mx = max(mx, l + r);
    }
    debug(mx);

    id.clear();
    rec(0, n - 1, 0, 0, mx);
    for (int i : id) {
        auto [l, r] = que(i);
        if (l == 0 && r == 0) return i;
    }
}

/*
in1
8
3 2 3 1 3 3 2 3
*/

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:18:20: warning: statement has no effect [-Wunused-value]
   18 | #define debug(...) 7122
      |                    ^~~~
prize.cpp:77:5: note: in expansion of macro 'debug'
   77 |     debug(mx);
      |     ^~~~~
prize.cpp:85:1: warning: control reaches end of non-void function [-Wreturn-type]
   85 | }
      | ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 3 ms 1880 KB Output is correct
6 Correct 3 ms 1880 KB Output is correct
7 Correct 3 ms 1880 KB Output is correct
8 Correct 4 ms 1880 KB Output is correct
9 Correct 3 ms 1880 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1968 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 2 ms 1880 KB Output is correct
8 Correct 2 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 3 ms 1876 KB Output is correct
12 Correct 4 ms 1880 KB Output is correct
13 Correct 4 ms 1972 KB Output is correct
14 Correct 8 ms 600 KB Output is correct
15 Correct 12 ms 1880 KB Output is correct
16 Correct 25 ms 2136 KB Output is correct
17 Correct 17 ms 1880 KB Output is correct
18 Correct 14 ms 1880 KB Output is correct
19 Correct 13 ms 1880 KB Output is correct
20 Correct 13 ms 1368 KB Output is correct
21 Correct 18 ms 1880 KB Output is correct
22 Correct 15 ms 2248 KB Output is correct
23 Correct 3 ms 1880 KB Output is correct
24 Correct 6 ms 1880 KB Output is correct
25 Correct 11 ms 1880 KB Output is correct
26 Correct 19 ms 2000 KB Output is correct
27 Correct 3 ms 1880 KB Output is correct
28 Correct 15 ms 2224 KB Output is correct
29 Correct 13 ms 2000 KB Output is correct
30 Correct 14 ms 1880 KB Output is correct
31 Correct 17 ms 1880 KB Output is correct
32 Correct 4 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 17 ms 1968 KB Output is correct
35 Correct 3 ms 2132 KB Output is correct
36 Correct 17 ms 1968 KB Output is correct
37 Correct 4 ms 1880 KB Output is correct
38 Correct 4 ms 1880 KB Output is correct
39 Correct 16 ms 1880 KB Output is correct
40 Correct 19 ms 1880 KB Output is correct
41 Correct 24 ms 2136 KB Output is correct
42 Correct 18 ms 1880 KB Output is correct
43 Correct 17 ms 2004 KB Output is correct
44 Correct 18 ms 1880 KB Output is correct
45 Correct 17 ms 1880 KB Output is correct
46 Correct 22 ms 2136 KB Output is correct
47 Correct 16 ms 1880 KB Output is correct
48 Correct 17 ms 2136 KB Output is correct
49 Correct 31 ms 2000 KB Output is correct
50 Correct 20 ms 1880 KB Output is correct
51 Correct 14 ms 1880 KB Output is correct
52 Correct 19 ms 1880 KB Output is correct
53 Correct 3 ms 1880 KB Output is correct
54 Correct 20 ms 2136 KB Output is correct
55 Correct 18 ms 1880 KB Output is correct
56 Correct 27 ms 1880 KB Output is correct
57 Correct 22 ms 1880 KB Output is correct
58 Correct 12 ms 1880 KB Output is correct
59 Correct 20 ms 1880 KB Output is correct
60 Correct 20 ms 1880 KB Output is correct
61 Correct 3 ms 1876 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 3 ms 1880 KB Output is correct
64 Correct 3 ms 1880 KB Output is correct
65 Correct 3 ms 1880 KB Output is correct
66 Correct 4 ms 1880 KB Output is correct
67 Correct 4 ms 1880 KB Output is correct
68 Correct 3 ms 1880 KB Output is correct
69 Correct 5 ms 1880 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Partially correct 19 ms 1880 KB Partially correct - number of queries: 5208
72 Correct 4 ms 1880 KB Output is correct
73 Partially correct 16 ms 1880 KB Partially correct - number of queries: 5145
74 Partially correct 28 ms 1880 KB Partially correct - number of queries: 5172
75 Correct 3 ms 1876 KB Output is correct
76 Correct 18 ms 1880 KB Output is correct
77 Correct 21 ms 1880 KB Output is correct
78 Correct 3 ms 1880 KB Output is correct
79 Correct 12 ms 2136 KB Output is correct
80 Correct 25 ms 1880 KB Output is correct
81 Correct 15 ms 2136 KB Output is correct
82 Correct 19 ms 1880 KB Output is correct
83 Correct 2 ms 1876 KB Output is correct
84 Correct 15 ms 1880 KB Output is correct
85 Correct 25 ms 2128 KB Output is correct
86 Incorrect 42 ms 2128 KB Incorrect
87 Halted 0 ms 0 KB -