oj.uz

답안 #526332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526332 2022-02-14T11:06:45 Z leaked 커다란 상품 (IOI17_prize) C++14
100 / 100
 54 ms 352 KB 
#include "prize.h"
#include <bits/stdc++.h>


#define f first
#define s second
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define m_p make_pair
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
//#define pragma optimize("unroll-loops")
using namespace std;
const int N=2e5+1;
typedef pair<int,int> pii;
template <class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template <class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
bool used[N];
map<int,int> lft,rgt;
int rec(int l,int r,map<int,int> cur){
    if(l>r) return -1;
    if(l==r){
        vec<int> me=ask(l);
        if(me[0]+me[1]==0)
            return l;
        lft[me[0]+me[1]]=me[1];
        for(auto &z : lft){
            if(z.f>me[0]+me[1])
                ++z.s;
        }
        return -1;
    }
    int tm=(l+r)>>1;
    vec<int> me=ask(tm);
    if(me[0]+me[1]==0)
        return tm;
    int hv=me[1]-(lft.count(me[0]+me[1])?lft[me[0]+me[1]]:0);
    if(hv){
        map<int,int> nw=cur;
        nw[me[0]+me[1]]=me[0];
        int j=rec(tm+1,r,nw);
        if(j!=-1)
            return j;
    }
    lft[me[0]+me[1]]=me[1];
    for(auto &z : lft){
        if(z.f>me[0]+me[1])
            ++z.s;
    }
    if(!cur.count(me[0]+me[1]) || cur[me[0]+me[1]]<me[0]){
        return rec(l,tm-1,cur);
    }
    return -1;
}
int find_best(int n) {
    map<int,int> mp;
    return rec(0,n-1,mp);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 272 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 3 ms 292 KB Output is correct
12 Correct 5 ms 292 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 7 ms 200 KB Output is correct
15 Correct 14 ms 336 KB Output is correct
16 Correct 11 ms 200 KB Output is correct
17 Correct 33 ms 280 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 32 ms 200 KB Output is correct
20 Correct 8 ms 300 KB Output is correct
21 Correct 33 ms 256 KB Output is correct
22 Correct 32 ms 284 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 5 ms 292 KB Output is correct
25 Correct 18 ms 200 KB Output is correct
26 Correct 23 ms 284 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 3 ms 200 KB Output is correct
30 Correct 1 ms 292 KB Output is correct
31 Correct 41 ms 200 KB Output is correct
32 Correct 2 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 26 ms 280 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 17 ms 200 KB Output is correct
37 Correct 3 ms 272 KB Output is correct
38 Correct 1 ms 200 KB Output is correct
39 Correct 21 ms 284 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 18 ms 200 KB Output is correct
42 Correct 18 ms 272 KB Output is correct
43 Correct 15 ms 284 KB Output is correct
44 Correct 26 ms 292 KB Output is correct
45 Correct 11 ms 288 KB Output is correct
46 Correct 40 ms 280 KB Output is correct
47 Correct 21 ms 284 KB Output is correct
48 Correct 5 ms 284 KB Output is correct
49 Correct 33 ms 284 KB Output is correct
50 Correct 1 ms 272 KB Output is correct
51 Correct 24 ms 268 KB Output is correct
52 Correct 44 ms 200 KB Output is correct
53 Correct 1 ms 200 KB Output is correct
54 Correct 33 ms 280 KB Output is correct
55 Correct 35 ms 284 KB Output is correct
56 Correct 1 ms 200 KB Output is correct
57 Correct 10 ms 200 KB Output is correct
58 Correct 14 ms 200 KB Output is correct
59 Correct 16 ms 284 KB Output is correct
60 Correct 15 ms 200 KB Output is correct
61 Correct 1 ms 288 KB Output is correct
62 Correct 3 ms 200 KB Output is correct
63 Correct 1 ms 200 KB Output is correct
64 Correct 1 ms 200 KB Output is correct
65 Correct 1 ms 288 KB Output is correct
66 Correct 1 ms 200 KB Output is correct
67 Correct 1 ms 200 KB Output is correct
68 Correct 1 ms 272 KB Output is correct
69 Correct 1 ms 276 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 45 ms 200 KB Output is correct
72 Correct 5 ms 200 KB Output is correct
73 Correct 30 ms 300 KB Output is correct
74 Correct 45 ms 200 KB Output is correct
75 Correct 2 ms 300 KB Output is correct
76 Correct 41 ms 200 KB Output is correct
77 Correct 54 ms 304 KB Output is correct
78 Correct 5 ms 200 KB Output is correct
79 Correct 22 ms 304 KB Output is correct
80 Correct 47 ms 200 KB Output is correct
81 Correct 52 ms 200 KB Output is correct
82 Correct 42 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 43 ms 200 KB Output is correct
85 Correct 33 ms 200 KB Output is correct
86 Correct 6 ms 200 KB Output is correct
87 Correct 2 ms 352 KB Output is correct
88 Correct 5 ms 292 KB Output is correct
89 Correct 4 ms 292 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 3 ms 200 KB Output is correct
92 Correct 1 ms 292 KB Output is correct
93 Correct 3 ms 200 KB Output is correct
94 Correct 4 ms 228 KB Output is correct
95 Correct 4 ms 200 KB Output is correct
96 Correct 3 ms 200 KB Output is correct
97 Correct 1 ms 200 KB Output is correct