oj.uz

Submission #871967

# Submission time Handle Problem Language Result Execution time Memory
871967 2023-11-12T05:01:09 Z 8pete8 Evacuation plan (IZhO18_plan) C++14
100 / 100
 858 ms 51580 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,pii>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mxn=1e5,inf=1e18;
int n,m,dist[mxn+10],mx=0,pa[mxn+10],sz[mxn+10];
bitset<mxn+10>on;
vector<pii>adj[mxn+10],e;
int find(int u){return ((u==pa[u])?u:pa[u]=find(pa[u]));}
void merg(int a,int b){
    a=find(a),b=find(b);
    if(a==b)return;
    if(sz[a]>=sz[b]){
        pa[b]=a;
        sz[a]+=sz[b];
        return;
    }
    pa[a]=b;
    sz[b]+=sz[a];
}
int32_t main(){
    fastio
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        adj[a].pb({b,c});
        adj[b].pb({a,c});
    }
    fill(dist,dist+mxn+5,inf);
    int c;cin>>c;
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    for(int i=0;i<c;i++){
        int a;cin>>a;
        pq.push({0,a});
        dist[a]=0;
    }
    while(!pq.empty()){
        int cur=pq.top().s;
        pq.pop();
        for(auto i:adj[cur]){
            if(dist[i.f]>dist[cur]+i.s){
                dist[i.f]=dist[cur]+i.s;
                pq.push({dist[i.f],i.f});
            }
        }
    }
    for(int i=1;i<=n;i++)e.pb({dist[i],i});
    sort(rall(e));
    int q;cin>>q;
    vector<pii>qry(q),b(q);
    vector<int>ans(q,inf);
    for(int i=0;i<q;i++){
        cin>>qry[i].f>>qry[i].s;
        b[i].f=0,b[i].s=n-1;
    }
    bool yes=true;
    int cnt=0;
    while(yes){
        cnt++;
        vector<pii>mid(q,{inf,inf});
        yes=false;
        for(int i=1;i<=n;i++)pa[i]=i,on[i]=false,sz[i]=1;
        for(int i=0;i<q;i++)if(b[i].f<=b[i].s)mid[i].f=(b[i].s+b[i].f)/2,mid[i].s=i,yes=true;
        sort(all(mid));
        int cur=0;
        for(int i=0;i<q;i++){
            if(mid[i].f==inf)continue;
            while(cur<=mid[i].f){
                on[e[cur].s]=true;
                for(auto i:adj[e[cur].s])if(on[i.f])merg(i.f,e[cur].s);
                cur++;
            }
            if(find(qry[mid[i].s].f)==find(qry[mid[i].s].s))b[mid[i].s].s=mid[i].f-1,ans[mid[i].s]=min(ans[mid[i].s],mid[i].f);
            else b[mid[i].s].f=mid[i].f+1;
        }
    }
    for(auto i:ans)cout<<e[i].f<<'\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5332 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 5336 KB Output is correct
6 Correct 2 ms 5212 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 3 ms 5208 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5332 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 5336 KB Output is correct
6 Correct 2 ms 5212 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 3 ms 5208 KB Output is correct
16 Correct 353 ms 20740 KB Output is correct
17 Correct 858 ms 49956 KB Output is correct
18 Correct 40 ms 9044 KB Output is correct
19 Correct 156 ms 21616 KB Output is correct
20 Correct 824 ms 49864 KB Output is correct
21 Correct 466 ms 29044 KB Output is correct
22 Correct 250 ms 20644 KB Output is correct
23 Correct 827 ms 49964 KB Output is correct
24 Correct 826 ms 50160 KB Output is correct
25 Correct 825 ms 49960 KB Output is correct
26 Correct 210 ms 21408 KB Output is correct
27 Correct 175 ms 21664 KB Output is correct
28 Correct 200 ms 21524 KB Output is correct
29 Correct 162 ms 21768 KB Output is correct
30 Correct 140 ms 21744 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4992 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 22532 KB Output is correct
2 Correct 452 ms 44224 KB Output is correct
3 Correct 464 ms 44276 KB Output is correct
4 Correct 58 ms 13512 KB Output is correct
5 Correct 560 ms 44232 KB Output is correct
6 Correct 343 ms 44256 KB Output is correct
7 Correct 370 ms 44476 KB Output is correct
8 Correct 314 ms 44256 KB Output is correct
9 Correct 325 ms 44568 KB Output is correct
10 Correct 515 ms 44260 KB Output is correct
11 Correct 566 ms 44480 KB Output is correct
12 Correct 515 ms 44232 KB Output is correct
13 Correct 535 ms 44224 KB Output is correct
14 Correct 352 ms 44228 KB Output is correct
15 Correct 530 ms 46780 KB Output is correct
16 Correct 475 ms 44284 KB Output is correct
17 Correct 334 ms 44260 KB Output is correct
18 Correct 326 ms 44168 KB Output is correct
19 Correct 43 ms 13512 KB Output is correct
20 Correct 464 ms 44164 KB Output is correct
21 Correct 283 ms 44148 KB Output is correct
22 Correct 65 ms 15944 KB Output is correct
23 Correct 86 ms 14020 KB Output is correct
24 Correct 67 ms 15940 KB Output is correct
25 Correct 65 ms 15952 KB Output is correct
26 Correct 96 ms 14092 KB Output is correct
27 Correct 67 ms 13492 KB Output is correct
28 Correct 66 ms 15940 KB Output is correct
29 Correct 59 ms 13644 KB Output is correct
30 Correct 64 ms 15936 KB Output is correct
31 Correct 62 ms 13512 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5332 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 5336 KB Output is correct
6 Correct 2 ms 5212 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 3 ms 5208 KB Output is correct
16 Correct 353 ms 20740 KB Output is correct
17 Correct 858 ms 49956 KB Output is correct
18 Correct 40 ms 9044 KB Output is correct
19 Correct 156 ms 21616 KB Output is correct
20 Correct 824 ms 49864 KB Output is correct
21 Correct 466 ms 29044 KB Output is correct
22 Correct 250 ms 20644 KB Output is correct
23 Correct 827 ms 49964 KB Output is correct
24 Correct 826 ms 50160 KB Output is correct
25 Correct 825 ms 49960 KB Output is correct
26 Correct 210 ms 21408 KB Output is correct
27 Correct 175 ms 21664 KB Output is correct
28 Correct 200 ms 21524 KB Output is correct
29 Correct 162 ms 21768 KB Output is correct
30 Correct 140 ms 21744 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4992 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 1 ms 4956 KB Output is correct
41 Correct 179 ms 22532 KB Output is correct
42 Correct 452 ms 44224 KB Output is correct
43 Correct 464 ms 44276 KB Output is correct
44 Correct 58 ms 13512 KB Output is correct
45 Correct 560 ms 44232 KB Output is correct
46 Correct 343 ms 44256 KB Output is correct
47 Correct 370 ms 44476 KB Output is correct
48 Correct 314 ms 44256 KB Output is correct
49 Correct 325 ms 44568 KB Output is correct
50 Correct 515 ms 44260 KB Output is correct
51 Correct 566 ms 44480 KB Output is correct
52 Correct 515 ms 44232 KB Output is correct
53 Correct 535 ms 44224 KB Output is correct
54 Correct 352 ms 44228 KB Output is correct
55 Correct 530 ms 46780 KB Output is correct
56 Correct 475 ms 44284 KB Output is correct
57 Correct 334 ms 44260 KB Output is correct
58 Correct 326 ms 44168 KB Output is correct
59 Correct 43 ms 13512 KB Output is correct
60 Correct 464 ms 44164 KB Output is correct
61 Correct 283 ms 44148 KB Output is correct
62 Correct 65 ms 15944 KB Output is correct
63 Correct 86 ms 14020 KB Output is correct
64 Correct 67 ms 15940 KB Output is correct
65 Correct 65 ms 15952 KB Output is correct
66 Correct 96 ms 14092 KB Output is correct
67 Correct 67 ms 13492 KB Output is correct
68 Correct 66 ms 15940 KB Output is correct
69 Correct 59 ms 13644 KB Output is correct
70 Correct 64 ms 15936 KB Output is correct
71 Correct 62 ms 13512 KB Output is correct
72 Correct 484 ms 28768 KB Output is correct
73 Correct 812 ms 49856 KB Output is correct
74 Correct 807 ms 49876 KB Output is correct
75 Correct 815 ms 49964 KB Output is correct
76 Correct 830 ms 49868 KB Output is correct
77 Correct 839 ms 49920 KB Output is correct
78 Correct 832 ms 49812 KB Output is correct
79 Correct 824 ms 49928 KB Output is correct
80 Correct 829 ms 49960 KB Output is correct
81 Correct 844 ms 49952 KB Output is correct
82 Correct 816 ms 50108 KB Output is correct
83 Correct 831 ms 49900 KB Output is correct
84 Correct 824 ms 49948 KB Output is correct
85 Correct 823 ms 51580 KB Output is correct
86 Correct 828 ms 49960 KB Output is correct
87 Correct 815 ms 49972 KB Output is correct
88 Correct 839 ms 50060 KB Output is correct
89 Correct 254 ms 20564 KB Output is correct
90 Correct 819 ms 50068 KB Output is correct
91 Correct 717 ms 49704 KB Output is correct
92 Correct 161 ms 21624 KB Output is correct
93 Correct 310 ms 20716 KB Output is correct
94 Correct 191 ms 21408 KB Output is correct
95 Correct 159 ms 21624 KB Output is correct
96 Correct 291 ms 20292 KB Output is correct
97 Correct 244 ms 20304 KB Output is correct
98 Correct 172 ms 21408 KB Output is correct
99 Correct 237 ms 20388 KB Output is correct
100 Correct 192 ms 22692 KB Output is correct