# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1053286 | 2024-08-11T10:16:31 Z | Unforgettablepl | 커다란 상품 (IOI17_prize) | C++17 | 38 ms | 428 KB |
#include "prize.h" #include <bits/stdc++.h> using namespace std; const int THRESHOLD = 50; const int BIGGER_JUMP = 131072; 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; if(curr>THRESHOLD) { for(int jump=BIGGER_JUMP;jump;jump/=2) { if(i+jump>=n)continue; auto temp = ask(i+jump); if(temp==base)i+=jump; } } else { for(int jump=256;jump;jump/=2) { if(i+jump>=n)continue; auto temp = ask(i+jump); if(temp==base)i+=jump; } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 8 ms | 344 KB | Output is correct |
3 | Correct | 5 ms | 344 KB | Output is correct |
4 | Correct | 22 ms | 344 KB | Output is correct |
5 | Correct | 6 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 7 ms | 344 KB | Output is correct |
8 | Correct | 7 ms | 344 KB | Output is correct |
9 | Correct | 11 ms | 344 KB | Output is correct |
10 | Correct | 30 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 9 ms | 344 KB | Output is correct |
3 | Correct | 5 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 | 0 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 | 16 ms | 344 KB | Output is correct |
10 | Correct | 14 ms | 344 KB | Output is correct |
11 | Correct | 11 ms | 344 KB | Output is correct |
12 | Correct | 1 ms | 344 KB | Output is correct |
13 | Correct | 18 ms | 344 KB | Output is correct |
14 | Correct | 3 ms | 344 KB | Output is correct |
15 | Correct | 7 ms | 428 KB | Output is correct |
16 | Incorrect | 38 ms | 344 KB | Incorrect |
17 | Halted | 0 ms | 0 KB | - |