oj.uz

Submission #882322

# Submission time Handle Problem Language Result Execution time Memory
882322 2023-12-03T04:25:10 Z pirhosig Finding Routers (IOI20_routers) C++17
39 / 100
 1 ms 348 KB 
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;



int solve(int low, int upp, int val) {
    while (low < upp) {
        int mid = (low + upp + 1) / 2;
        int qres = use_detector(mid);
        // cerr << mid << endl;
        if (qres >= val) upp = mid - 1;
        else low = mid;
    }
    return low;
}



vector<int> find_routers(int l, int n, int q) {
    vector<int> ans;
    ans.push_back(0);
    if (n == 2) {
        int res = solve(1, l - 1, 1);
        ans.push_back(res * 2);
        return ans;
    }
    vector<pair<int, int>> close;
    close.push_back({0, 0});
    constexpr int jump = 5000;
    for (int i = jump; i < l; i += jump) close.push_back({use_detector(i), i});
    close.push_back({use_detector(l), l});
    for (int i = 1; i < n; ++i) {
        auto low = prev(lower_bound(close.begin(), close.end(), make_pair(i, 0)));
        auto upp = upper_bound(close.begin(), close.end(), make_pair(i, 0));
        if (upp == close.end()) upp = prev(upp);
        int res = solve(low->first, upp->first, i);
        ans.push_back(2 * res - ans.back());
    }
    return ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect location of routers
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #4
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Incorrect location of routers
2 Halted 0 ms 0 KB -