oj.uz

답안 #986138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986138 2024-05-19T20:26:49 Z AlphaMale06 커다란 상품 (IOI17_prize) C++14
100 / 100
 39 ms 11904 KB 
#include <bits/stdc++.h>

#include "prize.h"

using namespace std;
using ll = long long;

vector<int> ask(int i);

vector<int> a[200006];
int summ = 0;

int solve(int l, int r){
    if(l+1>=r)return 0;
    int cnt = a[l][1]-a[r][1];
    if(cnt==0)return 0;
    int s = l+r>>1;
    if(a[s][0]==-1)a[s]=ask(s);
    if(a[s][0]+a[s][1]==summ)return max(solve(l, s), solve(s, r));
    if(a[s][0]+a[s][1]==0)return s;
    int R = s-1, L = s+1;
    for(int i=s-1; i>=l; i--){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            R=i;
            break;
        }
    }
    for(int i=s+1; i<=r; i++){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            L=i;
            break;
        }
    }
    return max(solve(l, R), solve(L, r));
}

int find_best(int n){
	if(n<=5000){
        for(int i=0; i<n; i++){
            vector<int> ans = ask(i);
            if(ans[0]==0 && ans[1]==0)return i;
        }
	}
	for(int i=0; i< n; i++){
        a[i].push_back(-1);
	}
	int L = -1, R = -1;
    vector<int> indices;
    for(int i=0; i<30; i++){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        summ=max(summ, a[i][0]+a[i][1]);
    }
    for(int i=n-1; i>=n-30; i--){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        summ=max(summ, a[i][0]+a[i][1]);
    }

    for(int i=30; i<n-473; i+=475){
        indices.push_back(i);
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        summ=max(summ, a[i][0]+a[i][1]);
    }
    indices.push_back(n-30);
    for(int i=0; i<indices.size()-1; i++){
        int x = indices[i];
        while(a[x][0]+a[x][1]!=summ){
            x++;
            a[x]=ask(x);
            if(a[x][0]+a[x][1]==0)return x;
        }
        indices[i]=x;
    }
    int ans = 0;
    for(int i=0; i<indices.size()-1; i++){
        ans=max(ans, solve(indices[i], indices[i+1]));
    }
    return ans;
}

Compilation message

prize.cpp: In function 'int solve(int, int)':
prize.cpp:17:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |     int s = l+r>>1;
      |             ~^~
prize.cpp: In function 'int find_best(int)':
prize.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for(int i=0; i<indices.size()-1; i++){
      |                  ~^~~~~~~~~~~~~~~~~
prize.cpp:81:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=0; i<indices.size()-1; i++){
      |                  ~^~~~~~~~~~~~~~~~~
prize.cpp:51:6: warning: unused variable 'L' [-Wunused-variable]
   51 |  int L = -1, R = -1;
      |      ^
prize.cpp:51:14: warning: unused variable 'R' [-Wunused-variable]
   51 |  int L = -1, R = -1;
      |              ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11612 KB Output is correct
2 Correct 15 ms 11660 KB Output is correct
3 Correct 10 ms 11396 KB Output is correct
4 Correct 8 ms 11352 KB Output is correct
5 Correct 10 ms 11400 KB Output is correct
6 Correct 8 ms 11352 KB Output is correct
7 Correct 10 ms 11400 KB Output is correct
8 Correct 11 ms 11404 KB Output is correct
9 Correct 10 ms 11396 KB Output is correct
10 Correct 11 ms 11404 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 11396 KB Output is correct
2 Correct 10 ms 11396 KB Output is correct
3 Correct 12 ms 11400 KB Output is correct
4 Correct 9 ms 11352 KB Output is correct
5 Correct 10 ms 11396 KB Output is correct
6 Correct 8 ms 11352 KB Output is correct
7 Correct 12 ms 11400 KB Output is correct
8 Correct 14 ms 11400 KB Output is correct
9 Correct 12 ms 11648 KB Output is correct
10 Correct 11 ms 11396 KB Output is correct
11 Correct 12 ms 11400 KB Output is correct
12 Correct 11 ms 11404 KB Output is correct
13 Correct 11 ms 11396 KB Output is correct
14 Correct 8 ms 5972 KB Output is correct
15 Correct 26 ms 11404 KB Output is correct
16 Correct 35 ms 11652 KB Output is correct
17 Correct 27 ms 11396 KB Output is correct
18 Correct 32 ms 11396 KB Output is correct
19 Correct 30 ms 11396 KB Output is correct
20 Correct 23 ms 8268 KB Output is correct
21 Correct 33 ms 11400 KB Output is correct
22 Correct 31 ms 11392 KB Output is correct
23 Correct 11 ms 11396 KB Output is correct
24 Correct 12 ms 11612 KB Output is correct
25 Correct 36 ms 11604 KB Output is correct
26 Correct 29 ms 11404 KB Output is correct
27 Correct 10 ms 11400 KB Output is correct
28 Correct 26 ms 11644 KB Output is correct
29 Correct 28 ms 11404 KB Output is correct
30 Correct 36 ms 11400 KB Output is correct
31 Correct 28 ms 11400 KB Output is correct
32 Correct 13 ms 11652 KB Output is correct
33 Correct 1 ms 4952 KB Output is correct
34 Correct 34 ms 11400 KB Output is correct
35 Correct 13 ms 11652 KB Output is correct
36 Correct 33 ms 11652 KB Output is correct
37 Correct 13 ms 11396 KB Output is correct
38 Correct 17 ms 11396 KB Output is correct
39 Correct 34 ms 11404 KB Output is correct
40 Correct 28 ms 11396 KB Output is correct
41 Correct 35 ms 11400 KB Output is correct
42 Correct 32 ms 11396 KB Output is correct
43 Correct 36 ms 11612 KB Output is correct
44 Correct 34 ms 11396 KB Output is correct
45 Correct 30 ms 11400 KB Output is correct
46 Correct 36 ms 11404 KB Output is correct
47 Correct 27 ms 11400 KB Output is correct
48 Correct 32 ms 11656 KB Output is correct
49 Correct 33 ms 11400 KB Output is correct
50 Correct 30 ms 11400 KB Output is correct
51 Correct 39 ms 11644 KB Output is correct
52 Correct 28 ms 11396 KB Output is correct
53 Correct 13 ms 11404 KB Output is correct
54 Correct 34 ms 11652 KB Output is correct
55 Correct 29 ms 11400 KB Output is correct
56 Correct 31 ms 11648 KB Output is correct
57 Correct 34 ms 11396 KB Output is correct
58 Correct 36 ms 11400 KB Output is correct
59 Correct 32 ms 11400 KB Output is correct
60 Correct 33 ms 11656 KB Output is correct
61 Correct 10 ms 11396 KB Output is correct
62 Correct 11 ms 11404 KB Output is correct
63 Correct 11 ms 11404 KB Output is correct
64 Correct 12 ms 11396 KB Output is correct
65 Correct 9 ms 11352 KB Output is correct
66 Correct 12 ms 11352 KB Output is correct
67 Correct 11 ms 11396 KB Output is correct
68 Correct 12 ms 11396 KB Output is correct
69 Correct 8 ms 11352 KB Output is correct
70 Correct 10 ms 11404 KB Output is correct
71 Correct 32 ms 11400 KB Output is correct
72 Correct 12 ms 11404 KB Output is correct
73 Correct 28 ms 11400 KB Output is correct
74 Correct 37 ms 11404 KB Output is correct
75 Correct 11 ms 11400 KB Output is correct
76 Correct 29 ms 11404 KB Output is correct
77 Correct 30 ms 11396 KB Output is correct
78 Correct 11 ms 11392 KB Output is correct
79 Correct 23 ms 11904 KB Output is correct
80 Correct 33 ms 11652 KB Output is correct
81 Correct 31 ms 11396 KB Output is correct
82 Correct 32 ms 11652 KB Output is correct
83 Correct 12 ms 11400 KB Output is correct
84 Correct 31 ms 11652 KB Output is correct
85 Correct 34 ms 11644 KB Output is correct
86 Correct 23 ms 11648 KB Output is correct
87 Correct 11 ms 11652 KB Output is correct
88 Correct 20 ms 11392 KB Output is correct
89 Correct 22 ms 11608 KB Output is correct
90 Correct 11 ms 11404 KB Output is correct
91 Correct 19 ms 11864 KB Output is correct
92 Correct 27 ms 11900 KB Output is correct
93 Correct 32 ms 11396 KB Output is correct
94 Correct 34 ms 11652 KB Output is correct
95 Correct 26 ms 11400 KB Output is correct
96 Correct 26 ms 11400 KB Output is correct
97 Correct 26 ms 11400 KB Output is correct