Submission #601726

#	Time	Username	Problem	Language	Result	Execution time	Memory
601726		jack715	통행료 (IOI18_highway)	C++14	6 / 100	90 ms	2124 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

int n, m, cost;

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  n = n, m = U.size();
  vector<int> q(m, 0);
  ll dist = ask(q);
  int l = 0, r = m;
  while (l < r) {
    int mid = (l + r) / 2;
    for (int i = 0; i <= mid; i++)
      q[i] = 1;
    if (ask(q) != dist)
      r = mid;
    else 
      l = mid+1;
    for (int i = 0; i <= mid; i++)
      q[i] = 0;
  }
  answer(l, l+dist/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