제출 #143192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
143192		neki	통행료 (IOI18_highway)	C++14	0 / 100	26 ms	632 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
#define loop(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef long long ll;

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
  ll M=U.size(), st=0;
  vector<int> arr;arr.resize(M, 0);ll req=ask(arr);
  while(st<M){
  	ll l=st, r=M;
    while(l<r){
    	ll mid=(l+r)/2;
        loop(i, st, M) arr[i]=(i<=mid);
        if(ask(arr)==req) l=mid+1;
        else r=mid;
    }
    arr[l]=0;st=l+1;
  }
  vector<int> temp(N, 0), ans;
  loop(i, 0, M) if(!arr[i]) temp[U[i]]++,temp[V[i]]++;
  loop(i, 0, N) if(temp[i]==1) ans.push_back(i);
  answer(ans[0], ans[1]);
}

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