oj.uz

Submission #1099209

# Submission time Handle Problem Language Result Execution time Memory
1099209 2024-10-10T18:13:03 Z MMihalev Highway Tolls (IOI18_highway) C++14
100 / 100
 174 ms 20120 KB 
#include "highway.h"
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int MAX_N=90005;
int q;
int remedges;
int n,m;
vector<int>w;
vector<pair<int,int> >g[MAX_N],G[MAX_N];
long long edges,cost;
int root;
int a,b;
int parent[MAX_N];
int paredge[MAX_N];
int depth[MAX_N];
vector<int>ENDS;
vector<pair<int,int>>nodes;
bool used[MAX_N];
bool usededge[130010];
void initbfs()
{
    queue<int>q;
    q.push(root);
    used[root]=1;
 
    while(q.size())
    {
        int u=q.front();
        q.pop();
 
        for(auto [v,edge]:G[u])
        {
            if(used[v])continue;
 
            used[v]=1;
            usededge[edge]=1;
            g[u].push_back({v,edge});
            g[v].push_back({u,edge});
            parent[v]=u;
            paredge[v]=edge;
            depth[v]=depth[u]+1;
            q.push(v);
        }
    }
}
int onpath()
{
    vector<pair<int,int>>node;
    for(int i=0;i<n;i++)
    {
        node.push_back({G[i].size(),i});
    }
    sort(node.begin(),node.end());
 
    int l=0,r=n-1;
    int ans;
 
    while(l<=r)
    {
        int mid=(l+r)/2;
        for(int u=0;u<=mid;u++)
        {
            for(auto [v,edge]:G[node[u].second])
            {
                w[edge]=1;
            }
        }
        long long ncost=ask(w);q++;
        for(int u=0;u<=mid;u++)
        {
            for(auto [v,edge]:G[node[u].second])
            {
                w[edge]=0;
            }
        }
        if(ncost!=cost)
        {
            ans=node[mid].second;
            r=mid-1;
        }
        else l=mid+1;
    }
 
    return ans;
}
void nodesdfs(int u)
{
    if(remedges==edges)
    {
        if(depth[u]<=remedges)nodes.push_back({depth[u],u});
    }
    else if(depth[u]==remedges)nodes.push_back({depth[u],u});
 
    for(auto [v,edge]:g[u])
    {
        if(v==parent[u])continue;
 
        nodesdfs(v);
    }
}
int rec(int l,int r)
{
    if(l==r)
    {
        return nodes[l].second;
    }
 
    int mid=(l+r)/2;
 
    for(int i=l;i<=mid;i++)
    {
        w[paredge[nodes[i].second]]=1;
    }
    long long ncost=ask(w);q++;
    for(int i=l;i<=mid;i++)
    {
        w[paredge[nodes[i].second]]=0;
    }
 
    if(ncost!=cost)return rec(l,mid);
    return rec(mid+1,r);
}
void solve(int branch,bool with)
{
    nodes.clear();
    for(int i=0;i<g[root].size();i++)
    {
        if(with)
        {
            if(i!=branch)continue;
        }
        else
        {
            if(i==branch)continue;
        }
 
        nodesdfs(g[root][i].first);
    }
    sort(nodes.rbegin(),nodes.rend());
    ENDS.push_back(rec(0,nodes.size()-1));
}
int solvetwo()
{
    int l=0,r=g[root].size()-1;
    int ans=-1;
 
    while(l<=r)
    {
        int mid=(l+r)/2;
 
        for(int i=0;i<=mid;i++)
        {
            w[g[root][i].second]=1;
        }
        long long ncost=ask(w);q++;
        for(int i=0;i<=mid;i++)
        {
            w[g[root][i].second]=0;
        }
 
        if(ncost!=cost)
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
 
    return ans;
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B)
{
    n=N;
    m=U.size();
    w.resize(m);
    a=A;
    b=B;
 
    for(int i=0;i<m;i++)
    {
        G[U[i]].push_back({V[i],i});
        G[V[i]].push_back({U[i],i});
    }
 
    cost=ask(w);q++;
    edges=cost/a;
    remedges=edges;
 
    root=onpath();
    initbfs();
    for(int i=0;i<m;i++)
    {
        if(usededge[i])continue;
        w[i]=1;
    }
 
    int branch=solvetwo();
    solve(branch,1);
    if(depth[ENDS[0]]==edges)
    {
        ENDS.push_back(root);
    }
    else
    {
        remedges-=depth[ENDS[0]];
        solve(branch,0);
    }
 
  	if(q>47)while(1);
  
    answer(ENDS[0],ENDS[1]);
}

Compilation message

highway.cpp: In function 'void initbfs()':
highway.cpp:34:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |         for(auto [v,edge]:G[u])
      |                  ^
highway.cpp: In function 'int onpath()':
highway.cpp:66:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |             for(auto [v,edge]:G[node[u].second])
      |                      ^
highway.cpp:74:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   74 |             for(auto [v,edge]:G[node[u].second])
      |                      ^
highway.cpp: In function 'void nodesdfs(int)':
highway.cpp:97:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   97 |     for(auto [v,edge]:g[u])
      |              ^
highway.cpp: In function 'void solve(int, bool)':
highway.cpp:129:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for(int i=0;i<g[root].size();i++)
      |                 ~^~~~~~~~~~~~~~~
highway.cpp: In function 'int onpath()':
highway.cpp:87:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |     return ans;
      |            ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 10 ms 6664 KB Output is correct
3 Correct 123 ms 15320 KB Output is correct
4 Correct 108 ms 14372 KB Output is correct
5 Correct 103 ms 15176 KB Output is correct
6 Correct 120 ms 16080 KB Output is correct
7 Correct 107 ms 14500 KB Output is correct
8 Correct 96 ms 14324 KB Output is correct
9 Correct 102 ms 14324 KB Output is correct
10 Correct 101 ms 15264 KB Output is correct
11 Correct 104 ms 14780 KB Output is correct
12 Correct 98 ms 16012 KB Output is correct
13 Correct 94 ms 15236 KB Output is correct
14 Correct 100 ms 15080 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6920 KB Output is correct
2 Correct 19 ms 8440 KB Output is correct
3 Correct 28 ms 7592 KB Output is correct
4 Correct 81 ms 17056 KB Output is correct
5 Correct 85 ms 16812 KB Output is correct
6 Correct 77 ms 18620 KB Output is correct
7 Correct 77 ms 13528 KB Output is correct
8 Correct 85 ms 17588 KB Output is correct
9 Correct 83 ms 14616 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 10 ms 6784 KB Output is correct
3 Correct 79 ms 12084 KB Output is correct
4 Correct 97 ms 14608 KB Output is correct
5 Correct 107 ms 14332 KB Output is correct
6 Correct 89 ms 14344 KB Output is correct
7 Correct 83 ms 14276 KB Output is correct
8 Correct 105 ms 14280 KB Output is correct
9 Correct 100 ms 15260 KB Output is correct
10 Correct 98 ms 15456 KB Output is correct
11 Correct 90 ms 14220 KB Output is correct
12 Correct 90 ms 15796 KB Output is correct
13 Correct 93 ms 14940 KB Output is correct
14 Correct 93 ms 15232 KB Output is correct
15 Correct 110 ms 14360 KB Output is correct
16 Correct 93 ms 14304 KB Output is correct
17 Correct 100 ms 15076 KB Output is correct
18 Correct 100 ms 15832 KB Output is correct
19 Correct 99 ms 14352 KB Output is correct
20 Correct 89 ms 15232 KB Output is correct
21 Correct 103 ms 16812 KB Output is correct
22 Correct 117 ms 16820 KB Output is correct
23 Correct 110 ms 16672 KB Output is correct
24 Correct 111 ms 17220 KB Output is correct
25 Correct 101 ms 20120 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6664 KB Output is correct
2 Correct 13 ms 6920 KB Output is correct
3 Correct 120 ms 15584 KB Output is correct
4 Correct 137 ms 15928 KB Output is correct
5 Correct 160 ms 16496 KB Output is correct
6 Correct 144 ms 17524 KB Output is correct
7 Correct 151 ms 16800 KB Output is correct
8 Correct 174 ms 17496 KB Output is correct
9 Correct 112 ms 13036 KB Output is correct
10 Correct 106 ms 12632 KB Output is correct
11 Correct 133 ms 14436 KB Output is correct
12 Correct 146 ms 15152 KB Output is correct
13 Correct 137 ms 15844 KB Output is correct
14 Correct 154 ms 16512 KB Output is correct
15 Correct 146 ms 16064 KB Output is correct
16 Correct 117 ms 13616 KB Output is correct
17 Correct 104 ms 17156 KB Output is correct
18 Correct 125 ms 17120 KB Output is correct
19 Correct 113 ms 16984 KB Output is correct
20 Correct 109 ms 17088 KB Output is correct
21 Correct 136 ms 16208 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6664 KB Output is correct
2 Correct 15 ms 6920 KB Output is correct
3 Correct 111 ms 15224 KB Output is correct
4 Correct 126 ms 16504 KB Output is correct
5 Correct 119 ms 16052 KB Output is correct
6 Correct 147 ms 16988 KB Output is correct
7 Correct 116 ms 15420 KB Output is correct
8 Correct 104 ms 15292 KB Output is correct
9 Correct 125 ms 15624 KB Output is correct
10 Correct 149 ms 16664 KB Output is correct
11 Correct 139 ms 16712 KB Output is correct
12 Correct 149 ms 16360 KB Output is correct
13 Correct 113 ms 13596 KB Output is correct
14 Correct 112 ms 13260 KB Output is correct
15 Correct 107 ms 13516 KB Output is correct
16 Correct 118 ms 12804 KB Output is correct
17 Correct 121 ms 14432 KB Output is correct
18 Correct 111 ms 13252 KB Output is correct
19 Correct 151 ms 15696 KB Output is correct
20 Correct 129 ms 15660 KB Output is correct
21 Correct 137 ms 16348 KB Output is correct
22 Correct 157 ms 16424 KB Output is correct
23 Correct 141 ms 16528 KB Output is correct
24 Correct 131 ms 16064 KB Output is correct
25 Correct 167 ms 16436 KB Output is correct
26 Correct 163 ms 16516 KB Output is correct
27 Correct 106 ms 17068 KB Output is correct
28 Correct 98 ms 16868 KB Output is correct
29 Correct 109 ms 17288 KB Output is correct
30 Correct 106 ms 17088 KB Output is correct
31 Correct 95 ms 17052 KB Output is correct
32 Correct 109 ms 16912 KB Output is correct
33 Correct 95 ms 17288 KB Output is correct
34 Correct 93 ms 16908 KB Output is correct
35 Correct 105 ms 16996 KB Output is correct
36 Correct 107 ms 16856 KB Output is correct
37 Correct 106 ms 17216 KB Output is correct
38 Correct 126 ms 17044 KB Output is correct
39 Correct 142 ms 16652 KB Output is correct
40 Correct 149 ms 17340 KB Output is correct
41 Correct 137 ms 16200 KB Output is correct
42 Correct 145 ms 16212 KB Output is correct