oj.uz

답안 #118689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118689 2019-06-19T11:26:02 Z someone_aa 통행료 (IOI18_highway) C++17
11 / 100
 1500 ms 42652 KB 
#include "highway.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 100100;
int n, m;
vector<int>w;
vector<int>gs[maxn];
vector<pair<int,int> > g[maxn];

vector<int>gt[maxn];

int dist[maxn][2], parent[maxn][2];
bool visited[maxn];

ll dista;

map<pair<int,int>, int> ind;

void bfs(int st, int d) {
    for(int i=0;i<n;i++) {
        visited[i] = false;
    }
    queue<int>q;
    q.push(st);

    parent[st][d] = -1;
    visited[st] = true;

    while(!q.empty()) {
        int curr = q.front();
        q.pop();

        for(auto i:g[curr]) {
            if(!visited[i.first]) {
                visited[i.first] = true;
                dist[i.first][d] = dist[curr][d] + 1;
                parent[i.first][d] = i.second;
                q.push(i.first);
            }
        }
    }
}

set<pair<int,int> > sta, stb;

void preprocess() {
    for(int i=0;i<n;i++) {
        if(dist[i][0] == dist[i][1]) continue; // skip this node

        if(dist[i][0] < dist[i][1]) {
            for(int j:gs[i]) {
                if(dist[j][0] < dist[j][1]) {
                    sta.insert(mp(min(i, j), max(i, j)));
                }
            }
        }
        else {
            for(int j:gs[i]) {
                if(dist[j][0] > dist[j][1]) {
                    stb.insert(mp(min(i, j), max(i, j)));
                }
            }
        }
    }
}

int solve(int root, int d) {
    // build bfs tree
    //memset(visited,false,sizeof(visited));
    //memset(parent,-1,sizeof(parent));

    set<pair<int,int> > edges;
    if(d == 0) edges = sta;
    else edges = stb;

    for(auto i:edges) {
        gt[i.first].pb(i.second);
        gt[i.second].pb(i.first);
    }

    vector<int>v, v2;

    queue<int>q;
    q.push(root);

    visited[root] = true;
    parent[root][d] = -1;

    while(!q.empty()) {
        int curr = q.front();
        q.pop();

        v.pb(parent[curr][d]);
        v2.pb(curr);
        for(auto i:gt[curr]) {
            if(!visited[i]) {
                visited[i] = true;
                parent[i][d] = curr;
                dist[i][d] = dist[curr][d] + 1;
                q.push(i);
            }
        }
    }

    if(v.size() == 1) return v2[0];
    // perform binary search

    for(int i=0;i<v.size();i++) {
        if(v[i] == -1) continue; // root
        int cind = ind[mp(v[i], v2[i])];
        w[cind] = 1;
    }

    int li = 0, ri = v.size() - 1;

    while(li < ri) {
        int mid = (li + ri) / 2;

        // all before mid put them as low cost and other as high cost
        for(int i=0;i<=mid;i++) {
            if(v[i] == -1) continue; // root
            int cind = ind[mp(v[i], v2[i])];
            w[cind] = 0;
        }

        ll cdist = ask(w);
        for(int i=0;i<=mid;i++) {
            if(v[i] == -1) continue; // root
            int cind = ind[mp(v[i], v2[i])];
            w[cind] = 1;
        }

        if(cdist == dista) {
            ri = mid;
        }
        else {
            li = mid + 1;
        }
    }

    for(int i=0;i<v.size();i++) {
        if(v[i] == -1) continue; // root
        int cind = ind[mp(v[i], v2[i])];
        w[cind] = 0;
    }

    return v2[li];
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
    n = N; m = U.size();
    int li=0, ri=m-1;

    for(int i=0;i<m;i++) {
        ind[mp(U[i], V[i])] = ind[mp(V[i], U[i])] = i;
        gs[U[i]].pb(V[i]);
        gs[V[i]].pb(U[i]);

        g[U[i]].pb(mp(V[i], i));
        g[V[i]].pb(mp(U[i], i));

        w.pb(0);
    }

    dista = ask(w);
    while(li<ri) {
        int mid = (li+ri)/2;
        for(int i=li;i<=mid;i++) {
            w[i] = 1;
        }
        ll distb = ask(w);
        for(int i=li;i<=mid;i++) {
            w[i] = 0;
        }

        if(dista == distb) {
            li = mid + 1;
        }
        else {
            ri = mid;
        }
    }
    int x = li;
    int u = U[x], v = V[x];

    //cout<<u<<" "<<v<<"\n";

    bfs(u, 0);
    bfs(v, 1);
    preprocess();

    for(int i=0;i<maxn;i++) visited[i] = false;
    //cout<<"Ans: "<<xx<<" "<<yy<<"\n";
    answer(solve(u, 0), solve(v, 1));
}

Compilation message

highway.cpp: In function 'int solve(int, int)':
highway.cpp:111:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v.size();i++) {
                 ~^~~~~~~~~
highway.cpp:144:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v.size();i++) {
                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7428 KB Output is correct
2 Correct 9 ms 7400 KB Output is correct
3 Correct 9 ms 7396 KB Output is correct
4 Correct 9 ms 7528 KB Output is correct
5 Correct 9 ms 7464 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7396 KB Output is correct
8 Correct 9 ms 7476 KB Output is correct
9 Correct 9 ms 7396 KB Output is correct
10 Correct 9 ms 7416 KB Output is correct
11 Correct 9 ms 7396 KB Output is correct
12 Correct 9 ms 7400 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 7848 KB Output is correct
2 Correct 64 ms 11128 KB Output is correct
3 Execution timed out 1521 ms 40808 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 11000 KB Output is correct
2 Correct 88 ms 14348 KB Output is correct
3 Correct 115 ms 18056 KB Output is correct
4 Correct 493 ms 36940 KB Output is correct
5 Correct 388 ms 36944 KB Output is correct
6 Correct 755 ms 38524 KB Output is correct
7 Correct 422 ms 39748 KB Output is correct
8 Correct 620 ms 37572 KB Output is correct
9 Correct 425 ms 38696 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 7852 KB Output is correct
2 Correct 70 ms 10768 KB Output is correct
3 Correct 537 ms 33472 KB Output is correct
4 Correct 860 ms 40796 KB Output is correct
5 Correct 738 ms 40924 KB Output is correct
6 Correct 760 ms 40952 KB Output is correct
7 Correct 715 ms 40788 KB Output is correct
8 Correct 752 ms 40908 KB Output is correct
9 Correct 1238 ms 40548 KB Output is correct
10 Correct 1060 ms 40636 KB Output is correct
11 Execution timed out 1706 ms 39960 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 10968 KB Output is correct
2 Correct 69 ms 11460 KB Output is correct
3 Execution timed out 1974 ms 42588 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 11088 KB Output is correct
2 Correct 114 ms 11640 KB Output is correct
3 Correct 789 ms 38712 KB Output is correct
4 Incorrect 1199 ms 42652 KB Output is incorrect: {s, t} is wrong.
5 Halted 0 ms 0 KB -