제출 #130541

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
130541	2019-07-15 13:31:51	groeneprof	통행료 (IOI18_highway)	C++14	12 / 100	305 ms	262148 KiB

highway

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "highway.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct edge{
  int id, v;
};
int N, M, A, B;
vector<vector<edge> > graph;
void dfs(int u, int par, int id, int d, int dist, vector<int>& idlist, vector<int>& vlist){
  if(d == dist){
    idlist.push_back(id);
    vlist.push_back(u);
  }
  for(edge e : graph[u]) if(e.v!=par){
    dfs(e.v, u, e.id, d+1, dist, idlist, vlist);
  }
}
int findT(int S, int par, int dist, int id){
  vector<int> idlist, vlist;
  dfs(S, par, id, 0, dist, idlist, vlist);
  int L = 0, R = idlist.size();
  while(L!=R-1){
    int Mi = (L+R)/2;
    vector<signed> w(M, 0);
    for(int i = 0; i<Mi; i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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