oj.uz

Submission #1039642

# Submission time Handle Problem Language Result Execution time Memory
1039642 2024-07-31T06:36:13 Z vjudge1 Highway Tolls (IOI18_highway) C++17
51 / 100
 126 ms 19020 KB 
#include "highway.h"
#include<bits/stdc++.h>
#define K 1<<17
using namespace std;
int par[K],dep[K],ord[K],pos[K],CC,bfspar[2][K],bfspari[2][K],bfsdis[2][K];
vector<pair<int,int>>adj[K];
void bfs(int n,int i){
    queue<int>q;
    memset(bfsdis[i],-1,sizeof par);
    q.push(n);
    bfsdis[i][n]=0;
    bfspar[i][n]=-1;
    while(q.size()){
        int x=q.front(),d=bfsdis[i][x]; q.pop();
        for(auto [j,k]:adj[x]) if(bfsdis[i][j]<0)
            bfspar[i][j]=x,bfspari[i][j]=k,
            bfsdis[i][j]=d+1,q.push(j);
    }
}
void dfs(int n,int in){
    pos[n]=++CC;
    for(auto [i,k]:adj[n])
        if(bfspar[in][i]==n)
            dep[i]=dep[n]+1,
            par[i]=k,dfs(i,in);
}
int whicho(int pivot,int N,int ind,int M,vector<int>v,long long D,int spec){
    dfs(pivot,ind);
    sort(v.begin(),v.end(),[](int a,int b){
        return pos[a]<pos[b];
    });
    int l=1,r=v.size()-1,res=1;
    while(l<=r){
        int mid=l+r>>1;
        vector<int>V(M,1);
        V[spec]=0;
        for(int i=mid;i<v.size();i++) {
            if(bfspar[ind][v[i]]!=pivot)
                if(!V[bfspari[ind][bfspar[ind][v[i]]]])
                    continue;
            V[bfspari[ind][v[i]]]=0;
        }
        if(ask(V)<D)
            l=res=mid+1;
        else r=mid-1;
    }
    return v[res-1];
}
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++)
        adj[U[i]].push_back({V[i],i}),
        adj[V[i]].push_back({U[i],i});
    long long D=ask(vector<int>(M,0))/A;
    int res=1e9,l=1,r=M-1;
    while(l<=r){
        int mid=l+r>>1;
        vector<int>v(M);
        for(int i=0;i<mid;i++)
            v[i]=1;
        if(ask(v)>D*A)
            res=r=mid-1;
        else l=mid+1;
    }
    int a=U[res],b=V[res];
    bfs(a,0);
    bfs(b,1);
    vector<int>sta,stb;
    for(int i=0;i<N;i++)
        if(bfsdis[0][i]<bfsdis[1][i])
            sta.push_back(i);
        else if(bfsdis[0][i]-bfsdis[1][i])
            stb.push_back(i);
    answer(whicho(a,N,0,M,sta,D*B-B+A,res),
            whicho(b,N,1,M,stb,D*B-B+A,res));
}

Compilation message

highway.cpp: In function 'int whicho(int, int, int, int, std::vector<int>, long long int, int)':
highway.cpp:34:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |         int mid=l+r>>1;
      |                 ~^~
highway.cpp:37:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for(int i=mid;i<v.size();i++) {
      |                       ~^~~~~~~~~
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:57:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4440 KB Output is correct
2 Correct 12 ms 5480 KB Output is correct
3 Correct 111 ms 12900 KB Output is correct
4 Correct 105 ms 13192 KB Output is correct
5 Correct 122 ms 12924 KB Output is correct
6 Correct 108 ms 12912 KB Output is correct
7 Correct 94 ms 12904 KB Output is correct
8 Correct 107 ms 13120 KB Output is correct
9 Correct 94 ms 12924 KB Output is correct
10 Correct 93 ms 12912 KB Output is correct
11 Correct 104 ms 13892 KB Output is correct
12 Correct 126 ms 14704 KB Output is correct
13 Correct 96 ms 14068 KB Output is correct
14 Correct 120 ms 14132 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5976 KB Output is correct
2 Correct 17 ms 7512 KB Output is correct
3 Correct 21 ms 9240 KB Output is correct
4 Correct 72 ms 16724 KB Output is correct
5 Correct 79 ms 16784 KB Output is correct
6 Correct 77 ms 18296 KB Output is correct
7 Correct 72 ms 19020 KB Output is correct
8 Correct 74 ms 17472 KB Output is correct
9 Correct 74 ms 17632 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 11 ms 5464 KB Output is correct
3 Correct 73 ms 11068 KB Output is correct
4 Correct 101 ms 13152 KB Output is correct
5 Correct 104 ms 12892 KB Output is correct
6 Correct 86 ms 12916 KB Output is correct
7 Correct 105 ms 12912 KB Output is correct
8 Correct 98 ms 12892 KB Output is correct
9 Correct 101 ms 12904 KB Output is correct
10 Correct 105 ms 12916 KB Output is correct
11 Correct 95 ms 13768 KB Output is correct
12 Correct 116 ms 14652 KB Output is correct
13 Correct 99 ms 14428 KB Output is correct
14 Correct 104 ms 14584 KB Output is correct
15 Correct 104 ms 12924 KB Output is correct
16 Correct 100 ms 12908 KB Output is correct
17 Correct 97 ms 13880 KB Output is correct
18 Correct 101 ms 14340 KB Output is correct
19 Correct 116 ms 12912 KB Output is correct
20 Correct 120 ms 15656 KB Output is correct
21 Correct 73 ms 13632 KB Output is correct
22 Correct 83 ms 13636 KB Output is correct
23 Correct 87 ms 13432 KB Output is correct
24 Correct 90 ms 13616 KB Output is correct
25 Correct 104 ms 18476 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 5464 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 5464 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -