oj.uz

답안 #102948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102948 2019-03-28T08:02:46 Z briansu 커다란 상품 (IOI17_prize) C++14
100 / 100
 49 ms 3584 KB 
//{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}


const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=ll(1e15);

#include "prize.h"

ii save[MAXn];

ii myask(ll x)
{
	if(save[x].X != -1)return save[x];
	else {
		auto v = ask(x);
		return save[x] = ii(v[0], v[1]);
	}
}

ll mxcnt, ans;

void loot(ll x)
{
	if(myask(x).X + myask(x).Y == 0)ans = x;
}

void go(int l, int r, int ct, int pre)
{
	if(r < l || ct <= 0)return;
	ll h = (l + r) / 2;
	ii p = myask(h);
	if(p.X + p.Y == mxcnt){
		go(l, h-1, p.X - pre, pre);
		go(h+1, r, ct - (p.X - pre), p.X);
	}else{
		loot(h);
		for(int i = h+1;i <= r;i ++)
		{
			ii pp = myask(i);
			if(pp.X + pp.Y == mxcnt){
				go(i+1, r, ct- (pp.X - pre), p.X);
				break;
			}
			else loot(i);
		}
		for(int i = h-1;i >= l;i --)
		{
			ii pp = myask(i);
			if(pp.X + pp.Y == mxcnt){
				go(l, i-1, pp.X - pre, pre);
				break;
			}
			else loot(i);
		}
	}
}

int find_best(int n) {
	REP(i,n)save[i] = ii(-1, -1);
	ll start = -1;
	ll s = max(0, n / 2 - 500);
	for(int i = s;i < s + 1000 && i < n;i ++){
		auto p = myask(i);
		mxcnt = max(mxcnt, p.X + p.Y);
		if(p.X + p.Y == mxcnt) start = i;
		if(n >= 20000 && ((mxcnt - 10) * (mxcnt - 10) + 1) * ((mxcnt - 10) * (mxcnt - 10) + 1) + 1 > n)break;
	}
	debug(start);
	ans = -2;
	go(0, start - 1, myask(start).X, 0);
	go(start + 1, n-1, myask(start).Y, myask(start).X);
	return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 3320 KB Output is correct
2 Correct 8 ms 3576 KB Output is correct
3 Correct 16 ms 3388 KB Output is correct
4 Correct 18 ms 3320 KB Output is correct
5 Correct 7 ms 3388 KB Output is correct
6 Correct 15 ms 3456 KB Output is correct
7 Correct 15 ms 3448 KB Output is correct
8 Correct 8 ms 3452 KB Output is correct
9 Correct 16 ms 3448 KB Output is correct
10 Correct 16 ms 3328 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3320 KB Output is correct
2 Correct 12 ms 3388 KB Output is correct
3 Correct 15 ms 3444 KB Output is correct
4 Correct 13 ms 3384 KB Output is correct
5 Correct 12 ms 3492 KB Output is correct
6 Correct 13 ms 3320 KB Output is correct
7 Correct 14 ms 3448 KB Output is correct
8 Correct 12 ms 3320 KB Output is correct
9 Correct 15 ms 3368 KB Output is correct
10 Correct 13 ms 3456 KB Output is correct
11 Correct 6 ms 3576 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 10 ms 3456 KB Output is correct
14 Correct 10 ms 640 KB Output is correct
15 Correct 40 ms 3328 KB Output is correct
16 Correct 45 ms 3448 KB Output is correct
17 Correct 42 ms 3448 KB Output is correct
18 Correct 22 ms 3448 KB Output is correct
19 Correct 41 ms 3496 KB Output is correct
20 Correct 14 ms 2040 KB Output is correct
21 Correct 22 ms 3496 KB Output is correct
22 Correct 34 ms 3320 KB Output is correct
23 Correct 14 ms 3456 KB Output is correct
24 Correct 8 ms 3476 KB Output is correct
25 Correct 19 ms 3448 KB Output is correct
26 Correct 23 ms 3496 KB Output is correct
27 Correct 15 ms 3468 KB Output is correct
28 Correct 31 ms 3448 KB Output is correct
29 Correct 27 ms 3368 KB Output is correct
30 Correct 44 ms 3320 KB Output is correct
31 Correct 19 ms 3448 KB Output is correct
32 Correct 6 ms 3448 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 40 ms 3448 KB Output is correct
35 Correct 15 ms 3456 KB Output is correct
36 Correct 27 ms 3448 KB Output is correct
37 Correct 8 ms 3328 KB Output is correct
38 Correct 14 ms 3448 KB Output is correct
39 Correct 49 ms 3468 KB Output is correct
40 Correct 40 ms 3448 KB Output is correct
41 Correct 39 ms 3320 KB Output is correct
42 Correct 22 ms 3576 KB Output is correct
43 Correct 36 ms 3496 KB Output is correct
44 Correct 49 ms 3448 KB Output is correct
45 Correct 45 ms 3328 KB Output is correct
46 Correct 29 ms 3448 KB Output is correct
47 Correct 40 ms 3448 KB Output is correct
48 Correct 44 ms 3380 KB Output is correct
49 Correct 39 ms 3456 KB Output is correct
50 Correct 40 ms 3448 KB Output is correct
51 Correct 39 ms 3320 KB Output is correct
52 Correct 40 ms 3472 KB Output is correct
53 Correct 15 ms 3464 KB Output is correct
54 Correct 35 ms 3320 KB Output is correct
55 Correct 34 ms 3320 KB Output is correct
56 Correct 41 ms 3456 KB Output is correct
57 Correct 36 ms 3448 KB Output is correct
58 Correct 41 ms 3320 KB Output is correct
59 Correct 26 ms 3384 KB Output is correct
60 Correct 21 ms 3388 KB Output is correct
61 Correct 14 ms 3344 KB Output is correct
62 Correct 12 ms 3384 KB Output is correct
63 Correct 8 ms 3320 KB Output is correct
64 Correct 15 ms 3324 KB Output is correct
65 Correct 6 ms 3320 KB Output is correct
66 Correct 6 ms 3468 KB Output is correct
67 Correct 9 ms 3448 KB Output is correct
68 Correct 7 ms 3456 KB Output is correct
69 Correct 9 ms 3448 KB Output is correct
70 Correct 6 ms 3576 KB Output is correct
71 Correct 21 ms 3328 KB Output is correct
72 Correct 8 ms 3328 KB Output is correct
73 Correct 33 ms 3456 KB Output is correct
74 Correct 34 ms 3328 KB Output is correct
75 Correct 11 ms 3328 KB Output is correct
76 Correct 31 ms 3328 KB Output is correct
77 Correct 48 ms 3396 KB Output is correct
78 Correct 10 ms 3456 KB Output is correct
79 Correct 21 ms 3456 KB Output is correct
80 Correct 34 ms 3320 KB Output is correct
81 Correct 20 ms 3584 KB Output is correct
82 Correct 31 ms 3456 KB Output is correct
83 Correct 14 ms 3484 KB Output is correct
84 Correct 24 ms 3456 KB Output is correct
85 Correct 22 ms 3476 KB Output is correct
86 Correct 12 ms 3456 KB Output is correct
87 Correct 8 ms 3328 KB Output is correct
88 Correct 9 ms 3456 KB Output is correct
89 Correct 10 ms 3456 KB Output is correct
90 Correct 8 ms 3392 KB Output is correct
91 Correct 8 ms 3456 KB Output is correct
92 Correct 8 ms 3328 KB Output is correct
93 Correct 13 ms 3456 KB Output is correct
94 Correct 13 ms 3456 KB Output is correct
95 Correct 8 ms 3328 KB Output is correct
96 Correct 7 ms 3456 KB Output is correct
97 Correct 9 ms 3456 KB Output is correct