# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1060899 | 2024-08-16T04:14:23 Z | onbert | 커다란 상품 (IOI17_prize) | C++17 | 63 ms | 11356 KB |
#include "prize.h" #include <bits/stdc++.h> using namespace std; const int maxn = 2e5; vector<int> vals[maxn]; vector<int> qry(int i) { if (vals[i][0]!=-1) return vals[i]; else return vals[i] = ask(i); } int find_best(int n) { for (int i=0;i<n;i++) vals[i] = {-1, -1}; for (int i=0;i<n;i++) { vector<int> x = qry(i); if (x[0] + x[1] == 0) return i; int l = i, r = n-1; while (l<r) { int mid = (l+r+1)/2; vector<int> y = qry(mid); if (y[0]+y[1]==0) return mid; if (y[0]!=x[0] || y[1]!=x[1]) r = mid-1; else l = mid; } i = l; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 11352 KB | Output is correct |
2 | Correct | 7 ms | 11352 KB | Output is correct |
3 | Correct | 7 ms | 11352 KB | Output is correct |
4 | Correct | 9 ms | 11352 KB | Output is correct |
5 | Correct | 7 ms | 11352 KB | Output is correct |
6 | Correct | 7 ms | 11352 KB | Output is correct |
7 | Correct | 7 ms | 11272 KB | Output is correct |
8 | Correct | 9 ms | 11352 KB | Output is correct |
9 | Correct | 7 ms | 11172 KB | Output is correct |
10 | Correct | 7 ms | 11352 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 11352 KB | Output is correct |
2 | Correct | 9 ms | 11352 KB | Output is correct |
3 | Correct | 10 ms | 11352 KB | Output is correct |
4 | Correct | 7 ms | 11352 KB | Output is correct |
5 | Correct | 7 ms | 11352 KB | Output is correct |
6 | Correct | 7 ms | 11216 KB | Output is correct |
7 | Correct | 7 ms | 11352 KB | Output is correct |
8 | Correct | 7 ms | 11352 KB | Output is correct |
9 | Correct | 7 ms | 11268 KB | Output is correct |
10 | Correct | 7 ms | 11352 KB | Output is correct |
11 | Correct | 10 ms | 11352 KB | Output is correct |
12 | Correct | 7 ms | 11352 KB | Output is correct |
13 | Correct | 11 ms | 11356 KB | Output is correct |
14 | Correct | 4 ms | 5720 KB | Output is correct |
15 | Correct | 18 ms | 11352 KB | Output is correct |
16 | Incorrect | 63 ms | 11352 KB | Incorrect |
17 | Halted | 0 ms | 0 KB | - |