Submission #764005

#	Time	Username	Problem	Language	Result	Execution time	Memory
764005		t6twotwo	통행료 (IOI18_highway)	C++17	6 / 100	81 ms	2072 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
    int M = U.size();
    bool subtask3 = M == N - 1;
    for (int i = 0; i < M; i++) {
        if (U[i] != i && V[i] != i + 1) {
            subtask3 = 0;
        }
    }
    if (subtask3) {
        ll s = ask(vector<int>(M));
        int lo = 0, hi = N - 1;
        while (lo < hi) {
            int mi = (lo + hi + 1) / 2;
            vector<int> w(M);
            fill(w.begin(), w.begin() + mi, 1);
            if (ask(w) != s) {
                hi = mi - 1;
            } else {
                lo = mi;
            }
        }
        answer(lo, lo + s / A);
    }
}

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