Submission #1191314

#	Time	Username	Problem	Language	Result	Execution time	Memory
1191314		MatteoArcari	통행료 (IOI18_highway)	C++20	6 / 100	32 ms	2180 KiB

highway

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll ask(const vector<int> &w);
void answer(int s, int t);

void find_pair(int n, vector<int> u, vector<int> v, int a, int b) {
    int m = u.size();
    vector<int> w(m, 0);
    ll dst = ask(w) / a;
    int s = 0;
    for (int k = 1 << 30; k; k >>= 1) {
        if (s + k >= n) continue;
        for (int i = 0; i < m; i++) {
            w[i] = i < (s + k) ? 1 : 0;
        }
        if (ask(w) == a * dst) s += k;
    }
    answer(s, s + dst);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 6 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31