oj.uz

답안 #428415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428415 2021-06-15T11:33:51 Z Popax21 Finding Routers (IOI20_routers) C++14
100 / 100
 3 ms 972 KB 
#include <stdio.h>
#include <assert.h>
#include <map>
#include "routers.h"

std::vector<int> cache;
std::multimap<int, int> qs;

int query(int p) {
    if(cache[p] >= 0) return cache[p];
    int r = use_detector(p);
    cache[p] = r;
    qs.emplace(r, p);
    return r;
}

int bsearch(int l, int r, int n) {
    assert(l < r);

    if(l == r-1) return l;
    int m = l + (r - l) / 2;

    int mr = query(m);

    if(mr != n) return bsearch(l, m, n);
    else return bsearch(m, r, n);
}

std::vector<int> find_routers(int l, int n, int q) {
    cache.resize(l+1);
    std::fill(cache.begin(), cache.end(), -1);

    std::vector<int> rs(n);
    rs[0] = 0;

    int pr = 0;
    for(int c = 1; c < n; c++) {
        int lp = rs[pr]+1, rp = l+1;

        auto li = qs.lower_bound(pr), ri = qs.upper_bound(pr);
        if(li != qs.end() && lp < li->second) lp = li->second;
        if(ri != qs.end() && ri->second < rp) rp = ri->second;
        // printf("pr %d l %d r %d %d %d\n", pr, lp, rp, ri->first, ri->second);

        int p = bsearch(lp, rp, pr)+1;
        int r = query(p);

        rs[r] = 2*p - rs[pr];
        if(r > pr) rs[r] -= 2;

        // printf("pr %d r %d p %d pp %d p' %d\n", pr, r, p, rs[pr], rs[r]);
        pr = r;
    }

    return rs;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 716 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 1 ms 716 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 3 ms 972 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 3 ms 972 KB Output is correct
6 Correct 3 ms 972 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 2 ms 972 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 972 KB Output is correct
18 Correct 3 ms 972 KB Output is correct
19 Correct 3 ms 972 KB Output is correct
20 Correct 2 ms 972 KB Output is correct
21 Correct 3 ms 972 KB Output is correct