답안 #1053375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053375	2024-08-11T11:06:56 Z	Unforgettablepl	커다란 상품 (IOI17_prize)	C++17	20 / 100	40 ms	428 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

const int THRESHOLD_JUMP = 480;
const int BIGGER_JUMP = 256;

int find_best(int n){
    for(int i=0;i<n;i++) {
        auto base = ask(i);
        int curr = base[0]+base[1];
        if(curr==0)return i;
        for(int jump=512;jump;jump/=2) {
            if(i+jump>=n)continue;
            auto temp = ask(i+jump);
            if(temp==base)i+=jump;
        }
    }
}

Compilation message

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

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	3 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	8 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	6 ms	344 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	9 ms	344 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Correct	5 ms	428 KB	Output is correct
16	Partially correct	35 ms	344 KB	Partially correct - number of queries: 8592
17	Correct	0 ms	344 KB	Output is correct
18	Incorrect	40 ms	428 KB	Incorrect
19	Halted	0 ms	0 KB	-