oj.uz

답안 #986133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986133 2024-05-19T19:55:14 Z AlphaMale06 커다란 상품 (IOI17_prize) C++17
97.67 / 100
 44 ms 11604 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<236; 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-236; 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=236; 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-237; 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 10 ms 11352 KB Output is correct
2 Correct 10 ms 11352 KB Output is correct
3 Correct 11 ms 11352 KB Output is correct
4 Correct 9 ms 11352 KB Output is correct
5 Correct 11 ms 11352 KB Output is correct
6 Correct 9 ms 11604 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 11372 KB Output is correct
10 Correct 10 ms 11352 KB Output is correct

Subtask #2
77.67 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 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 9 ms 11352 KB Output is correct
5 Correct 12 ms 11352 KB Output is correct
6 Correct 9 ms 11352 KB Output is correct
7 Correct 12 ms 11352 KB Output is correct
8 Correct 10 ms 11352 KB Output is correct
9 Correct 10 ms 11352 KB Output is correct
10 Correct 11 ms 11352 KB Output is correct
11 Correct 12 ms 11352 KB Output is correct
12 Correct 12 ms 11352 KB Output is correct
13 Correct 14 ms 11348 KB Output is correct
14 Correct 11 ms 5720 KB Output is correct
15 Correct 29 ms 11352 KB Output is correct
16 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5115
17 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5061
18 Partially correct 31 ms 11348 KB Partially correct - number of queries: 5105
19 Correct 32 ms 11352 KB Output is correct
20 Correct 23 ms 8024 KB Output is correct
21 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5034
22 Correct 26 ms 11352 KB Output is correct
23 Correct 10 ms 11352 KB Output is correct
24 Correct 12 ms 11352 KB Output is correct
25 Correct 30 ms 11352 KB Output is correct
26 Correct 28 ms 11352 KB Output is correct
27 Correct 12 ms 11592 KB Output is correct
28 Correct 29 ms 11352 KB Output is correct
29 Correct 22 ms 11352 KB Output is correct
30 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5033
31 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5048
32 Correct 15 ms 11352 KB Output is correct
33 Correct 1 ms 4952 KB Output is correct
34 Partially correct 34 ms 11280 KB Partially correct - number of queries: 5105
35 Correct 12 ms 11352 KB Output is correct
36 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5056
37 Correct 14 ms 11352 KB Output is correct
38 Correct 11 ms 11352 KB Output is correct
39 Partially correct 27 ms 11352 KB Partially correct - number of queries: 5053
40 Correct 26 ms 11352 KB Output is correct
41 Partially correct 28 ms 11352 KB Partially correct - number of queries: 5074
42 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5074
43 Correct 32 ms 11352 KB Output is correct
44 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5097
45 Correct 29 ms 11352 KB Output is correct
46 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5060
47 Correct 30 ms 11352 KB Output is correct
48 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5111
49 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5067
50 Partially correct 37 ms 11352 KB Partially correct - number of queries: 5095
51 Partially correct 29 ms 11352 KB Partially correct - number of queries: 5086
52 Partially correct 41 ms 11352 KB Partially correct - number of queries: 5084
53 Correct 11 ms 11352 KB Output is correct
54 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5052
55 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5092
56 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5072
57 Partially correct 36 ms 11352 KB Partially correct - number of queries: 5028
58 Partially correct 37 ms 11352 KB Partially correct - number of queries: 5115
59 Partially correct 32 ms 11352 KB Partially correct - number of queries: 5068
60 Partially correct 40 ms 11352 KB Partially correct - number of queries: 5052
61 Correct 12 ms 11352 KB Output is correct
62 Correct 10 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 10 ms 11352 KB Output is correct
66 Correct 9 ms 11352 KB Output is correct
67 Correct 11 ms 11352 KB Output is correct
68 Correct 11 ms 11352 KB Output is correct
69 Correct 10 ms 11240 KB Output is correct
70 Correct 11 ms 11352 KB Output is correct
71 Partially correct 37 ms 11352 KB Partially correct - number of queries: 5233
72 Correct 13 ms 11352 KB Output is correct
73 Partially correct 39 ms 11352 KB Partially correct - number of queries: 5170
74 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5197
75 Correct 11 ms 11352 KB Output is correct
76 Correct 35 ms 11352 KB Output is correct
77 Partially correct 33 ms 11184 KB Partially correct - number of queries: 5203
78 Correct 12 ms 11352 KB Output is correct
79 Correct 19 ms 11352 KB Output is correct
80 Partially correct 38 ms 11604 KB Partially correct - number of queries: 5186
81 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5180
82 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5123
83 Correct 11 ms 11352 KB Output is correct
84 Correct 44 ms 11352 KB Output is correct
85 Partially correct 40 ms 11352 KB Partially correct - number of queries: 5168
86 Correct 12 ms 11352 KB Output is correct
87 Correct 11 ms 11352 KB Output is correct
88 Correct 11 ms 11352 KB Output is correct
89 Correct 10 ms 11352 KB Output is correct
90 Correct 11 ms 11352 KB Output is correct
91 Correct 12 ms 11352 KB Output is correct
92 Correct 10 ms 11604 KB Output is correct
93 Correct 12 ms 11352 KB Output is correct
94 Correct 12 ms 11352 KB Output is correct
95 Correct 12 ms 11352 KB Output is correct
96 Correct 17 ms 11352 KB Output is correct
97 Correct 10 ms 11352 KB Output is correct