oj.uz

답안 #803236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803236 2023-08-03T02:05:29 Z Username4132 커다란 상품 (IOI17_prize) C++14
100 / 100
 48 ms 3528 KB 
#include "prize.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using pii = pair<int, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back
#define F first
#define S second

const int MAXN = 200010;
int n, can=-1, offset[MAXN], sum;
pii info[MAXN];
vector<int> values, obt;

pii myask(int i){
	if(info[i].F==-1){
		vector<int> ret = ask(i);
		info[i] = {ret[0], ret[1]};
	}
	return info[i];
}

bool dfs(int l, int r, int x, int y){
	if(l==r || x+y==sum) return true;
	int mid = (l+r)>>1, mn=n+2, mx=-1, lx, ly, cnt=0, lst=mid;
	forn(i, r-l){
		int pt = mid + offset[i];
		lst=pt;
		mn = min(mn, pt);
		mx = max(mx, pt);
		pii res = myask(values[pt]);
		lx=res.F, ly=res.S;
		if(res.F + res.S > sum){
			sum = res.F + res.S;
			can = values[pt];
			return false;
		}
		if(res.F + res.S < sum) obt.PB(values[pt]);
		if(res.F + res.S == sum) break;
		++cnt;
	}

	int x2=lx, y2=ly;
	if(lst>mid) y2+=cnt;
	else x2+=cnt;

	if(!dfs(l, mn, x, y2)) return false;
	if(!dfs(mx+1, r, x2, y)) return false;
	return true;
}


int find_best(int N) {
	n=N;
	values.resize(n);
	forn(i, n) info[i]={-1, -1}, values[i]=i;
	forn(i, n) offset[i]=(i&1? -((i+1)>>1) : ((i+1)>>1));
	while(values.size()>1){
		sum = -1;
		while(!dfs(0, values.size(), 0, 0)){
			obt.clear();
			if(sum==0) return can;
		}
		swap(values, obt);
		obt.clear();
		sort(values.begin(), values.end());
	}
	return values.front();
}

Compilation message

prize.cpp: In function 'bool dfs(int, int, int, int)':
prize.cpp:26:14: warning: 'x2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |  if(l==r || x+y==sum) return true;
      |             ~^~
prize.cpp:49:9: warning: 'ly' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |  if(!dfs(l, mn, x, y2)) return false;
      |      ~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3408 KB Output is correct
2 Correct 2 ms 3352 KB Output is correct
3 Correct 2 ms 3408 KB Output is correct
4 Correct 2 ms 3376 KB Output is correct
5 Correct 2 ms 3408 KB Output is correct
6 Correct 2 ms 3368 KB Output is correct
7 Correct 2 ms 3300 KB Output is correct
8 Correct 2 ms 3408 KB Output is correct
9 Correct 3 ms 3352 KB Output is correct
10 Correct 2 ms 3408 KB Output is correct
11 Correct 6 ms 3368 KB Output is correct
12 Correct 5 ms 3368 KB Output is correct
13 Correct 6 ms 3408 KB Output is correct
14 Correct 7 ms 592 KB Output is correct
15 Correct 37 ms 3428 KB Output is correct
16 Correct 37 ms 3428 KB Output is correct
17 Correct 20 ms 3528 KB Output is correct
18 Correct 45 ms 3372 KB Output is correct
19 Correct 16 ms 3452 KB Output is correct
20 Correct 25 ms 1872 KB Output is correct
21 Correct 38 ms 3428 KB Output is correct
22 Correct 28 ms 3408 KB Output is correct
23 Correct 3 ms 3352 KB Output is correct
24 Correct 6 ms 3364 KB Output is correct
25 Correct 42 ms 3368 KB Output is correct
26 Correct 31 ms 3428 KB Output is correct
27 Correct 3 ms 3368 KB Output is correct
28 Correct 31 ms 3428 KB Output is correct
29 Correct 31 ms 3368 KB Output is correct
30 Correct 28 ms 3408 KB Output is correct
31 Correct 37 ms 3368 KB Output is correct
32 Correct 6 ms 3364 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 17 ms 3452 KB Output is correct
35 Correct 4 ms 3364 KB Output is correct
36 Correct 33 ms 3432 KB Output is correct
37 Correct 3 ms 3368 KB Output is correct
38 Correct 3 ms 3372 KB Output is correct
39 Correct 33 ms 3368 KB Output is correct
40 Correct 15 ms 3444 KB Output is correct
41 Correct 43 ms 3368 KB Output is correct
42 Correct 40 ms 3368 KB Output is correct
43 Correct 27 ms 3372 KB Output is correct
44 Correct 40 ms 3368 KB Output is correct
45 Correct 34 ms 3408 KB Output is correct
46 Correct 24 ms 3452 KB Output is correct
47 Correct 37 ms 3480 KB Output is correct
48 Correct 23 ms 3444 KB Output is correct
49 Correct 30 ms 3372 KB Output is correct
50 Correct 30 ms 3424 KB Output is correct
51 Correct 38 ms 3428 KB Output is correct
52 Correct 39 ms 3428 KB Output is correct
53 Correct 2 ms 3368 KB Output is correct
54 Correct 28 ms 3372 KB Output is correct
55 Correct 28 ms 3428 KB Output is correct
56 Correct 38 ms 3424 KB Output is correct
57 Correct 28 ms 3432 KB Output is correct
58 Correct 40 ms 3408 KB Output is correct
59 Correct 23 ms 3432 KB Output is correct
60 Correct 17 ms 3452 KB Output is correct
61 Correct 2 ms 3372 KB Output is correct
62 Correct 3 ms 3408 KB Output is correct
63 Correct 3 ms 3376 KB Output is correct
64 Correct 2 ms 3356 KB Output is correct
65 Correct 2 ms 3372 KB Output is correct
66 Correct 5 ms 3408 KB Output is correct
67 Correct 4 ms 3432 KB Output is correct
68 Correct 3 ms 3452 KB Output is correct
69 Correct 6 ms 3448 KB Output is correct
70 Correct 4 ms 3408 KB Output is correct
71 Correct 31 ms 3408 KB Output is correct
72 Correct 6 ms 3408 KB Output is correct
73 Correct 23 ms 3408 KB Output is correct
74 Correct 24 ms 3436 KB Output is correct
75 Correct 3 ms 3408 KB Output is correct
76 Correct 26 ms 3408 KB Output is correct
77 Correct 37 ms 3408 KB Output is correct
78 Correct 6 ms 3408 KB Output is correct
79 Correct 16 ms 3408 KB Output is correct
80 Correct 39 ms 3420 KB Output is correct
81 Correct 40 ms 3436 KB Output is correct
82 Correct 32 ms 3408 KB Output is correct
83 Correct 3 ms 3408 KB Output is correct
84 Correct 29 ms 3408 KB Output is correct
85 Correct 48 ms 3408 KB Output is correct
86 Correct 6 ms 3408 KB Output is correct
87 Correct 3 ms 3372 KB Output is correct
88 Correct 8 ms 3408 KB Output is correct
89 Correct 5 ms 3408 KB Output is correct
90 Correct 2 ms 3368 KB Output is correct
91 Correct 5 ms 3408 KB Output is correct
92 Correct 5 ms 3408 KB Output is correct
93 Correct 5 ms 3408 KB Output is correct
94 Correct 4 ms 3408 KB Output is correct
95 Correct 5 ms 3356 KB Output is correct
96 Correct 4 ms 3408 KB Output is correct
97 Correct 2 ms 3408 KB Output is correct