제출 #601529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601529		jack715	통행료 (IOI18_highway)	C++14	5 / 100	110 ms	15256 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;

vector<vector<pair<int, int> > > adj;
int n, m, cost;

int find(int indx, int par = -1) {
  for (pair<int, int> next : adj[indx]) {
    if (next.ff == par) continue;
    vector<int> q(m, 0);
    q[next.ss] = 1;
    if (ask(q) != cost) return find(next.ff, indx);
  }
  return indx;
}

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  n = n, m = U.size();
  adj.resize(N);
  for (int i = 0; i < m; i++) {
    adj[U[i]].pb({V[i], i});
    adj[V[i]].pb({U[i], i});
  }
  vector<int> q(m, 0);
  cost = ask(q);

  answer(0, find(0));
}

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