답안 #116957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116957 2019-06-14T08:55:59 Z pzdba 통행료 (IOI18_highway) C++14
컴파일 오류
0 ms 0 KB
#include <bits/stdc++.h>
#include "highway.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
vector<pii> g[90005];
int depth[90005], par[90005];
vector<int> ud[90005];

void find_pair(int n, std::vector<int> u, std::vector<int> v, int a, int b){
    int m = u.size();
    for(int i=0;i<m;i++){
        int a = u[i], b = v[i];
        g[a].push_back(pii(b, i));
        g[b].push_back(pii(a, i));
    }
    dfs(0, -1, 0, 0);
    vector<int> w;
    w.resize(m);
    LL base = ask(w);
    int lo = 1, hi = n, dd = 0, s = 0, t = 0;
    while(lo <= hi){
        int mid = (lo+hi)/2;
        for(int i=0;i<m;i++) w[i] = 0;
        for(int j=mid;j<=n;j++){
            for(int k=0;k<ud[j].size();j++){
                int u = ud[j][k];
                w[par[u]] = 1;
            }
        }
        LL tmp = ask(w);
        if(tmp > base) lo = mid+1, dd = mid;
        else hi = mid-1;
    }
    lo = 0, hi = ud[dd].size()-1;
    while(lo <= hi){
        int mid = (lo+hi)/2;
        for(int i=0;i<m;i++) w[i] = 0;
        for(int j=0;j<=mid;j++){
            int u = ud[dd][j];
            w[par[u]] = 1;
        }
        LL tmp = ask(w);
        if(tmp > base) hi = mid-1, s = ud[dd][mid];
        else lo = mid+1;
    }
    for(int i=0;i<=n;i++) ud[i].clear();
    dfs(s, -1, 0, 0);
    lo = 1, hi = n;
    while(lo <= hi){
        int mid = (lo+hi)/2;
        for(int i=0;i<m;i++) w[i] = 0;
        for(int j=mid;j<=n;j++){
            for(int k=0;k<ud[j].size();j++){
                int u = ud[j][k];
                w[par[u]] = 1;
            }
        }
        LL tmp = ask(w);
        if(tmp > base) lo = mid+1, dd = mid;
        else hi = mid-1;
    }
    lo = 0, hi = ud[dd].size()-1;
    while(lo <= hi){
        int mid = (lo+hi)/2;
        for(int i=0;i<m;i++) w[i] = 0;
        for(int j=0;j<=mid;j++){
            int u = ud[dd][j];
            w[par[u]] = 1;
        }
        LL tmp = ask(w);
        if(tmp > base) hi = mid-1, t = ud[dd][mid];
        else lo = mid+1;
    }
    answer(s, t);
}

Compilation message

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:17:5: error: 'dfs' was not declared in this scope
     dfs(0, -1, 0, 0);
     ^~~
highway.cpp:17:5: note: suggested alternative: 'ffs'
     dfs(0, -1, 0, 0);
     ^~~
     ffs
highway.cpp:26:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<ud[j].size();j++){
                         ~^~~~~~~~~~~~~
highway.cpp:54:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<ud[j].size();j++){
                         ~^~~~~~~~~~~~~