제출 #139389

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

highway

#include "highway.h"
#include <bits/stdc++.h>

#define debug //
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair

const int MAXN = 9e4+ 10 ;
const int MAXM = 13e4+10 ;

using namespace std ;

struct Edge
{

	int j , id ;

	Edge(int j = 0 , int id = 0) 
		: j(j) , id(id) {}

} ;

int n , m , S = 0 , T ;

ll dist , tot ;

int v[MAXM] , u[MAXM] ;

vector<int> toAsk ;

vector<Edge> adj[MAXN] ;

pii edge[MAXM] ;

bool marc[MAXM] ;

// --------------------------------

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  
  m = U.size();
  n = N ;
  lp(i,0,m) u[i] = U[i] , v[i] = V[i] ;

  lp(i,0,m)
  {

  		
  	int a = u[i] , b = v[i] ;

  	adj[a].pb(Edge(b,i)) ;
  	adj[b].pb(Edge(a,i)) ;

  	toAsk.pb(0) ;

  	edge[i] = mk(a,b) ;

  }

  tot = ask(toAsk) ;

  int cur = 0 ;
  
  while(true)
  {


  	int l = 0 , r = adj[cur].size() - 1 , best = -1 ;

  	while( l <= r )
  	{
  		int mid = (l+r)/2 ;

  		lp(i,0,m) toAsk[i] = 0 ;

  		lp(i , l , mid+1 ) 
  			if(!marc[ adj[cur][i].id ])
  			{
  				toAsk[ adj[cur][i].id ] = 1 ;
  				marc[ adj[cur][i].id ] = true ;
  			}

  		ll newTot = ask(toAsk) ;

  		if( A < B ? newTot > tot : newTot < tot ) { best = mid ; r = mid-1 ; }
  		else l = mid+1 ;

  	}


  	if(best == -1) { T = cur ; break ; }

  	cur = adj[cur][best].j ;

  }


  answer(S,T) ;

}

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