oj.uz

답안 #1099207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099207 2024-10-10T18:11:28 Z MMihalev 통행료 (IOI18_highway) C++14
100 / 100
 175 ms 20108 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>49)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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 5720 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 2 ms 5720 KB Output is correct
4 Correct 2 ms 4696 KB Output is correct
5 Correct 2 ms 4696 KB Output is correct
6 Correct 1 ms 5720 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 2 ms 4696 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 1 ms 5976 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 10 ms 5652 KB Output is correct
3 Correct 93 ms 15152 KB Output is correct
4 Correct 114 ms 14308 KB Output is correct
5 Correct 105 ms 15144 KB Output is correct
6 Correct 101 ms 15968 KB Output is correct
7 Correct 98 ms 14832 KB Output is correct
8 Correct 95 ms 14368 KB Output is correct
9 Correct 104 ms 14348 KB Output is correct
10 Correct 102 ms 15488 KB Output is correct
11 Correct 87 ms 14792 KB Output is correct
12 Correct 96 ms 16096 KB Output is correct
13 Correct 93 ms 15228 KB Output is correct
14 Correct 106 ms 15076 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6920 KB Output is correct
2 Correct 20 ms 7476 KB Output is correct
3 Correct 29 ms 8368 KB Output is correct
4 Correct 78 ms 17072 KB Output is correct
5 Correct 80 ms 16568 KB Output is correct
6 Correct 87 ms 18628 KB Output is correct
7 Correct 76 ms 13500 KB Output is correct
8 Correct 80 ms 17636 KB Output is correct
9 Correct 77 ms 14612 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Correct 13 ms 5640 KB Output is correct
3 Correct 76 ms 12052 KB Output is correct
4 Correct 91 ms 14632 KB Output is correct
5 Correct 102 ms 14204 KB Output is correct
6 Correct 85 ms 14340 KB Output is correct
7 Correct 95 ms 14348 KB Output is correct
8 Correct 112 ms 14356 KB Output is correct
9 Correct 110 ms 15296 KB Output is correct
10 Correct 96 ms 15060 KB Output is correct
11 Correct 101 ms 14380 KB Output is correct
12 Correct 97 ms 15764 KB Output is correct
13 Correct 93 ms 14772 KB Output is correct
14 Correct 93 ms 15236 KB Output is correct
15 Correct 97 ms 14372 KB Output is correct
16 Correct 87 ms 14328 KB Output is correct
17 Correct 100 ms 15188 KB Output is correct
18 Correct 89 ms 15512 KB Output is correct
19 Correct 89 ms 14300 KB Output is correct
20 Correct 96 ms 15256 KB Output is correct
21 Correct 107 ms 16880 KB Output is correct
22 Correct 103 ms 16832 KB Output is correct
23 Correct 95 ms 16848 KB Output is correct
24 Correct 109 ms 16948 KB Output is correct
25 Correct 100 ms 20108 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 6664 KB Output is correct
2 Correct 13 ms 5896 KB Output is correct
3 Correct 118 ms 15568 KB Output is correct
4 Correct 132 ms 15932 KB Output is correct
5 Correct 147 ms 16380 KB Output is correct
6 Correct 139 ms 17604 KB Output is correct
7 Correct 145 ms 16800 KB Output is correct
8 Correct 152 ms 17492 KB Output is correct
9 Correct 106 ms 13048 KB Output is correct
10 Correct 97 ms 13052 KB Output is correct
11 Correct 121 ms 14420 KB Output is correct
12 Correct 147 ms 15144 KB Output is correct
13 Correct 126 ms 15920 KB Output is correct
14 Correct 168 ms 16528 KB Output is correct
15 Correct 151 ms 16068 KB Output is correct
16 Correct 119 ms 13672 KB Output is correct
17 Correct 120 ms 16880 KB Output is correct
18 Correct 112 ms 17140 KB Output is correct
19 Correct 110 ms 16964 KB Output is correct
20 Correct 110 ms 17172 KB Output is correct
21 Correct 150 ms 16696 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 6664 KB Output is correct
2 Correct 13 ms 5896 KB Output is correct
3 Correct 105 ms 15024 KB Output is correct
4 Correct 132 ms 16508 KB Output is correct
5 Correct 124 ms 16192 KB Output is correct
6 Correct 147 ms 16952 KB Output is correct
7 Correct 109 ms 15196 KB Output is correct
8 Correct 107 ms 15120 KB Output is correct
9 Correct 134 ms 15440 KB Output is correct
10 Correct 154 ms 16652 KB Output is correct
11 Correct 146 ms 16712 KB Output is correct
12 Correct 145 ms 16352 KB Output is correct
13 Correct 109 ms 13632 KB Output is correct
14 Correct 107 ms 13264 KB Output is correct
15 Correct 105 ms 13536 KB Output is correct
16 Correct 121 ms 12808 KB Output is correct
17 Correct 117 ms 14428 KB Output is correct
18 Correct 113 ms 13256 KB Output is correct
19 Correct 152 ms 15712 KB Output is correct
20 Correct 133 ms 15472 KB Output is correct
21 Correct 136 ms 16092 KB Output is correct
22 Correct 175 ms 16424 KB Output is correct
23 Correct 142 ms 16524 KB Output is correct
24 Correct 141 ms 16116 KB Output is correct
25 Correct 143 ms 16448 KB Output is correct
26 Correct 157 ms 16572 KB Output is correct
27 Correct 111 ms 16988 KB Output is correct
28 Correct 98 ms 16840 KB Output is correct
29 Correct 115 ms 17244 KB Output is correct
30 Correct 103 ms 17080 KB Output is correct
31 Correct 118 ms 17296 KB Output is correct
32 Correct 109 ms 16908 KB Output is correct
33 Correct 99 ms 17288 KB Output is correct
34 Correct 100 ms 17000 KB Output is correct
35 Correct 115 ms 16980 KB Output is correct
36 Correct 109 ms 16844 KB Output is correct
37 Correct 119 ms 17208 KB Output is correct
38 Correct 127 ms 17040 KB Output is correct
39 Correct 135 ms 16468 KB Output is correct
40 Correct 141 ms 16844 KB Output is correct
41 Correct 142 ms 16436 KB Output is correct
42 Correct 141 ms 16104 KB Output is correct