oj.uz

답안 #1089700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089700 2024-09-16T22:34:47 Z urd05 커다란 상품 (IOI17_prize) C++17
20 / 100
 39 ms 2136 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> P;
int n;
P save[200005];

P query(int i) {
    if (save[i].first!=-1) {
        return save[i];
    }
    vector<int> got=ask(i);
    return save[i]=P(got[0],got[1]);
}

vector<int> vec;
int mxv;

void solve(int l,int r,int k,int y) {
    if (l>r||k==0) {
        return;
    }
    int mid=(l+r)/2;
    P got=query(mid);
    if (got.first+got.second==mxv) {
            if (got.first+got.second==0) {
                return;
            }
        solve(l,mid-1,y-got.second,y);
        solve(mid+1,r,k-(y-got.second),got.second);
        return;
    }
    vec.push_back(mid);
    int cnt=1;
    for(int i=mid-1;i>=l;i--) {
        P got=query(i);
        if (got.first+got.second==mxv) {
            solve(l,i-1,y-got.second,y);
            solve(mid+1,r,k-(y-got.second)-cnt,got.second-cnt);
            return;
        }
        else {
            if (got.first+got.second==0) {
                return;
            }
            vec.push_back(i);
            cnt++;
        }
    }
    solve(mid+1,r,k-cnt,y-cnt);
}

int find_best(int N) {
    n=N;
	for(int i = 0; i < n; i++) {
	    save[i]=P(-1,-1);
	}
	int ind=450;
	int cnt=0;
	set<int> s;
	for(int i=0;i<480;i++) {
	    P got=query(i);
	    s.insert(got.first+got.second);
	    if (s.size()==5) {
	        int mx=*s.rbegin();
	        mxv=mx;
	        for(int j=0;j<=i;j++) {
	            if (save[j].first+save[j].second!=mx) {
	                vec.push_back(j);
	                cnt--;
	            }
	            else {
	                cnt=save[j].second;
	            }
	        }
	        ind=i+1;
	        break;
	    }
	    if (i==479||i==n-1) {
	        ind=i+1;
	        int mx=*s.rbegin();
	        mxv=mx;
	        for(int j=0;j<=i;j++) {
	            if (save[j].first+save[j].second!=mx) {
	                vec.push_back(j);
	                cnt--;
	            }
	            else {
	                cnt=save[j].second;
	            }
	        }
	        break;
	    }
	}
	for(int x:vec) {
	    if (query(x)==P(0,0)) {
	        return x;
	    }
	}
	solve(ind,n-1,cnt,cnt);
	for(int x:vec) {
	    if (query(x)==P(0,0)) {
	        return x;
	    }
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1880 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 3 ms 1972 KB Output is correct
4 Correct 3 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 2 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1880 KB Output is correct
10 Correct 3 ms 1880 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 3 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 3 ms 1976 KB Output is correct
9 Correct 3 ms 1880 KB Output is correct
10 Correct 3 ms 1880 KB Output is correct
11 Correct 5 ms 1880 KB Output is correct
12 Correct 4 ms 1880 KB Output is correct
13 Correct 7 ms 1880 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 21 ms 1880 KB Output is correct
16 Correct 24 ms 1880 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 16 ms 1880 KB Output is correct
19 Correct 3 ms 1880 KB Output is correct
20 Correct 15 ms 1224 KB Output is correct
21 Correct 23 ms 1880 KB Output is correct
22 Correct 12 ms 1880 KB Output is correct
23 Correct 3 ms 1880 KB Output is correct
24 Correct 3 ms 1880 KB Output is correct
25 Correct 26 ms 1880 KB Output is correct
26 Correct 20 ms 1880 KB Output is correct
27 Correct 3 ms 1880 KB Output is correct
28 Correct 18 ms 2000 KB Output is correct
29 Correct 22 ms 2000 KB Output is correct
30 Correct 25 ms 1996 KB Output is correct
31 Correct 3 ms 1880 KB Output is correct
32 Correct 5 ms 1880 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 20 ms 1880 KB Output is correct
35 Correct 3 ms 1880 KB Output is correct
36 Correct 22 ms 1880 KB Output is correct
37 Correct 3 ms 1880 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 23 ms 1964 KB Output is correct
40 Correct 19 ms 2136 KB Output is correct
41 Correct 20 ms 2004 KB Output is correct
42 Correct 22 ms 2136 KB Output is correct
43 Correct 39 ms 2136 KB Output is correct
44 Correct 18 ms 2132 KB Output is correct
45 Correct 27 ms 2004 KB Output is correct
46 Correct 2 ms 1880 KB Output is correct
47 Correct 30 ms 1992 KB Output is correct
48 Correct 24 ms 1880 KB Output is correct
49 Correct 23 ms 2136 KB Output is correct
50 Correct 27 ms 1880 KB Output is correct
51 Correct 35 ms 2008 KB Output is correct
52 Correct 16 ms 1880 KB Output is correct
53 Correct 4 ms 1880 KB Output is correct
54 Correct 28 ms 1880 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Correct 27 ms 1880 KB Output is correct
57 Correct 26 ms 2000 KB Output is correct
58 Correct 27 ms 1880 KB Output is correct
59 Correct 27 ms 2128 KB Output is correct
60 Correct 23 ms 1880 KB Output is correct
61 Correct 4 ms 1880 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 5 ms 1880 KB Output is correct
64 Correct 3 ms 1880 KB Output is correct
65 Incorrect 3 ms 1880 KB answer is not correct
66 Halted 0 ms 0 KB -