oj.uz

답안 #95258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
95258 2019-01-29T07:00:17 Z andy627 커다란 상품 (IOI17_prize) C++17
100 / 100
 49 ms 1336 KB 
#include "prize.h"
#include<algorithm>
struct A
{
    int left,right,sum,num;
    bool stop;
}data[200005];
int check[200005];
bool comp(struct A a,struct A b)
{
    if(a.sum<b.sum) return true;
    if(a.sum==b.sum && a.num<b.num) return true;
    return false;
}
bool srt(struct A a,struct A b)
{
    return a.num<b.num;
}
int find_best(int n) {
    int cnt=1,i;
    std::vector<int> a=ask(0);
    data[0].left=a[0];
    data[0].right=a[1];
    data[0].sum=a[0]+a[1];
    check[0]=1;
    if(data[0].sum==0) return 0;
    while(cnt<=n)
    {
        int mid,until=cnt;
        for(i=0;i<until-1;i++)
        {
            mid=(data[i].num+data[i+1].num)/2;
            if(data[i].stop==false && check[mid]==0)
            {
                a=ask(mid);
                data[cnt].left=a[0];
                data[cnt].right=a[1];
                data[cnt].num=mid;
                data[cnt].sum=a[0]+a[1];
                check[mid]=1;
                cnt++;
            }
        }
        mid=(data[i].num+n)/2;
        if(data[i].stop==false && check[mid]==0)
        {
            a=ask(mid);
            data[cnt].left=a[0];
            data[cnt].right=a[1];
            data[cnt].num=mid;
            data[cnt].sum=a[0]+a[1];
            cnt++;
        }
        std::sort(data,data+cnt,comp);
        if(data[0].sum==0) return data[0].num;
        int right_zero=n,left_zero=-1;
        for(i=0;i<cnt-1;i++)
        {
            if(data[i].sum==data[i+1].sum && data[i].right-data[i+1].right==0) data[i].stop=true;
            if(data[i].right==0 && right_zero>data[i].num) right_zero=data[i].num;
            if(data[i].left==0 && left_zero<data[i].num) left_zero=data[i].num;
        }
        if(data[i].right==0 && right_zero>data[i].num) right_zero=data[i].num;
        if(data[i].left==0 && left_zero<data[i].num) left_zero=data[i].num;
        std::sort(data,data+cnt,srt);
        for(i=0;i<cnt;i++)
        {
            if(data[i].num<left_zero) data[i].stop=true;
            if(data[i].num>=right_zero) data[i].stop=true;
        }
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:72:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 316 KB Output is correct
10 Correct 2 ms 248 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 320 KB Output is correct
11 Correct 6 ms 704 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 4 ms 828 KB Output is correct
14 Correct 9 ms 380 KB Output is correct
15 Correct 13 ms 1016 KB Output is correct
16 Correct 34 ms 1272 KB Output is correct
17 Correct 37 ms 1144 KB Output is correct
18 Correct 17 ms 1272 KB Output is correct
19 Correct 22 ms 1144 KB Output is correct
20 Correct 12 ms 940 KB Output is correct
21 Correct 19 ms 1232 KB Output is correct
22 Correct 21 ms 1080 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 4 ms 736 KB Output is correct
25 Correct 14 ms 1216 KB Output is correct
26 Correct 27 ms 1180 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 16 ms 1228 KB Output is correct
29 Correct 31 ms 1144 KB Output is correct
30 Correct 30 ms 1084 KB Output is correct
31 Correct 20 ms 1296 KB Output is correct
32 Correct 6 ms 760 KB Output is correct
33 Correct 2 ms 248 KB Output is correct
34 Correct 22 ms 1196 KB Output is correct
35 Correct 4 ms 504 KB Output is correct
36 Correct 36 ms 1144 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 2 ms 508 KB Output is correct
39 Correct 35 ms 1272 KB Output is correct
40 Correct 19 ms 1232 KB Output is correct
41 Correct 23 ms 1336 KB Output is correct
42 Correct 30 ms 1144 KB Output is correct
43 Correct 25 ms 1176 KB Output is correct
44 Correct 12 ms 1148 KB Output is correct
45 Correct 17 ms 1164 KB Output is correct
46 Correct 20 ms 1200 KB Output is correct
47 Correct 43 ms 1144 KB Output is correct
48 Correct 23 ms 1152 KB Output is correct
49 Correct 39 ms 1312 KB Output is correct
50 Correct 30 ms 1328 KB Output is correct
51 Correct 21 ms 1176 KB Output is correct
52 Correct 41 ms 1272 KB Output is correct
53 Correct 1 ms 632 KB Output is correct
54 Correct 36 ms 1144 KB Output is correct
55 Correct 22 ms 1252 KB Output is correct
56 Correct 49 ms 1264 KB Output is correct
57 Correct 31 ms 1144 KB Output is correct
58 Correct 28 ms 1200 KB Output is correct
59 Correct 33 ms 1176 KB Output is correct
60 Correct 33 ms 1144 KB Output is correct
61 Correct 2 ms 508 KB Output is correct
62 Correct 3 ms 444 KB Output is correct
63 Correct 2 ms 548 KB Output is correct
64 Correct 3 ms 376 KB Output is correct
65 Correct 2 ms 380 KB Output is correct
66 Correct 2 ms 512 KB Output is correct
67 Correct 2 ms 328 KB Output is correct
68 Correct 2 ms 376 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 248 KB Output is correct
71 Correct 42 ms 1192 KB Output is correct
72 Correct 7 ms 760 KB Output is correct
73 Correct 40 ms 1144 KB Output is correct
74 Correct 40 ms 1196 KB Output is correct
75 Correct 3 ms 420 KB Output is correct
76 Correct 20 ms 1272 KB Output is correct
77 Correct 40 ms 1184 KB Output is correct
78 Correct 4 ms 768 KB Output is correct
79 Correct 13 ms 1152 KB Output is correct
80 Correct 41 ms 1188 KB Output is correct
81 Correct 47 ms 1144 KB Output is correct
82 Correct 38 ms 1144 KB Output is correct
83 Correct 3 ms 512 KB Output is correct
84 Correct 22 ms 1240 KB Output is correct
85 Correct 23 ms 1152 KB Output is correct
86 Correct 3 ms 816 KB Output is correct
87 Correct 3 ms 376 KB Output is correct
88 Correct 4 ms 632 KB Output is correct
89 Correct 5 ms 632 KB Output is correct
90 Correct 3 ms 320 KB Output is correct
91 Correct 3 ms 536 KB Output is correct
92 Correct 2 ms 248 KB Output is correct
93 Correct 5 ms 632 KB Output is correct
94 Correct 5 ms 636 KB Output is correct
95 Correct 5 ms 636 KB Output is correct
96 Correct 3 ms 504 KB Output is correct
97 Correct 2 ms 248 KB Output is correct