oj.uz

답안 #619983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619983 2022-08-02T18:09:05 Z Ozy 커다란 상품 (IOI17_prize) C++17
100 / 100
 48 ms 2060 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define lli int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define ini first
#define fin second
#define MAX 200000

lli mitad,cont,g;
queue<pair<lli,lli> > cola;
pair<lli,lli> act;
map<lli,lli> existe,id;
set<lli> pos[10];
set<lli>::iterator l,r;

lli premios[MAX+2][2];
bool nosepuede;
vector<int> a;

int find_best(int n) {

    cont = 0;
    cola.push({0,n-1});
    premios[n][0] = n+1;

    while (!cola.empty()) {

        act = cola.front();
        cola.pop();

        if (act.ini > act.fin) continue;
        mitad = (act.ini + act.fin)/2;

        //si puede haber algo dentro de mi
        nosepuede=false;
        rep(i,0,cont-1) {
            l = pos[i].lower_bound(mitad);
            r = l;
            l--;

            if ((*l) == -1) {
                if (premios[*r][0] == 0) {nosepuede=true; break;}
            }
            else if (premios[*l][1] == premios[*r][1] || premios[*l][1] == premios[*r][1]) {nosepuede=true; break;}
        }
        if (nosepuede) continue;

        a = ask(mitad);
        g = a[0]+a[1];
        if (g == 0) return mitad;

        existe[g]++;
        if (existe[g] == 1) {
            id[g] = cont;
            pos[cont].insert(-1);
            pos[cont].insert(n);
            cont++;
        }
        pos[id[g]].insert(mitad);
        premios[mitad][0] = a[0];
        premios[mitad][1] = a[1];

        cola.push({act.ini,mitad-1});
        cola.push({mitad+1,act.fin});
    }

}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 4 ms 816 KB Output is correct
12 Correct 4 ms 808 KB Output is correct
13 Correct 3 ms 900 KB Output is correct
14 Correct 8 ms 488 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 31 ms 1964 KB Output is correct
17 Correct 24 ms 1960 KB Output is correct
18 Correct 14 ms 1968 KB Output is correct
19 Correct 19 ms 1916 KB Output is correct
20 Correct 13 ms 1240 KB Output is correct
21 Correct 12 ms 1952 KB Output is correct
22 Correct 23 ms 1824 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 3 ms 812 KB Output is correct
25 Correct 29 ms 1828 KB Output is correct
26 Correct 12 ms 1864 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 27 ms 1832 KB Output is correct
29 Correct 27 ms 1864 KB Output is correct
30 Correct 23 ms 1956 KB Output is correct
31 Correct 22 ms 1952 KB Output is correct
32 Correct 3 ms 840 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 27 ms 1864 KB Output is correct
35 Correct 2 ms 556 KB Output is correct
36 Correct 28 ms 1960 KB Output is correct
37 Correct 3 ms 796 KB Output is correct
38 Correct 2 ms 408 KB Output is correct
39 Correct 14 ms 1980 KB Output is correct
40 Correct 22 ms 1956 KB Output is correct
41 Correct 32 ms 1956 KB Output is correct
42 Correct 24 ms 1964 KB Output is correct
43 Correct 23 ms 1948 KB Output is correct
44 Correct 25 ms 1956 KB Output is correct
45 Correct 23 ms 1856 KB Output is correct
46 Correct 25 ms 1928 KB Output is correct
47 Correct 13 ms 1872 KB Output is correct
48 Correct 17 ms 1992 KB Output is correct
49 Correct 21 ms 1880 KB Output is correct
50 Correct 27 ms 1960 KB Output is correct
51 Correct 26 ms 1956 KB Output is correct
52 Correct 16 ms 2000 KB Output is correct
53 Correct 1 ms 428 KB Output is correct
54 Correct 32 ms 2028 KB Output is correct
55 Correct 23 ms 1908 KB Output is correct
56 Correct 22 ms 1904 KB Output is correct
57 Correct 24 ms 1704 KB Output is correct
58 Correct 26 ms 1932 KB Output is correct
59 Correct 33 ms 2000 KB Output is correct
60 Correct 29 ms 1984 KB Output is correct
61 Correct 1 ms 444 KB Output is correct
62 Correct 2 ms 428 KB Output is correct
63 Correct 1 ms 432 KB Output is correct
64 Correct 2 ms 456 KB Output is correct
65 Correct 1 ms 304 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 1 ms 304 KB Output is correct
69 Correct 1 ms 308 KB Output is correct
70 Correct 1 ms 312 KB Output is correct
71 Correct 28 ms 2060 KB Output is correct
72 Correct 4 ms 840 KB Output is correct
73 Correct 48 ms 1952 KB Output is correct
74 Correct 48 ms 2020 KB Output is correct
75 Correct 2 ms 464 KB Output is correct
76 Correct 32 ms 1956 KB Output is correct
77 Correct 22 ms 2044 KB Output is correct
78 Correct 4 ms 816 KB Output is correct
79 Correct 10 ms 1824 KB Output is correct
80 Correct 29 ms 1972 KB Output is correct
81 Correct 31 ms 1908 KB Output is correct
82 Correct 22 ms 1952 KB Output is correct
83 Correct 2 ms 464 KB Output is correct
84 Correct 30 ms 1908 KB Output is correct
85 Correct 34 ms 1916 KB Output is correct
86 Correct 2 ms 720 KB Output is correct
87 Correct 2 ms 464 KB Output is correct
88 Correct 2 ms 688 KB Output is correct
89 Correct 2 ms 720 KB Output is correct
90 Correct 1 ms 336 KB Output is correct
91 Correct 2 ms 592 KB Output is correct
92 Correct 1 ms 336 KB Output is correct
93 Correct 3 ms 668 KB Output is correct
94 Correct 3 ms 720 KB Output is correct
95 Correct 2 ms 720 KB Output is correct
96 Correct 2 ms 592 KB Output is correct
97 Correct 1 ms 336 KB Output is correct