oj.uz

답안 #986131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986131 2024-05-19T19:34:38 Z AlphaMale06 커다란 상품 (IOI17_prize) C++14
97.39 / 100
 48 ms 11608 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;
    for(int i=0; i<250; i++){
        a[i] = ask(i);
        summ=max(summ, a[i][0]+a[i][1]);
        if(a[i][0]+a[i][1]==0)return i;
    }
    for(int i=n-1; i>=n-250; i--){
        a[i]=ask(i);
        summ=max(summ, a[i][0]+a[i][1]);
        if(a[i][0]+a[i][1]==0)return i;
    }
    for(int i=250; i<n; i++){
        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;
        }
    }
    for(int i=n-251; i>=0; i--){
        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;
        }
    }
    return solve(L, R);
}

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;
      |             ~^~

Subtask #1
20.0 / 20.0

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

Subtask #2
77.39 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11352 KB Output is correct
2 Correct 11 ms 11352 KB Output is correct
3 Correct 12 ms 11352 KB Output is correct
4 Correct 10 ms 11352 KB Output is correct
5 Correct 11 ms 11352 KB Output is correct
6 Correct 9 ms 11352 KB Output is correct
7 Correct 10 ms 11352 KB Output is correct
8 Correct 10 ms 11352 KB Output is correct
9 Correct 11 ms 11348 KB Output is correct
10 Correct 11 ms 11352 KB Output is correct
11 Correct 12 ms 11352 KB Output is correct
12 Correct 13 ms 11352 KB Output is correct
13 Correct 14 ms 11352 KB Output is correct
14 Correct 8 ms 5720 KB Output is correct
15 Correct 35 ms 11352 KB Output is correct
16 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5123
17 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5111
18 Partially correct 37 ms 11352 KB Partially correct - number of queries: 5115
19 Correct 32 ms 11352 KB Output is correct
20 Correct 23 ms 8024 KB Output is correct
21 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5059
22 Correct 28 ms 11352 KB Output is correct
23 Correct 11 ms 11352 KB Output is correct
24 Correct 12 ms 11352 KB Output is correct
25 Correct 38 ms 11352 KB Output is correct
26 Correct 30 ms 11352 KB Output is correct
27 Correct 11 ms 11352 KB Output is correct
28 Correct 26 ms 11352 KB Output is correct
29 Correct 36 ms 11352 KB Output is correct
30 Partially correct 35 ms 11308 KB Partially correct - number of queries: 5094
31 Partially correct 36 ms 11608 KB Partially correct - number of queries: 5080
32 Correct 12 ms 11352 KB Output is correct
33 Correct 1 ms 4952 KB Output is correct
34 Partially correct 27 ms 11352 KB Partially correct - number of queries: 5135
35 Correct 12 ms 11352 KB Output is correct
36 Partially correct 26 ms 11352 KB Partially correct - number of queries: 5071
37 Correct 13 ms 11352 KB Output is correct
38 Correct 11 ms 11352 KB Output is correct
39 Partially correct 29 ms 11348 KB Partially correct - number of queries: 5100
40 Correct 41 ms 11352 KB Output is correct
41 Partially correct 29 ms 11352 KB Partially correct - number of queries: 5100
42 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5100
43 Correct 32 ms 11352 KB Output is correct
44 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5125
45 Correct 33 ms 11352 KB Output is correct
46 Partially correct 30 ms 11180 KB Partially correct - number of queries: 5087
47 Correct 35 ms 11352 KB Output is correct
48 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5135
49 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5096
50 Partially correct 37 ms 11352 KB Partially correct - number of queries: 5114
51 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5127
52 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5129
53 Correct 12 ms 11352 KB Output is correct
54 Partially correct 28 ms 11352 KB Partially correct - number of queries: 5108
55 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5126
56 Partially correct 40 ms 11548 KB Partially correct - number of queries: 5093
57 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5102
58 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5088
59 Partially correct 48 ms 11348 KB Partially correct - number of queries: 5094
60 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5064
61 Correct 12 ms 11352 KB Output is correct
62 Correct 11 ms 11352 KB Output is correct
63 Correct 11 ms 11352 KB Output is correct
64 Correct 11 ms 11352 KB Output is correct
65 Correct 9 ms 11352 KB Output is correct
66 Correct 10 ms 11352 KB Output is correct
67 Correct 12 ms 11352 KB Output is correct
68 Correct 12 ms 11352 KB Output is correct
69 Correct 10 ms 11352 KB Output is correct
70 Correct 11 ms 11352 KB Output is correct
71 Partially correct 40 ms 11352 KB Partially correct - number of queries: 5261
72 Correct 14 ms 11352 KB Output is correct
73 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5198
74 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5225
75 Correct 11 ms 11352 KB Output is correct
76 Correct 28 ms 11352 KB Output is correct
77 Partially correct 36 ms 11352 KB Partially correct - number of queries: 5245
78 Correct 12 ms 11352 KB Output is correct
79 Correct 21 ms 11352 KB Output is correct
80 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5207
81 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5198
82 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5192
83 Correct 11 ms 11352 KB Output is correct
84 Correct 34 ms 11352 KB Output is correct
85 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5181
86 Correct 12 ms 11352 KB Output is correct
87 Correct 12 ms 11352 KB Output is correct
88 Correct 11 ms 11352 KB Output is correct
89 Correct 11 ms 11352 KB Output is correct
90 Correct 11 ms 11352 KB Output is correct
91 Correct 13 ms 11352 KB Output is correct
92 Correct 14 ms 11352 KB Output is correct
93 Correct 12 ms 11352 KB Output is correct
94 Correct 14 ms 11352 KB Output is correct
95 Correct 12 ms 11352 KB Output is correct
96 Correct 12 ms 11352 KB Output is correct
97 Correct 11 ms 11352 KB Output is correct