oj.uz

답안 #1099189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099189 2024-10-10T17:13:08 Z MMihalev 통행료 (IOI18_highway) C++14
51 / 100
 196 ms 18952 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>60)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 4692 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 4696 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 2 ms 4696 KB Output is correct
10 Correct 3 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 11 ms 5756 KB Output is correct
3 Correct 100 ms 15536 KB Output is correct
4 Correct 104 ms 15472 KB Output is correct
5 Correct 106 ms 15368 KB Output is correct
6 Correct 96 ms 15552 KB Output is correct
7 Correct 94 ms 15480 KB Output is correct
8 Correct 98 ms 15380 KB Output is correct
9 Correct 91 ms 15472 KB Output is correct
10 Correct 105 ms 15548 KB Output is correct
11 Correct 86 ms 15224 KB Output is correct
12 Correct 91 ms 15940 KB Output is correct
13 Correct 102 ms 15740 KB Output is correct
14 Correct 96 ms 14748 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 6232 KB Output is correct
2 Correct 18 ms 7768 KB Output is correct
3 Correct 27 ms 7708 KB Output is correct
4 Correct 77 ms 17280 KB Output is correct
5 Correct 75 ms 17264 KB Output is correct
6 Correct 77 ms 18480 KB Output is correct
7 Correct 68 ms 13536 KB Output is correct
8 Correct 68 ms 17704 KB Output is correct
9 Correct 70 ms 14984 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 15 ms 5860 KB Output is correct
3 Correct 88 ms 13376 KB Output is correct
4 Correct 100 ms 15532 KB Output is correct
5 Correct 98 ms 15476 KB Output is correct
6 Correct 102 ms 15508 KB Output is correct
7 Correct 99 ms 15388 KB Output is correct
8 Correct 96 ms 15360 KB Output is correct
9 Correct 110 ms 15508 KB Output is correct
10 Correct 97 ms 15488 KB Output is correct
11 Correct 95 ms 15204 KB Output is correct
12 Correct 99 ms 15468 KB Output is correct
13 Correct 98 ms 15108 KB Output is correct
14 Correct 106 ms 16192 KB Output is correct
15 Correct 98 ms 15484 KB Output is correct
16 Correct 106 ms 15416 KB Output is correct
17 Correct 106 ms 14856 KB Output is correct
18 Correct 100 ms 16216 KB Output is correct
19 Correct 101 ms 15540 KB Output is correct
20 Correct 115 ms 16520 KB Output is correct
21 Correct 103 ms 16484 KB Output is correct
22 Correct 114 ms 16564 KB Output is correct
23 Correct 95 ms 15608 KB Output is correct
24 Correct 95 ms 15748 KB Output is correct
25 Correct 108 ms 18952 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 5976 KB Output is correct
2 Correct 14 ms 5976 KB Output is correct
3 Correct 119 ms 15880 KB Output is correct
4 Correct 141 ms 15636 KB Output is correct
5 Correct 166 ms 16892 KB Output is correct
6 Correct 187 ms 16492 KB Output is correct
7 Correct 152 ms 16896 KB Output is correct
8 Correct 158 ms 16952 KB Output is correct
9 Correct 108 ms 11964 KB Output is correct
10 Correct 107 ms 12020 KB Output is correct
11 Correct 119 ms 13720 KB Output is correct
12 Correct 187 ms 15248 KB Output is correct
13 Correct 140 ms 16228 KB Output is correct
14 Correct 168 ms 16312 KB Output is correct
15 Correct 155 ms 16644 KB Output is correct
16 Correct 130 ms 13456 KB Output is correct
17 Correct 99 ms 16256 KB Output is correct
18 Correct 101 ms 16508 KB Output is correct
19 Correct 107 ms 16240 KB Output is correct
20 Incorrect 105 ms 16512 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 5792 KB Output is correct
2 Correct 17 ms 5976 KB Output is correct
3 Partially correct 124 ms 15392 KB Output is partially correct
4 Correct 125 ms 15988 KB Output is correct
5 Partially correct 132 ms 15576 KB Output is partially correct
6 Partially correct 159 ms 16876 KB Output is partially correct
7 Correct 132 ms 15672 KB Output is correct
8 Correct 117 ms 15908 KB Output is correct
9 Correct 120 ms 16184 KB Output is correct
10 Partially correct 150 ms 16372 KB Output is partially correct
11 Correct 152 ms 16380 KB Output is correct
12 Correct 150 ms 16476 KB Output is correct
13 Correct 116 ms 13000 KB Output is correct
14 Correct 122 ms 12016 KB Output is correct
15 Correct 117 ms 13672 KB Output is correct
16 Correct 113 ms 12004 KB Output is correct
17 Correct 124 ms 13520 KB Output is correct
18 Correct 110 ms 12356 KB Output is correct
19 Correct 157 ms 15124 KB Output is correct
20 Correct 153 ms 15760 KB Output is correct
21 Partially correct 184 ms 16216 KB Output is partially correct
22 Correct 169 ms 16244 KB Output is correct
23 Correct 163 ms 16720 KB Output is correct
24 Correct 153 ms 16300 KB Output is correct
25 Correct 196 ms 16560 KB Output is correct
26 Correct 153 ms 16700 KB Output is correct
27 Correct 102 ms 16352 KB Output is correct
28 Correct 96 ms 16240 KB Output is correct
29 Correct 107 ms 16484 KB Output is correct
30 Correct 109 ms 16460 KB Output is correct
31 Correct 99 ms 16324 KB Output is correct
32 Incorrect 123 ms 16292 KB Output isn't correct
33 Halted 0 ms 0 KB -