oj.uz

Submission #919085

# Submission time Handle Problem Language Result Execution time Memory
919085 2024-01-31T08:22:07 Z velislavgarkov Highway Tolls (IOI18_highway) C++14
5 / 100
 87 ms 11764 KB 
#include "highway.h"
#include <iostream>
#include <vector>
using namespace std;
const int MAXN=1e5+10;
vector <pair <int,int> > v[MAXN], dist;
vector <int> w;
int edge;
long long path;
int n;
long long a, b;
void find_tree(int x, int par) {
    for (auto i:v[x]) {
        if (i.second==edge) continue;
        if (i.first==par) continue;
        w[i.second]=1;
        find_tree(i.first,x);
    }
}
void dfs(int x, int par, int d) {
    for (auto i:v[x]) {
        if (i.second==edge) continue;
        if (i.first==par) continue;
        if (d==1) {
            dist.push_back(i);
            continue;
        }
        dfs(i.first,x,d-1);
    }
}
int find_one(int start) {
    for (int i=0;i<n-1;i++) w[i]=0;
    find_tree(start,start);
    int d=(ask(w)-path)/(b-a);
    if (d==0) return start;
    if (!dist.empty()) dist.clear();
    dfs(start,start,d);
    int l, r, mid;
    l=0; r=dist.size()-1;
    while (l<r) {
        mid=(l+r)/2;
        for (int i=0;i<n-1;i++) w[i]=0;
        for (int i=l;i<=mid;i++) w[dist[i].second]=1;
        int cur=ask(w);
        if (cur==path) l=mid+1;
        else r=mid;
    }
    return dist[l].first;
}
void find_pair (int N, vector <int> U, vector <int> V, int A, int B) {
    n=N; a=A; b=B;
    w.resize(n-1);
    for (int i=0;i<n-1;i++) {
        v[U[i]].push_back({V[i],i});
        v[V[i]].push_back({U[i],i});
    }
    for (int i=0;i<n-1;i++) w[i]=0;
    path=ask(w);
    //cout << path << endl;
    int l, r, mid;
    l=0; r=n-1;
    while (l<r) {
        mid=(l+r)/2;
        for (int i=0;i<n-1;i++) w[i]=0;
        for (int i=l;i<=mid;i++) w[i]=1;
        int cur=ask(w);
        if (cur==path) l=mid+1;
        else r=mid;
    }
    edge=l;
    //cout << U[edge] << ' ' << V[edge] << endl;
    int ans1, ans2;
    ans1=find_one(U[edge]);
    ans2=find_one(V[edge]);
    answer(ans1,ans2);    
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2844 KB Output is correct
2 Correct 10 ms 3400 KB Output is correct
3 Correct 78 ms 8140 KB Output is correct
4 Correct 87 ms 8324 KB Output is correct
5 Correct 84 ms 8132 KB Output is correct
6 Correct 79 ms 8160 KB Output is correct
7 Correct 81 ms 8136 KB Output is correct
8 Correct 71 ms 7940 KB Output is correct
9 Correct 76 ms 7956 KB Output is correct
10 Correct 81 ms 8116 KB Output is correct
11 Correct 77 ms 8164 KB Output is correct
12 Correct 77 ms 8960 KB Output is correct
13 Correct 80 ms 8400 KB Output is correct
14 Incorrect 86 ms 8448 KB Output is incorrect: {s, t} is wrong.
15 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3616 KB Output is correct
2 Correct 14 ms 4488 KB Output is correct
3 Correct 21 ms 5332 KB Output is correct
4 Correct 64 ms 10168 KB Output is correct
5 Correct 59 ms 10216 KB Output is correct
6 Correct 64 ms 11764 KB Output is correct
7 Correct 65 ms 11428 KB Output is correct
8 Correct 62 ms 10372 KB Output is correct
9 Incorrect 60 ms 11580 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2840 KB Output is correct
2 Correct 8 ms 3408 KB Output is correct
3 Correct 55 ms 7024 KB Output is correct
4 Correct 73 ms 8144 KB Output is correct
5 Correct 71 ms 7916 KB Output is correct
6 Correct 70 ms 7908 KB Output is correct
7 Correct 69 ms 7912 KB Output is correct
8 Correct 75 ms 8168 KB Output is correct
9 Incorrect 79 ms 7916 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 3160 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 3160 KB Incorrect
2 Halted 0 ms 0 KB -