oj.uz

Submission #220120

# Submission time Handle Problem Language Result Execution time Memory
220120 2020-04-07T05:29:16 Z IgorI Highway Tolls (IOI18_highway) C++17
69 / 100
 284 ms 16700 KB 
#ifdef LOCAL

#else
#include <highway.h>
#endif // LOCAL

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

#ifdef LOCAL
void answer(int s, int t)
{
    cout << s << " " << t << endl;
    exit(0);
}

long long ask(vector<int> w)
{
    long long res;
    for (int i = 0; i < w.size(); i++)
    {
        cout << w[i] << " ";
    }
    cout << endl;
    cin >> res;
    return res;
}
#endif // LOCAL

const int N = 200000;
int n, m, a, b;
vector<vector<int> > g;
vector<int> u, v;
long long Dist;
int linker;

struct tr{
    int id, ver, dist;
};

bool comp(tr a, tr b)
{
    return a.dist < b.dist;
}

vector<tr> bfs(int root, vector<int> use)
{
    vector<int> curdist(n, N);
    vector<int> ok(m);
    for (int i = 0; i < use.size(); i++) ok[use[i]] = 1;
    vector<int> q = {root};
    curdist[root] = 0;
    vector<tr> ans = {{linker, root, 0}};
    for (int i = 0; i < q.size(); i++)
    {
        int x = q[i];
        for (auto id : g[x])
        {
            int y = u[id] + v[id] - x;
            if (ok[id] && curdist[y] == N)
            {
                curdist[y] = curdist[x] + 1;
                q.push_back(y);
                ans.push_back({id, y, curdist[y]});
            }
        }
    }
    return ans;
}

int solve_for_tree(int root, vector<int> edges, vector<int> others)
{
    vector<tr> kek = bfs(root, edges);
    sort(kek.begin(), kek.end(), comp);
    int l = -1, r = kek.size() + 1;
    while (l + 1 < r)
    {
        int mid = (l + r) / 2;
        vector<int> w(m, 1);
        for (auto it : others) w[it] = 0;
        for (int i = 0; i < mid; i++) w[kek[i].id] = 0;
        long long si = ask(w);
        if (si == Dist * a)
            r = mid;
        else
            l = mid;
    }
    #ifdef LOCAL
        cerr << kek.size() << "\n";
        for (int i = 0; i < kek.size(); i++)
        {
            cerr << kek[i].id << " " << kek[i].ver << " " << kek[i].dist << "\n";
        }
    #endif
    return kek[l].ver;
}

void find_pair(int n0, vector<int> v0, vector<int> u0, int a0, int b0)
{
    n = n0;
    a = a0;
    b = b0;
    m = v0.size();
    g.resize(n0);
    v = v0, u = u0;
    for (int i = 0; i < m; i++)
    {
        g[v[i]].push_back(i);
        g[u[i]].push_back(i);
    }
    vector<int> q0(m);
    Dist = ask(q0) / a;

    int l = -1, r = m + 1;
    while (l + 1 < r)
    {
        int mid = (l + r) / 2;
        vector<int> q(m, 1);
        for (int i = l; i < mid; i++)
        {
            q[i] = 0;
        }
        long long res = ask(q);
        if (res == Dist * b)
            l = mid;
        else
            r = mid;
    }
    int V = v[l];
    int U = u[l];
    linker = l;
    vector<int> distV(n, N), distU(n, N), fromV(n), fromU(n);
    distV[V] = 0, distU[U] = 0;
    vector<int> qV = {V};
    for (int i = 0; i < qV.size(); i++)
    {
        int x = qV[i];
        for (auto id : g[x])
        {
            int y = v[id] + u[id] - x;
            if (distV[y] == N)
            {
                distV[y] = distV[x] + 1;
                qV.push_back(y);
                fromV[y] = id;
            }
        }
    }
    vector<int> qU = {U};
    for (int i = 0; i < qU.size(); i++)
    {
        int x = qU[i];
        for (auto id : g[x])
        {
            int y = v[id] + u[id] - x;
            if (distU[y] == N)
            {
                distU[y] = distU[x] + 1;
                qU.push_back(y);
                fromU[y] = id;
            }
        }
    }
    vector<int> vecV, vecU;
    for (int i = 0; i < n; i++)
    {
        if (i != U) if (distU[i] <= distV[i]) vecU.push_back(fromU[i]);
        if (i != V) if (distV[i] < distU[i]) vecV.push_back(fromV[i]);
    }
    #ifdef LOCAL
        cerr << "determined : " << V << " " << U << "\n";
        cerr << "tree (V) : ";
        for (auto id : vecV) cerr << v[id] << " " << u[id] << "\n";
        cerr << "\n";
        cerr << "tree (U) : ";
        for (auto id : vecU) cerr << v[id] << " " << u[id] << "\n";
        cerr << "\n";
    #endif // LOCAL
    if (Dist == 1)
    {
        answer(V, U);
        exit(0);
    }
    int s = solve_for_tree(V, vecV, vecU);
    cerr << "determined s = " << s << "\n";
    int t = solve_for_tree(U, vecU, vecV);
    cerr << "determined t = " << t << "\n";

    vector<int> all;
    for (int i = 0; i < m; i++) all.push_back(i);
    vector<tr> kek = bfs(s, all);
    int tt = 0;
    for (int i = 0; i < kek.size(); i++) if (kek[i].ver == t) tt = (kek[i].dist == Dist);
    if (tt == 0)
        exit(1);
    answer(s, t);
}

#ifdef LOCAL
signed main()
{
    int n, m, a, b;
    cin >> n >> m >> a >> b;
    vector<int> v(m), u(m);
    for (int i = 0; i < m; i++)
    {
        cin >> v[i] >> u[i];
    }
    find_pair(n, v, u, a, b);
}
#endif // LOCAL

Compilation message

highway.cpp: In function 'std::vector<tr> bfs(int, std::vector<int>)':
highway.cpp:54:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < use.size(); i++) ok[use[i]] = 1;
                     ~~^~~~~~~~~~~~
highway.cpp:58:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < q.size(); i++)
                     ~~^~~~~~~~~~
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:139:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < qV.size(); i++)
                     ~~^~~~~~~~~~~
highway.cpp:154:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < qU.size(); i++)
                     ~~^~~~~~~~~~~
highway.cpp:197:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < kek.size(); i++) if (kek[i].ver == t) tt = (kek[i].dist == Dist);
                     ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 18 ms 1988 KB Output is correct
3 Correct 197 ms 14604 KB Output is correct
4 Correct 190 ms 14556 KB Output is correct
5 Correct 193 ms 14472 KB Output is correct
6 Correct 177 ms 14504 KB Output is correct
7 Correct 192 ms 14744 KB Output is correct
8 Correct 178 ms 14520 KB Output is correct
9 Correct 181 ms 14848 KB Output is correct
10 Correct 186 ms 14556 KB Output is correct
11 Correct 208 ms 14828 KB Output is correct
12 Correct 206 ms 14672 KB Output is correct
13 Correct 201 ms 14372 KB Output is correct
14 Correct 189 ms 14688 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2008 KB Output is correct
2 Correct 31 ms 3740 KB Output is correct
3 Correct 50 ms 5052 KB Output is correct
4 Correct 137 ms 14756 KB Output is correct
5 Correct 140 ms 14796 KB Output is correct
6 Correct 146 ms 14436 KB Output is correct
7 Correct 136 ms 14616 KB Output is correct
8 Correct 140 ms 14944 KB Output is correct
9 Correct 138 ms 14576 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 23 ms 2104 KB Output is correct
3 Correct 136 ms 12084 KB Output is correct
4 Correct 182 ms 14464 KB Output is correct
5 Correct 176 ms 14796 KB Output is correct
6 Correct 180 ms 14524 KB Output is correct
7 Correct 173 ms 14608 KB Output is correct
8 Correct 172 ms 14672 KB Output is correct
9 Correct 189 ms 14708 KB Output is correct
10 Correct 189 ms 14640 KB Output is correct
11 Correct 200 ms 14568 KB Output is correct
12 Correct 210 ms 14628 KB Output is correct
13 Correct 223 ms 14656 KB Output is correct
14 Correct 225 ms 14800 KB Output is correct
15 Correct 174 ms 14532 KB Output is correct
16 Correct 179 ms 14640 KB Output is correct
17 Correct 206 ms 14620 KB Output is correct
18 Correct 202 ms 14528 KB Output is correct
19 Correct 177 ms 14688 KB Output is correct
20 Correct 202 ms 14348 KB Output is correct
21 Correct 134 ms 14720 KB Output is correct
22 Correct 132 ms 14856 KB Output is correct
23 Correct 149 ms 14868 KB Output is correct
24 Correct 157 ms 15120 KB Output is correct
25 Correct 205 ms 14676 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2040 KB Output is correct
2 Correct 26 ms 2000 KB Output is correct
3 Correct 221 ms 15428 KB Output is correct
4 Correct 240 ms 15496 KB Output is correct
5 Correct 284 ms 16444 KB Output is correct
6 Correct 264 ms 16296 KB Output is correct
7 Correct 258 ms 16252 KB Output is correct
8 Correct 277 ms 16320 KB Output is correct
9 Correct 171 ms 9640 KB Output is correct
10 Correct 151 ms 7416 KB Output is correct
11 Correct 183 ms 11232 KB Output is correct
12 Correct 256 ms 15096 KB Output is correct
13 Correct 254 ms 15432 KB Output is correct
14 Correct 270 ms 16424 KB Output is correct
15 Correct 269 ms 16260 KB Output is correct
16 Correct 206 ms 11496 KB Output is correct
17 Correct 152 ms 14952 KB Output is correct
18 Correct 148 ms 15280 KB Output is correct
19 Correct 161 ms 14820 KB Output is correct
20 Correct 167 ms 14932 KB Output is correct
21 Correct 260 ms 16168 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2076 KB Output is correct
2 Correct 23 ms 2036 KB Output is correct
3 Correct 226 ms 15040 KB Output is correct
4 Correct 204 ms 15444 KB Output is correct
5 Correct 228 ms 15672 KB Output is correct
6 Runtime error 277 ms 16700 KB Execution failed because the return code was nonzero
7 Halted 0 ms 0 KB -