Submission #1196586

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196586		simplemind_31	Highway Tolls (IOI18_highway)	C++20	0 / 100	5 ms	1552 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<pair<ll,ll>>> graph;
vector<ll> dist;
vector<pair<ll,ll>> padre;
void dfs(ll now,ll ante){
  for(auto u:graph[now]){
    if(u.first==ante){
      continue;
    }
    padre[u.first].first=now;
    padre[u.first].second=u.second;
    dist[u.first]=dist[now]+1;
  }
}
void find_pair(int N,vector<int> U,vector<int> V, int A, int B){
  graph.clear();
  graph.resize(N);
  dist.assign(N,0);
  padre.assign(N,{0,0});
  ll M=U.size();
  for(ll i=0;i<M;i++){
    graph[U[i]].push_back({V[i],i});
    graph[V[i]].push_back({U[i],i});
  }
  dfs(0,-1);
  vector<int> aske(M,0);
  ll res=ask(aske);
  ll nue=0;
  for(ll i=1;i<N;i++){
    if(dist[i]*A==res){
      aske[padre[i].second]=1;
      nue=ask(aske);
      if(nue!=res){
        answer(0,i);
        break;
      }
    }
  }
}

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