oj.uz

답안 #1099188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099188 2024-10-10T17:12:07 Z MMihalev 통행료 (IOI18_highway) C++14
51 / 100
 1500 ms 18760 KB 
#include "highway.h"
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int MAX_N=90005;
int q;
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()
{
    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[u])
            {
                w[edge]=1;
            }
        }
        long long ncost=ask(w);q++;
        for(int u=0;u<=mid;u++)
        {
            for(auto [v,edge]:G[u])
            {
                w[edge]=0;
            }
        }
        if(ncost!=cost)
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }

    return ans;
}
void nodesdfs(int u)
{
    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;

    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
    {
        solve(branch,0);
    }

    if(q>56)while(1);

    answer(ENDS[0],ENDS[1]);
}

Compilation message

highway.cpp: In function 'void initbfs()':
highway.cpp:33:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   33 |         for(auto [v,edge]:G[u])
      |                  ^
highway.cpp: In function 'int onpath()':
highway.cpp:58:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |             for(auto [v,edge]:G[u])
      |                      ^
highway.cpp:66:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |             for(auto [v,edge]:G[u])
      |                      ^
highway.cpp: In function 'void nodesdfs(int)':
highway.cpp:84:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |     for(auto [v,edge]:g[u])
      |              ^
highway.cpp: In function 'void solve(int, bool)':
highway.cpp:116: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]
  116 |     for(int i=0;i<g[root].size();i++)
      |                 ~^~~~~~~~~~~~~~~
highway.cpp: In function 'int onpath()':
highway.cpp:79:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |     return ans;
      |            ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 4 ms 4696 KB Output is correct
3 Correct 2 ms 4680 KB Output is correct
4 Correct 3 ms 4696 KB Output is correct
5 Correct 3 ms 4696 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 4 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 2 ms 4696 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 12 ms 5976 KB Output is correct
3 Correct 119 ms 15544 KB Output is correct
4 Correct 101 ms 15480 KB Output is correct
5 Correct 107 ms 15468 KB Output is correct
6 Correct 106 ms 15480 KB Output is correct
7 Correct 90 ms 15340 KB Output is correct
8 Correct 98 ms 15372 KB Output is correct
9 Correct 96 ms 15388 KB Output is correct
10 Correct 120 ms 15536 KB Output is correct
11 Correct 96 ms 15232 KB Output is correct
12 Correct 100 ms 16084 KB Output is correct
13 Correct 97 ms 15776 KB Output is correct
14 Correct 96 ms 14756 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6232 KB Output is correct
2 Correct 17 ms 7732 KB Output is correct
3 Correct 25 ms 7724 KB Output is correct
4 Correct 74 ms 17332 KB Output is correct
5 Correct 85 ms 17396 KB Output is correct
6 Correct 74 ms 18484 KB Output is correct
7 Correct 73 ms 13684 KB Output is correct
8 Correct 77 ms 17844 KB Output is correct
9 Correct 73 ms 15048 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4696 KB Output is correct
2 Correct 15 ms 5720 KB Output is correct
3 Correct 77 ms 13360 KB Output is correct
4 Correct 109 ms 15524 KB Output is correct
5 Correct 103 ms 15472 KB Output is correct
6 Correct 105 ms 15536 KB Output is correct
7 Correct 95 ms 15476 KB Output is correct
8 Correct 109 ms 15472 KB Output is correct
9 Correct 109 ms 15576 KB Output is correct
10 Correct 100 ms 15524 KB Output is correct
11 Correct 107 ms 15412 KB Output is correct
12 Correct 101 ms 15452 KB Output is correct
13 Correct 116 ms 15088 KB Output is correct
14 Correct 98 ms 16140 KB Output is correct
15 Correct 85 ms 15532 KB Output is correct
16 Correct 105 ms 15544 KB Output is correct
17 Correct 101 ms 14852 KB Output is correct
18 Correct 94 ms 16172 KB Output is correct
19 Correct 102 ms 15532 KB Output is correct
20 Correct 99 ms 16488 KB Output is correct
21 Correct 95 ms 16472 KB Output is correct
22 Correct 106 ms 16572 KB Output is correct
23 Correct 95 ms 15600 KB Output is correct
24 Correct 91 ms 15680 KB Output is correct
25 Correct 130 ms 18760 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 5796 KB Output is correct
2 Correct 14 ms 5976 KB Output is correct
3 Correct 123 ms 15768 KB Output is correct
4 Correct 135 ms 15676 KB Output is correct
5 Correct 165 ms 17004 KB Output is correct
6 Correct 163 ms 16600 KB Output is correct
7 Correct 173 ms 16848 KB Output is correct
8 Correct 154 ms 16868 KB Output is correct
9 Correct 103 ms 11836 KB Output is correct
10 Correct 108 ms 12008 KB Output is correct
11 Correct 112 ms 13560 KB Output is correct
12 Correct 154 ms 15204 KB Output is correct
13 Correct 141 ms 16364 KB Output is correct
14 Correct 183 ms 16404 KB Output is correct
15 Correct 163 ms 16752 KB Output is correct
16 Correct 127 ms 13616 KB Output is correct
17 Correct 92 ms 16264 KB Output is correct
18 Correct 99 ms 16480 KB Output is correct
19 Correct 102 ms 16232 KB Output is correct
20 Execution timed out 3067 ms 16520 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5976 KB Output is correct
2 Correct 17 ms 5840 KB Output is correct
3 Partially correct 125 ms 15404 KB Output is partially correct
4 Correct 139 ms 15996 KB Output is correct
5 Partially correct 136 ms 15796 KB Output is partially correct
6 Partially correct 155 ms 16456 KB Output is partially correct
7 Correct 134 ms 15840 KB Output is correct
8 Correct 126 ms 15908 KB Output is correct
9 Correct 135 ms 16208 KB Output is correct
10 Partially correct 159 ms 16372 KB Output is partially correct
11 Correct 155 ms 16428 KB Output is correct
12 Correct 147 ms 16468 KB Output is correct
13 Correct 139 ms 13024 KB Output is correct
14 Correct 103 ms 12016 KB Output is correct
15 Correct 121 ms 13700 KB Output is correct
16 Correct 103 ms 12036 KB Output is correct
17 Correct 115 ms 13516 KB Output is correct
18 Correct 99 ms 12364 KB Output is correct
19 Correct 160 ms 15172 KB Output is correct
20 Correct 171 ms 15764 KB Output is correct
21 Partially correct 174 ms 16228 KB Output is partially correct
22 Correct 167 ms 16248 KB Output is correct
23 Correct 149 ms 16764 KB Output is correct
24 Correct 181 ms 16284 KB Output is correct
25 Correct 163 ms 16684 KB Output is correct
26 Correct 147 ms 16716 KB Output is correct
27 Correct 109 ms 16372 KB Output is correct
28 Correct 96 ms 16264 KB Output is correct
29 Correct 105 ms 16620 KB Output is correct
30 Correct 127 ms 16280 KB Output is correct
31 Correct 117 ms 16384 KB Output is correct
32 Execution timed out 3092 ms 16260 KB Time limit exceeded
33 Halted 0 ms 0 KB -