oj.uz

답안 #1099183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099183 2024-10-10T17:08:15 Z MMihalev 통행료 (IOI18_highway) C++14
51 / 100
 1500 ms 18772 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>52)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 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 2 ms 4696 KB Output is correct
4 Correct 2 ms 4452 KB Output is correct
5 Correct 2 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 3 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 4620 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 11 ms 5976 KB Output is correct
3 Correct 114 ms 15456 KB Output is correct
4 Correct 106 ms 15484 KB Output is correct
5 Correct 110 ms 15628 KB Output is correct
6 Correct 104 ms 15552 KB Output is correct
7 Correct 103 ms 15480 KB Output is correct
8 Correct 101 ms 15392 KB Output is correct
9 Correct 88 ms 15472 KB Output is correct
10 Correct 100 ms 15404 KB Output is correct
11 Correct 85 ms 15132 KB Output is correct
12 Correct 95 ms 16084 KB Output is correct
13 Correct 91 ms 15712 KB Output is correct
14 Correct 91 ms 14716 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6232 KB Output is correct
2 Correct 20 ms 7640 KB Output is correct
3 Correct 24 ms 7716 KB Output is correct
4 Correct 75 ms 17284 KB Output is correct
5 Correct 79 ms 17208 KB Output is correct
6 Correct 74 ms 18520 KB Output is correct
7 Correct 72 ms 13580 KB Output is correct
8 Correct 75 ms 17968 KB Output is correct
9 Correct 89 ms 15000 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 13 ms 5720 KB Output is correct
3 Correct 75 ms 13340 KB Output is correct
4 Correct 109 ms 15620 KB Output is correct
5 Correct 118 ms 15308 KB Output is correct
6 Correct 103 ms 15356 KB Output is correct
7 Correct 102 ms 15708 KB Output is correct
8 Correct 98 ms 15516 KB Output is correct
9 Correct 102 ms 15536 KB Output is correct
10 Correct 104 ms 15340 KB Output is correct
11 Correct 98 ms 15364 KB Output is correct
12 Correct 98 ms 15492 KB Output is correct
13 Correct 92 ms 14964 KB Output is correct
14 Correct 102 ms 16232 KB Output is correct
15 Correct 88 ms 15544 KB Output is correct
16 Correct 114 ms 15504 KB Output is correct
17 Correct 99 ms 14848 KB Output is correct
18 Correct 97 ms 16032 KB Output is correct
19 Correct 112 ms 15316 KB Output is correct
20 Correct 92 ms 16488 KB Output is correct
21 Correct 98 ms 16436 KB Output is correct
22 Correct 110 ms 16596 KB Output is correct
23 Correct 82 ms 15604 KB Output is correct
24 Correct 89 ms 15908 KB Output is correct
25 Correct 100 ms 18772 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5976 KB Output is correct
2 Correct 16 ms 5976 KB Output is correct
3 Correct 112 ms 15828 KB Output is correct
4 Correct 144 ms 15652 KB Output is correct
5 Correct 155 ms 16888 KB Output is correct
6 Correct 166 ms 16572 KB Output is correct
7 Correct 152 ms 16984 KB Output is correct
8 Correct 151 ms 16960 KB Output is correct
9 Correct 109 ms 11852 KB Output is correct
10 Correct 106 ms 12012 KB Output is correct
11 Correct 123 ms 13500 KB Output is correct
12 Correct 160 ms 15340 KB Output is correct
13 Correct 141 ms 16432 KB Output is correct
14 Correct 170 ms 16232 KB Output is correct
15 Correct 171 ms 16724 KB Output is correct
16 Correct 139 ms 13324 KB Output is correct
17 Correct 105 ms 16280 KB Output is correct
18 Correct 110 ms 16432 KB Output is correct
19 Correct 127 ms 16256 KB Output is correct
20 Execution timed out 3070 ms 16352 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5792 KB Output is correct
2 Correct 14 ms 5828 KB Output is correct
3 Partially correct 132 ms 15404 KB Output is partially correct
4 Correct 133 ms 15892 KB Output is correct
5 Partially correct 160 ms 15772 KB Output is partially correct
6 Partially correct 168 ms 16452 KB Output is partially correct
7 Correct 117 ms 15744 KB Output is correct
8 Correct 116 ms 16028 KB Output is correct
9 Correct 119 ms 16024 KB Output is correct
10 Partially correct 136 ms 16368 KB Output is partially correct
11 Correct 148 ms 16384 KB Output is correct
12 Correct 173 ms 16464 KB Output is correct
13 Correct 112 ms 13000 KB Output is correct
14 Correct 128 ms 12020 KB Output is correct
15 Correct 138 ms 13516 KB Output is correct
16 Correct 113 ms 12012 KB Output is correct
17 Correct 137 ms 13508 KB Output is correct
18 Correct 105 ms 12364 KB Output is correct
19 Correct 155 ms 15300 KB Output is correct
20 Correct 175 ms 15996 KB Output is correct
21 Partially correct 186 ms 16320 KB Output is partially correct
22 Correct 160 ms 16236 KB Output is correct
23 Correct 152 ms 16736 KB Output is correct
24 Correct 157 ms 16280 KB Output is correct
25 Correct 163 ms 16744 KB Output is correct
26 Correct 162 ms 16624 KB Output is correct
27 Correct 100 ms 16388 KB Output is correct
28 Correct 105 ms 16344 KB Output is correct
29 Correct 119 ms 16504 KB Output is correct
30 Correct 134 ms 16380 KB Output is correct
31 Correct 97 ms 16368 KB Output is correct
32 Execution timed out 3014 ms 16100 KB Time limit exceeded
33 Halted 0 ms 0 KB -