oj.uz

답안 #1053378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053378 2024-08-11T11:09:52 Z Unforgettablepl 커다란 상품 (IOI17_prize) C++17
20 / 100
 43 ms 428 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

const int THRESHOLD_JUMP = 480;
const int BIGGER_JUMP = 1024;

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=(curr<=THRESHOLD_JUMP ? 256 : BIGGER_JUMP);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 2 ms 344 KB Output is correct
2 Correct 10 ms 428 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 14 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 16 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 9 ms 428 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 12 ms 344 KB Output is correct
5 Correct 10 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 14 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 23 ms 428 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Partially correct 35 ms 344 KB Partially correct - number of queries: 7811
17 Correct 0 ms 344 KB Output is correct
18 Partially correct 37 ms 344 KB Partially correct - number of queries: 9431
19 Correct 0 ms 344 KB Output is correct
20 Correct 9 ms 424 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Partially correct 25 ms 424 KB Partially correct - number of queries: 6101
26 Partially correct 43 ms 344 KB Partially correct - number of queries: 5941
27 Correct 3 ms 344 KB Output is correct
28 Incorrect 41 ms 344 KB Incorrect
29 Halted 0 ms 0 KB -