Submission #578703

#	Time	Username	Problem	Language	Result	Execution time	Memory
578703		ogibogi2004	Highway Tolls (IOI18_highway)	C++14	0 / 100	256 ms	262144 KiB

highway

#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN=9e4+6;
vector<pair<int,int> >g[MAXN];
int par[MAXN];
int parEdge[MAXN];
vector<int>order;
void dfs(int u,int p)
{
    order.push_back(u);
    for(auto xd:g[u])
    {
        if(xd.first==p)continue;
        par[xd.first]=u;
        parEdge[xd.first]=xd.second;
        dfs(xd.first,u);
        order.push_back(u);
    }
}
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
    int M = U.size();
    for(int i=0;i<M;i++)
    {
        g[U[i]].push_back({V[i],i});
        g[V[i]].push_back({U[i],i});
    }
    dfs(0,-1);
    int low=0,high=N-1,s,t;
    int dist;
    vector<int>w;
    for(int i=0;i<M;i++)w.push_back(0);
    dist=(long long)ask(w)/A;
    while(low<=high)
    {
        int mid=(low+high)/2;
        for(int j=0;j<=mid;j++)w[j]=1;
        for(int j=mid+1;j<M;j++)w[j]=0;
        int cntheavy=(long long)(ask(w)-dist*A)/(B-A);
        if(cntheavy==dist)
        {
            s=mid;
            high=mid-1;
        }
        else low=mid+1;
    }
    low=0;high=N-1;
    while(low<=high)
    {
        int mid=(low+high)/2;
        for(int j=0;j<mid;j++)w[j]=0;
        for(int j=mid;j<M;j++)w[j]=1;
        int cntheavy=(long long)(ask(w)-dist*A)/(B-A);
        if(cntheavy==dist)
        {
            t=mid;
            low=mid+1;
        }
        else high=mid-1;
    }
    answer(s,t);
}

Compilation message (stderr)

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:61:11: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |     answer(s,t);
      |     ~~~~~~^~~~~
highway.cpp:61:11: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31