oj.uz

Submission #933908

# Submission time Handle Problem Language Result Execution time Memory
933908 2024-02-26T14:50:40 Z kim Highway Tolls (IOI18_highway) C++17
90 / 100
 207 ms 12960 KB 
#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
#define eb emplace_back
using ll=long long;
using pii=pair<int,int>;
#define f first
#define s second

int n,m;
pii edge[130005];
vector<pii> graph[90005];
vector<int> tmp,ans;
ll mn_ask,dist;
bitset<90005> vis;
int tour[90005];

int solve1(int U){
    int id=0;
    queue<int> q;
    q.emplace(U);
    vis=0;
    vis[U]=1;
    tour[U]=0;
    while(q.size()){
        int u=q.front(); q.pop();
        for(auto &[v,i]:graph[u]){
            if(vis[v]) continue;
            vis[v]=1;
            q.emplace(v);
            tour[v]=++id;
        }
    }
    int l=1,r=id;
    while(l<r){
        int mid=l+r>>1;
        for(int i=0;i<m;++i){
            auto &[u,v]=edge[i];
            if(tour[u]<=mid&&tour[v]<=mid) tmp[i]=0;
            else tmp[i]=1;
        }
        if(ask(tmp)==mn_ask) r=mid;
        else l=mid+1;
    }
    for(int i=0;i<n;++i){
        if(tour[i]==l){
            ans.eb(i);
            return i;
        }
    }
}
int solve2(int U){
    int id=0;
    queue<int> q;
    q.emplace(U);
    vis=0;
    vis[U]=1;
    tour[U]=0;
    while(q.size()){
        int u=q.front(); q.pop();
        for(auto &[v,i]:graph[u]){
            if(vis[v]) continue;
            vis[v]=1;
            q.emplace(v);
            tour[v]=++id;
        }
    }
    int l=1,r=id;
    while(l<r){
        int mid=l+r>>1;
        for(int i=0;i<m;++i){
            auto &[u,v]=edge[i];
            if(tour[u]<=mid&&tour[v]<=mid) tmp[i]=0;
            else tmp[i]=1;
        }
        if(ask(tmp)==mn_ask) r=mid;
        else l=mid+1;
    }
    for(int i=0;i<n;++i){
        if(tour[i]==l){
            ans.eb(i);
            return i;
        }
    }
}
void solve3(int U){
    queue<pii> q;
    q.emplace(U,0);
    vis=0;
    vis[U]=1;
    vector<int> tmp2(tmp.size(),1);
    vector<pii> vec;
    while(q.size()){
        auto [u,d]=q.front(); q.pop();
        for(auto &[v,id]:graph[u]){
            if(vis[v]) continue;
            if(d+1<dist) q.emplace(v,d+1), tmp2[id]=0;
            else if(d+1==dist) vec.eb(v,id);
            vis[v]=1;
        }
    }
    int l=0,r=vec.size();
    while(l<r){
        int mid=l+r>>1;
        tmp=tmp2;
        for(int i=0;i<=mid;++i) tmp[vec[i].s]=0;
        if(ask(tmp)==mn_ask) r=mid;
        else l=mid+1;
    }
    ans.eb(vec[l].f);
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
    n=N,m=U.size();
    for(int i=0;i<m;++i){
        edge[i]={U[i],V[i]};
        graph[U[i]].eb(V[i],i);
        graph[V[i]].eb(U[i],i);
    }
    tmp.assign(m,0);
    mn_ask=ask(tmp), dist=mn_ask/A;
    solve3(solve2(solve1(0)));
    answer(ans[1],ans[2]);
}
/*
15 15  99 100  9 10
0 1
1 3
3 5
5 7
7 9
9 11
11 13
13 14
14 12
12 10
10 8
8 6
6 4
4 2
2 0
*/

Compilation message

highway.cpp: In function 'int solve1(int)':
highway.cpp:36:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |         int mid=l+r>>1;
      |                 ~^~
highway.cpp: In function 'int solve2(int)':
highway.cpp:70:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |         int mid=l+r>>1;
      |                 ~^~
highway.cpp: In function 'void solve3(int)':
highway.cpp:104:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  104 |         int mid=l+r>>1;
      |                 ~^~
highway.cpp: In function 'int solve1(int)':
highway.cpp:20:16: warning: control reaches end of non-void function [-Wreturn-type]
   20 |     queue<int> q;
      |                ^
highway.cpp: In function 'int solve2(int)':
highway.cpp:54:16: warning: control reaches end of non-void function [-Wreturn-type]
   54 |     queue<int> q;
      |                ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2752 KB Output is correct
3 Correct 1 ms 2752 KB Output is correct
4 Correct 1 ms 2760 KB Output is correct
5 Correct 1 ms 2752 KB Output is correct
6 Correct 1 ms 2752 KB Output is correct
7 Correct 1 ms 2756 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 1 ms 2756 KB Output is correct
10 Correct 1 ms 2752 KB Output is correct
11 Correct 1 ms 2756 KB Output is correct
12 Correct 1 ms 2924 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2812 KB Output is correct
2 Correct 14 ms 3452 KB Output is correct
3 Correct 148 ms 10276 KB Output is correct
4 Correct 137 ms 10264 KB Output is correct
5 Correct 116 ms 9880 KB Output is correct
6 Correct 91 ms 9240 KB Output is correct
7 Correct 115 ms 9972 KB Output is correct
8 Correct 111 ms 10348 KB Output is correct
9 Correct 107 ms 9632 KB Output is correct
10 Correct 136 ms 10100 KB Output is correct
11 Correct 112 ms 9024 KB Output is correct
12 Correct 113 ms 8796 KB Output is correct
13 Correct 112 ms 9024 KB Output is correct
14 Correct 106 ms 9032 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3464 KB Output is correct
2 Correct 16 ms 4008 KB Output is correct
3 Correct 26 ms 4980 KB Output is correct
4 Correct 69 ms 8784 KB Output is correct
5 Correct 67 ms 8560 KB Output is correct
6 Correct 72 ms 8560 KB Output is correct
7 Correct 71 ms 8552 KB Output is correct
8 Correct 65 ms 8556 KB Output is correct
9 Correct 59 ms 8568 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2820 KB Output is correct
2 Correct 15 ms 3536 KB Output is correct
3 Correct 69 ms 8024 KB Output is correct
4 Correct 98 ms 9712 KB Output is correct
5 Correct 87 ms 9144 KB Output is correct
6 Correct 81 ms 9624 KB Output is correct
7 Correct 99 ms 9408 KB Output is correct
8 Correct 92 ms 9516 KB Output is correct
9 Correct 129 ms 9940 KB Output is correct
10 Correct 121 ms 9632 KB Output is correct
11 Correct 98 ms 9172 KB Output is correct
12 Correct 145 ms 8692 KB Output is correct
13 Correct 141 ms 8560 KB Output is correct
14 Correct 117 ms 8784 KB Output is correct
15 Correct 125 ms 9156 KB Output is correct
16 Correct 93 ms 9396 KB Output is correct
17 Correct 106 ms 9004 KB Output is correct
18 Correct 103 ms 8676 KB Output is correct
19 Correct 137 ms 9180 KB Output is correct
20 Correct 98 ms 9016 KB Output is correct
21 Correct 88 ms 10568 KB Output is correct
22 Correct 121 ms 10568 KB Output is correct
23 Correct 118 ms 10468 KB Output is correct
24 Correct 125 ms 10736 KB Output is correct
25 Correct 96 ms 8780 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3564 KB Output is correct
2 Correct 16 ms 3632 KB Output is correct
3 Correct 157 ms 10520 KB Output is correct
4 Correct 175 ms 11012 KB Output is correct
5 Correct 170 ms 12960 KB Output is correct
6 Correct 180 ms 12504 KB Output is correct
7 Correct 168 ms 12276 KB Output is correct
8 Correct 152 ms 12496 KB Output is correct
9 Correct 122 ms 10608 KB Output is correct
10 Correct 193 ms 11344 KB Output is correct
11 Correct 180 ms 11972 KB Output is correct
12 Correct 184 ms 11872 KB Output is correct
13 Correct 150 ms 12392 KB Output is correct
14 Correct 181 ms 12280 KB Output is correct
15 Correct 165 ms 12196 KB Output is correct
16 Correct 151 ms 11820 KB Output is correct
17 Correct 129 ms 10312 KB Output is correct
18 Correct 118 ms 10764 KB Output is correct
19 Correct 102 ms 10380 KB Output is correct
20 Correct 116 ms 10784 KB Output is correct
21 Correct 130 ms 11380 KB Output is correct

Subtask #6
21.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3696 KB Output is correct
2 Correct 13 ms 3616 KB Output is correct
3 Correct 136 ms 10252 KB Output is correct
4 Correct 149 ms 10976 KB Output is correct
5 Correct 131 ms 10668 KB Output is correct
6 Correct 175 ms 12476 KB Output is correct
7 Correct 117 ms 9868 KB Output is correct
8 Correct 123 ms 10548 KB Output is correct
9 Correct 134 ms 10560 KB Output is correct
10 Correct 141 ms 12440 KB Output is correct
11 Correct 163 ms 12184 KB Output is correct
12 Correct 153 ms 12672 KB Output is correct
13 Correct 167 ms 11236 KB Output is correct
14 Correct 143 ms 10960 KB Output is correct
15 Correct 135 ms 11516 KB Output is correct
16 Correct 167 ms 10760 KB Output is correct
17 Correct 120 ms 11300 KB Output is correct
18 Correct 136 ms 11712 KB Output is correct
19 Correct 159 ms 12248 KB Output is correct
20 Correct 145 ms 11712 KB Output is correct
21 Correct 166 ms 12244 KB Output is correct
22 Correct 155 ms 12176 KB Output is correct
23 Correct 182 ms 12348 KB Output is correct
24 Correct 163 ms 12728 KB Output is correct
25 Correct 198 ms 12444 KB Output is correct
26 Correct 173 ms 12420 KB Output is correct
27 Correct 140 ms 10652 KB Output is correct
28 Correct 124 ms 10428 KB Output is correct
29 Partially correct 96 ms 11528 KB Output is partially correct
30 Partially correct 103 ms 10524 KB Output is partially correct
31 Partially correct 136 ms 11288 KB Output is partially correct
32 Partially correct 90 ms 10868 KB Output is partially correct
33 Correct 101 ms 11104 KB Output is correct
34 Correct 98 ms 10660 KB Output is correct
35 Partially correct 98 ms 10968 KB Output is partially correct
36 Correct 123 ms 11004 KB Output is correct
37 Correct 126 ms 10816 KB Output is correct
38 Partially correct 129 ms 11120 KB Output is partially correct
39 Correct 170 ms 12072 KB Output is correct
40 Correct 207 ms 11840 KB Output is correct
41 Correct 131 ms 11600 KB Output is correct
42 Correct 191 ms 12044 KB Output is correct