답안 #82287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
82287 2018-10-29T17:56:04 Z SecretAgent007 커다란 상품 (IOI17_prize) C++17
100 / 100
56 ms 5496 KB
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;

vector<int> tab[200009];

vector<int> query(int a){
    if(!tab[a].empty()){
        return tab[a];
    }
    return tab[a] = ask(a);
}

int sumQuery(int a){
    return query(a)[0]+query(a)[1];
}

int ans = -1, maxi = 0;

void solve(int l, int r, int nb, int ln){
    if(nb == 0) return;
    if(l > r) return ;
    int a = r-l+1;
    int cnt = 0;
    int start = l;
    int mem = ln;
    for(int i = 1; i <= nb; i++){
        int curr = l+max(1,(r-l+2)/(nb+1))*i-1;
        if(curr >= l && curr <= r){
            if(sumQuery(curr) == 0){
                ans = curr;
                break;
            }
            if(sumQuery(curr) != maxi){
                cnt++;
                continue;
            }
            solve(start, curr-1, query(curr)[0]-mem, mem);
            start = curr+1;
            mem = query(curr)[0];
        }

    }
    if(ans == -1 && cnt  < nb && start <= r){
        solve(start, r, nb-mem+ln, mem);
    }
}

int find_best(int n)
{
    for(int i = 1; i <= 1000; i++){
        int curr = max(1,(n/1000))*i;
        if(curr >= 0 && curr < n){
            if(sumQuery(curr) == 0) return curr;
            maxi = max(maxi, sumQuery(curr));
        }
    }
    int start = 0;
    int ln = 0;
    for(int i = 1; i <= 1000; i++){
        if(ans != -1) return ans;
        int curr = max(1,(n/1000))*i;
        if(curr >= 0 && curr < n && sumQuery(curr) == maxi){
            solve(start, curr-1, query(curr)[0]-ln, ln);
            start = curr+1;
            ln = query(curr)[0];
        }
    }
    if(ans == -1){
        solve(start, n-1, maxi-ln,ln);
    }
	return ans;
}

Compilation message

prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:23:9: warning: unused variable 'a' [-Wunused-variable]
     int a = r-l+1;
         ^
# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5136 KB Output is correct
2 Correct 11 ms 5212 KB Output is correct
3 Correct 14 ms 5212 KB Output is correct
4 Correct 14 ms 5212 KB Output is correct
5 Correct 12 ms 5212 KB Output is correct
6 Correct 12 ms 5256 KB Output is correct
7 Correct 10 ms 5256 KB Output is correct
8 Correct 9 ms 5256 KB Output is correct
9 Correct 14 ms 5256 KB Output is correct
10 Correct 13 ms 5256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 5256 KB Output is correct
2 Correct 11 ms 5256 KB Output is correct
3 Correct 15 ms 5312 KB Output is correct
4 Correct 15 ms 5312 KB Output is correct
5 Correct 8 ms 5312 KB Output is correct
6 Correct 11 ms 5312 KB Output is correct
7 Correct 10 ms 5312 KB Output is correct
8 Correct 12 ms 5312 KB Output is correct
9 Correct 15 ms 5312 KB Output is correct
10 Correct 15 ms 5312 KB Output is correct
11 Correct 12 ms 5348 KB Output is correct
12 Correct 15 ms 5384 KB Output is correct
13 Correct 17 ms 5384 KB Output is correct
14 Correct 15 ms 5384 KB Output is correct
15 Correct 19 ms 5384 KB Output is correct
16 Correct 38 ms 5384 KB Output is correct
17 Correct 13 ms 5384 KB Output is correct
18 Correct 34 ms 5392 KB Output is correct
19 Correct 14 ms 5392 KB Output is correct
20 Correct 20 ms 5392 KB Output is correct
21 Correct 23 ms 5392 KB Output is correct
22 Correct 17 ms 5392 KB Output is correct
23 Correct 16 ms 5392 KB Output is correct
24 Correct 11 ms 5392 KB Output is correct
25 Correct 28 ms 5392 KB Output is correct
26 Correct 27 ms 5392 KB Output is correct
27 Correct 12 ms 5392 KB Output is correct
28 Correct 43 ms 5392 KB Output is correct
29 Correct 22 ms 5392 KB Output is correct
30 Correct 33 ms 5496 KB Output is correct
31 Correct 11 ms 5496 KB Output is correct
32 Correct 15 ms 5496 KB Output is correct
33 Correct 6 ms 5496 KB Output is correct
34 Correct 22 ms 5496 KB Output is correct
35 Correct 12 ms 5496 KB Output is correct
36 Correct 14 ms 5496 KB Output is correct
37 Correct 18 ms 5496 KB Output is correct
38 Correct 11 ms 5496 KB Output is correct
39 Correct 18 ms 5496 KB Output is correct
40 Correct 40 ms 5496 KB Output is correct
41 Correct 30 ms 5496 KB Output is correct
42 Correct 34 ms 5496 KB Output is correct
43 Correct 30 ms 5496 KB Output is correct
44 Correct 25 ms 5496 KB Output is correct
45 Correct 24 ms 5496 KB Output is correct
46 Correct 11 ms 5496 KB Output is correct
47 Correct 17 ms 5496 KB Output is correct
48 Correct 23 ms 5496 KB Output is correct
49 Correct 14 ms 5496 KB Output is correct
50 Correct 36 ms 5496 KB Output is correct
51 Correct 21 ms 5496 KB Output is correct
52 Correct 12 ms 5496 KB Output is correct
53 Correct 12 ms 5496 KB Output is correct
54 Correct 28 ms 5496 KB Output is correct
55 Correct 17 ms 5496 KB Output is correct
56 Correct 36 ms 5496 KB Output is correct
57 Correct 30 ms 5496 KB Output is correct
58 Correct 33 ms 5496 KB Output is correct
59 Correct 26 ms 5496 KB Output is correct
60 Correct 27 ms 5496 KB Output is correct
61 Correct 11 ms 5496 KB Output is correct
62 Correct 11 ms 5496 KB Output is correct
63 Correct 15 ms 5496 KB Output is correct
64 Correct 14 ms 5496 KB Output is correct
65 Correct 15 ms 5496 KB Output is correct
66 Correct 22 ms 5496 KB Output is correct
67 Correct 14 ms 5496 KB Output is correct
68 Correct 18 ms 5496 KB Output is correct
69 Correct 19 ms 5496 KB Output is correct
70 Correct 15 ms 5496 KB Output is correct
71 Correct 41 ms 5496 KB Output is correct
72 Correct 22 ms 5496 KB Output is correct
73 Correct 48 ms 5496 KB Output is correct
74 Correct 44 ms 5496 KB Output is correct
75 Correct 16 ms 5496 KB Output is correct
76 Correct 43 ms 5496 KB Output is correct
77 Correct 46 ms 5496 KB Output is correct
78 Correct 19 ms 5496 KB Output is correct
79 Correct 28 ms 5496 KB Output is correct
80 Correct 25 ms 5496 KB Output is correct
81 Correct 42 ms 5496 KB Output is correct
82 Correct 56 ms 5496 KB Output is correct
83 Correct 16 ms 5496 KB Output is correct
84 Correct 34 ms 5496 KB Output is correct
85 Correct 38 ms 5496 KB Output is correct
86 Correct 42 ms 5496 KB Output is correct
87 Correct 12 ms 5496 KB Output is correct
88 Correct 42 ms 5496 KB Output is correct
89 Correct 40 ms 5496 KB Output is correct
90 Correct 15 ms 5496 KB Output is correct
91 Correct 35 ms 5496 KB Output is correct
92 Correct 35 ms 5496 KB Output is correct
93 Correct 41 ms 5496 KB Output is correct
94 Correct 47 ms 5496 KB Output is correct
95 Correct 27 ms 5496 KB Output is correct
96 Correct 41 ms 5496 KB Output is correct
97 Correct 41 ms 5496 KB Output is correct