oj.uz

답안 #1015938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015938 2024-07-07T06:00:09 Z hotboy2703 커다란 상품 (IOI17_prize) C++17
20 / 100
 27 ms 3504 KB 
#include "prize.h"

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
const ll MAXN = 2e5+100;
pll a[MAXN];
ll ans = -1;
ll req = 0;
void query(ll i){
    if (a[i].fi==-1){
        vector <int> tmp = ask(i);
        a[i] = MP(tmp[0],tmp[1]);
        if (a[i].fi+a[i].se==0)ans = i;
    }
}
void solve(ll l,ll r,ll l1,ll r1){
//    cout<<l<<' '<<r<<' '<<l1<<' '<<r1<<endl;
    ll k=r1-l1;
    if (k==0)return;
    ll mid = (l + r) >> 1;
    ll id = -1;
    for (ll i = 0;i < k;i ++){
        ll cur_mid = mid + ((i+1)/2) * (i%2?1:-1);
        query(cur_mid);
        if (a[cur_mid].fi+a[cur_mid].se==req){
            id = i;
            break;
        }
    }
    if (id==-1)return;
    ll mid_l,mid_r;
    ll L,R;
    if (id%2){
        mid_r = mid + ((id+1)/2);
        mid_l = mid - ((id-1)/2);
        R = a[mid_r].fi;
        L = R-id;
    }
    else{
        mid_r = mid + (id/2);
        mid_l = mid - (id/2);
        L = a[mid_l].fi;
        R = L+id;
    }
    solve(l,mid_l-1,l1,L);
    solve(mid_r+1,r,R,r1);
}
mt19937_64 rng(69420);
int find_best(int n) {
    memset(a,-1,sizeof a);
//    req = 3;
	for (ll ii = 0;ii < min(50,n);ii ++){
        ll i = rng()%n;
        query(i);
        req = max(a[i].fi+a[i].se,req);
	}
	solve(0,n-1,0,req);
    return ans;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:58:25: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'struct std::pair<long long int, long long int>' with no trivial copy-assignment [-Wclass-memaccess]
   58 |     memset(a,-1,sizeof a);
      |                         ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/vector:60,
                 from prize.h:1,
                 from prize.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<long long int, long long int>' declared here
  211 |     struct pair
      |            ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 2 ms 3416 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 2 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 3416 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 3 ms 3416 KB Output is correct
13 Correct 3 ms 3416 KB Output is correct
14 Correct 7 ms 3416 KB Output is correct
15 Correct 18 ms 3416 KB Output is correct
16 Correct 22 ms 3412 KB Output is correct
17 Correct 25 ms 3416 KB Output is correct
18 Correct 17 ms 3416 KB Output is correct
19 Correct 17 ms 3416 KB Output is correct
20 Correct 7 ms 3412 KB Output is correct
21 Correct 18 ms 3416 KB Output is correct
22 Correct 11 ms 3416 KB Output is correct
23 Correct 2 ms 3416 KB Output is correct
24 Correct 2 ms 3416 KB Output is correct
25 Correct 20 ms 3416 KB Output is correct
26 Correct 13 ms 3416 KB Output is correct
27 Correct 2 ms 3416 KB Output is correct
28 Correct 17 ms 3416 KB Output is correct
29 Correct 18 ms 3416 KB Output is correct
30 Correct 15 ms 3416 KB Output is correct
31 Correct 21 ms 3416 KB Output is correct
32 Correct 3 ms 3416 KB Output is correct
33 Correct 1 ms 3416 KB Output is correct
34 Correct 17 ms 3504 KB Output is correct
35 Correct 2 ms 3416 KB Output is correct
36 Correct 18 ms 3416 KB Output is correct
37 Correct 3 ms 3416 KB Output is correct
38 Correct 2 ms 3416 KB Output is correct
39 Correct 19 ms 3416 KB Output is correct
40 Correct 14 ms 3416 KB Output is correct
41 Correct 15 ms 3416 KB Output is correct
42 Correct 18 ms 3416 KB Output is correct
43 Correct 21 ms 3416 KB Output is correct
44 Correct 22 ms 3416 KB Output is correct
45 Correct 21 ms 3416 KB Output is correct
46 Correct 23 ms 3416 KB Output is correct
47 Correct 22 ms 3416 KB Output is correct
48 Correct 10 ms 3416 KB Output is correct
49 Correct 18 ms 3412 KB Output is correct
50 Correct 18 ms 3416 KB Output is correct
51 Correct 15 ms 3416 KB Output is correct
52 Correct 15 ms 3416 KB Output is correct
53 Correct 1 ms 3416 KB Output is correct
54 Correct 18 ms 3416 KB Output is correct
55 Correct 18 ms 3416 KB Output is correct
56 Correct 17 ms 3416 KB Output is correct
57 Correct 24 ms 3416 KB Output is correct
58 Correct 20 ms 3416 KB Output is correct
59 Correct 27 ms 3416 KB Output is correct
60 Correct 15 ms 3416 KB Output is correct
61 Correct 1 ms 3416 KB Output is correct
62 Correct 2 ms 3416 KB Output is correct
63 Correct 2 ms 3416 KB Output is correct
64 Correct 2 ms 3416 KB Output is correct
65 Correct 1 ms 3416 KB Output is correct
66 Correct 2 ms 3416 KB Output is correct
67 Correct 3 ms 3416 KB Output is correct
68 Correct 4 ms 3416 KB Output is correct
69 Correct 3 ms 3504 KB Output is correct
70 Correct 3 ms 3416 KB Output is correct
71 Correct 19 ms 3416 KB Output is correct
72 Correct 3 ms 3416 KB Output is correct
73 Correct 16 ms 3416 KB Output is correct
74 Correct 20 ms 3412 KB Output is correct
75 Correct 2 ms 3416 KB Output is correct
76 Correct 17 ms 3416 KB Output is correct
77 Correct 16 ms 3416 KB Output is correct
78 Correct 2 ms 3416 KB Output is correct
79 Correct 9 ms 3416 KB Output is correct
80 Correct 16 ms 3416 KB Output is correct
81 Correct 14 ms 3416 KB Output is correct
82 Correct 16 ms 3416 KB Output is correct
83 Correct 2 ms 3416 KB Output is correct
84 Correct 18 ms 3416 KB Output is correct
85 Correct 18 ms 3416 KB Output is correct
86 Incorrect 2 ms 3416 KB Integer -1 violates the range [0, 199999]
87 Halted 0 ms 0 KB -