oj.uz

답안 #1055686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055686 2024-08-13T03:12:56 Z thieunguyenhuy 커다란 상품 (IOI17_prize) C++17
20 / 100
 48 ms 1608 KB 
#ifndef hwe
    #include "prize.h"
#endif
 
#include <bits/stdc++.h>
using namespace std;
 
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
 
#define Int __int128
#define fi first
#define se second
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
 
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
 
template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}
 
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
 
map<int, vector<int>> mem;
int ans = -1, not_lolipop = -1, counter = 0;
 
#ifdef hwe
vector<int> ask(int id) {
    return {0, 1};
}
#endif
 
vector<int> myask(int id) {
    auto it = mem.find(id);
    if (it != mem.end()) return mem[id];
    vector<int> tmp = ask(id); mem[id] = tmp;
    if (tmp[0] + tmp[1] == 0) ans = id;
    return tmp;
}
 
void dnc(int l, int r, int prefL, int prefR) {
    if (ans != -1) return;
    if (prefR - prefL == 0) return;
    
    if (l == r) {
        myask(l);
        return;
    }
 
    int mid = l + r >> 1; int pref_mid = 0;
 
    for (int i = mid; i >= l; --i) {
        vector<int> tmp = myask(i);
        if (tmp[0] + tmp[1] == not_lolipop) {
            pref_mid += tmp[0];
            break;
        }
        ++pref_mid;
    }
 
    dnc(l, mid, prefL, pref_mid);
    dnc(mid + 1, r, pref_mid, prefR);
}

void find_lolipop(int l, int r) {
    if (ans != -1) return;
    if (counter == 500) return;

    int mid = l + r >> 1; vector<int> ask_mid = myask(mid); ++counter;
    maximize(not_lolipop, ask_mid[0] + ask_mid[1]);

    if (l == r) return;

    find_lolipop(l, mid);
    find_lolipop(mid + 1, r);
}
 
int find_best(int n) {
    ans = not_lolipop = -1; counter = 0;

    find_lolipop(0, n - 1); 
    dnc(0, n - 1, 0, not_lolipop);
 
    assert(0 <= ans && ans < n);
    return ans;
}
 
#ifdef hwe
signed main() {
 
 
    cerr << '\n'; return 0;
}
#endif

Compilation message

prize.cpp: In function 'void dnc(int, int, int, int)':
prize.cpp:96:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   96 |     int mid = l + r >> 1; int pref_mid = 0;
      |               ~~^~~
prize.cpp: In function 'void find_lolipop(int, int)':
prize.cpp:115:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  115 |     int mid = l + r >> 1; vector<int> ask_mid = myask(mid); ++counter;
      |               ~~^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 448 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 19 ms 856 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 20 ms 936 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 5 ms 684 KB Output is correct
21 Correct 10 ms 600 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 11 ms 856 KB Output is correct
26 Correct 10 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 17 ms 660 KB Output is correct
29 Correct 14 ms 600 KB Output is correct
30 Correct 18 ms 860 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 7 ms 476 KB Output is correct
35 Correct 2 ms 344 KB Output is correct
36 Correct 5 ms 684 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 9 ms 600 KB Output is correct
40 Correct 21 ms 728 KB Output is correct
41 Correct 16 ms 600 KB Output is correct
42 Correct 12 ms 600 KB Output is correct
43 Correct 11 ms 856 KB Output is correct
44 Correct 8 ms 600 KB Output is correct
45 Correct 6 ms 600 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 13 ms 856 KB Output is correct
48 Correct 14 ms 812 KB Output is correct
49 Correct 3 ms 344 KB Output is correct
50 Correct 21 ms 988 KB Output is correct
51 Correct 7 ms 856 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 8 ms 600 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 26 ms 856 KB Output is correct
57 Correct 11 ms 600 KB Output is correct
58 Correct 15 ms 1112 KB Output is correct
59 Correct 20 ms 784 KB Output is correct
60 Correct 13 ms 708 KB Output is correct
61 Correct 2 ms 344 KB Output is correct
62 Correct 2 ms 432 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 2 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 4 ms 344 KB Output is correct
67 Correct 1 ms 460 KB Output is correct
68 Correct 2 ms 344 KB Output is correct
69 Correct 4 ms 344 KB Output is correct
70 Correct 3 ms 344 KB Output is correct
71 Correct 17 ms 1148 KB Output is correct
72 Correct 3 ms 600 KB Output is correct
73 Correct 16 ms 1316 KB Output is correct
74 Correct 31 ms 864 KB Output is correct
75 Correct 2 ms 344 KB Output is correct
76 Correct 17 ms 848 KB Output is correct
77 Correct 20 ms 848 KB Output is correct
78 Correct 3 ms 344 KB Output is correct
79 Correct 10 ms 596 KB Output is correct
80 Correct 19 ms 1032 KB Output is correct
81 Correct 24 ms 1052 KB Output is correct
82 Correct 23 ms 1608 KB Output is correct
83 Correct 2 ms 596 KB Output is correct
84 Correct 16 ms 848 KB Output is correct
85 Correct 28 ms 1036 KB Output is correct
86 Correct 3 ms 348 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 3 ms 340 KB Output is correct
89 Correct 4 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 3 ms 344 KB Output is correct
92 Correct 4 ms 344 KB Output is correct
93 Incorrect 48 ms 1288 KB Incorrect
94 Halted 0 ms 0 KB -