oj.uz

Submission #893548

# Submission time Handle Problem Language Result Execution time Memory
893548 2023-12-27T06:45:57 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
54 / 100
 4000 ms 119172 KB 
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ff first
#define ss second
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define pllll pair<pll,pll>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define sz size()
#define fr front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
using namespace std;
const ld pi=3.14159265359;
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll N=1e5+5;
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;if(y==1)return x%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;if(y==1)return x;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
struct query{
    ll a,b,i;
};
vll g[N];
pll pd[N];
ll d[N],p[N],siz[N],ans[N];
vector<query> v;
ll get(ll x){
    if(x!=p[x]) p[x]=get(p[x]);
    return p[x];
}
void uni(ll a,ll b){
    a=get(a), b=get(b);
    if(a==b) return;
    if(siz[a]<siz[b]) swap(a,b);
    siz[a]+=siz[b];
    p[b]=a;
}
void solve(){
    ll n,m,k,q;
    cin>>n>>m;
    map<pll,bool> mp;
    for(ll i=1;i<=n;i++) d[i]=inf, p[i]=i, siz[i]=1;
    for(ll i=1;i<=m;i++){
        ll a,b,w; cin>>a>>b>>w;
        g[a].pb({b,w});
        g[b].pb({a,w});
        mp[{a,b}]=mp[{b,a}]=1;
    }
    cin>>k;
    queue<pll> qu;
    for(ll i=1;i<=k;i++){
        ll x; cin>>x;
        qu.push({x,0});
    }
    while(!qu.empty()){
        ll v=qu.fr.F, s=qu.fr.S;
        qu.pop();
        if(d[v]<=s) continue;
        d[v]=s;
        for(auto [to,w]:g[v]){
            if(d[to]>s+w) qu.push({to,s+w});
        }
    }
    cin>>q;
    for(ll i=1;i<=q;i++){
        ll a,b; cin>>a>>b;
        if(mp[{a,b}]) ans[i]=min(d[a],d[b]);
        else v.pb({a,b,i});
    }
    for(ll i=1;i<=n;i++) pd[i]={d[i],i};
    sort(pd+1,pd+n+1);
    reverse(pd+1,pd+n+1);
    for(ll i=1;i<=n;i++){
        for(auto [to,w]:g[pd[i].S]){
            if(d[to]>=pd[i].F) uni(pd[i].S,to);
        }
        for(ll j=0;j<v.sz;j++){
            if(v[j].i!=0&&get(v[j].a)==get(v[j].b)){
                ans[v[j].i]=pd[i].F;
                v[j].i=0;
            }
        }
    }
    for(ll i=1;i<=q;i++) cout<<ans[i]<<'\n';
    return;
}
int main(/*Aldk*/){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);    
    //cout<<setprecision(6)<<fixed;
    ll T=1;
    //cin>>T;
    for(ll i=1;i<=T;i++){
        //cout<<"Case "<<i<<": ";
        solve();
        //cout<<'\n';
    }
    return 0;
}

Compilation message

plan.cpp: In function 'void solve()':
plan.cpp:94:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(ll j=0;j<v.sz;j++){
      |                     ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7512 KB Output is correct
4 Correct 1 ms 7260 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 2 ms 7516 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 2 ms 7512 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7512 KB Output is correct
4 Correct 1 ms 7260 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 2 ms 7516 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 2 ms 7512 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 197 ms 27544 KB Output is correct
17 Correct 1526 ms 116392 KB Output is correct
18 Correct 44 ms 16208 KB Output is correct
19 Correct 180 ms 29632 KB Output is correct
20 Correct 1483 ms 119172 KB Output is correct
21 Correct 463 ms 51372 KB Output is correct
22 Correct 192 ms 28368 KB Output is correct
23 Correct 1435 ms 114588 KB Output is correct
24 Correct 1404 ms 115024 KB Output is correct
25 Correct 1396 ms 112872 KB Output is correct
26 Correct 221 ms 39192 KB Output is correct
27 Correct 208 ms 34392 KB Output is correct
28 Correct 244 ms 43968 KB Output is correct
29 Correct 184 ms 36124 KB Output is correct
30 Correct 187 ms 29416 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 49524 KB Output is correct
2 Correct 1250 ms 107080 KB Output is correct
3 Correct 1270 ms 106668 KB Output is correct
4 Correct 142 ms 24528 KB Output is correct
5 Correct 1271 ms 106108 KB Output is correct
6 Correct 1286 ms 106104 KB Output is correct
7 Correct 1260 ms 105700 KB Output is correct
8 Correct 1264 ms 106724 KB Output is correct
9 Correct 1257 ms 106736 KB Output is correct
10 Correct 1307 ms 106252 KB Output is correct
11 Correct 1262 ms 106464 KB Output is correct
12 Correct 1307 ms 106208 KB Output is correct
13 Correct 1218 ms 105216 KB Output is correct
14 Correct 1233 ms 105264 KB Output is correct
15 Correct 1287 ms 104512 KB Output is correct
16 Correct 1301 ms 105304 KB Output is correct
17 Correct 1299 ms 105828 KB Output is correct
18 Correct 1328 ms 106932 KB Output is correct
19 Correct 180 ms 24404 KB Output is correct
20 Correct 1234 ms 106228 KB Output is correct
21 Correct 1182 ms 104484 KB Output is correct
22 Correct 122 ms 30908 KB Output is correct
23 Correct 170 ms 24752 KB Output is correct
24 Correct 138 ms 34240 KB Output is correct
25 Correct 152 ms 31528 KB Output is correct
26 Correct 149 ms 24940 KB Output is correct
27 Correct 115 ms 24404 KB Output is correct
28 Correct 149 ms 42364 KB Output is correct
29 Correct 128 ms 24504 KB Output is correct
30 Correct 132 ms 34240 KB Output is correct
31 Correct 128 ms 24528 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 3 ms 7512 KB Output is correct
4 Correct 1 ms 7260 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 2 ms 7516 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 2 ms 7512 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 197 ms 27544 KB Output is correct
17 Correct 1526 ms 116392 KB Output is correct
18 Correct 44 ms 16208 KB Output is correct
19 Correct 180 ms 29632 KB Output is correct
20 Correct 1483 ms 119172 KB Output is correct
21 Correct 463 ms 51372 KB Output is correct
22 Correct 192 ms 28368 KB Output is correct
23 Correct 1435 ms 114588 KB Output is correct
24 Correct 1404 ms 115024 KB Output is correct
25 Correct 1396 ms 112872 KB Output is correct
26 Correct 221 ms 39192 KB Output is correct
27 Correct 208 ms 34392 KB Output is correct
28 Correct 244 ms 43968 KB Output is correct
29 Correct 184 ms 36124 KB Output is correct
30 Correct 187 ms 29416 KB Output is correct
31 Correct 2 ms 7260 KB Output is correct
32 Correct 1 ms 7260 KB Output is correct
33 Correct 1 ms 7256 KB Output is correct
34 Correct 1 ms 7260 KB Output is correct
35 Correct 2 ms 7260 KB Output is correct
36 Correct 1 ms 7260 KB Output is correct
37 Correct 1 ms 7256 KB Output is correct
38 Correct 1 ms 7260 KB Output is correct
39 Correct 1 ms 7260 KB Output is correct
40 Correct 1 ms 7260 KB Output is correct
41 Correct 432 ms 49524 KB Output is correct
42 Correct 1250 ms 107080 KB Output is correct
43 Correct 1270 ms 106668 KB Output is correct
44 Correct 142 ms 24528 KB Output is correct
45 Correct 1271 ms 106108 KB Output is correct
46 Correct 1286 ms 106104 KB Output is correct
47 Correct 1260 ms 105700 KB Output is correct
48 Correct 1264 ms 106724 KB Output is correct
49 Correct 1257 ms 106736 KB Output is correct
50 Correct 1307 ms 106252 KB Output is correct
51 Correct 1262 ms 106464 KB Output is correct
52 Correct 1307 ms 106208 KB Output is correct
53 Correct 1218 ms 105216 KB Output is correct
54 Correct 1233 ms 105264 KB Output is correct
55 Correct 1287 ms 104512 KB Output is correct
56 Correct 1301 ms 105304 KB Output is correct
57 Correct 1299 ms 105828 KB Output is correct
58 Correct 1328 ms 106932 KB Output is correct
59 Correct 180 ms 24404 KB Output is correct
60 Correct 1234 ms 106228 KB Output is correct
61 Correct 1182 ms 104484 KB Output is correct
62 Correct 122 ms 30908 KB Output is correct
63 Correct 170 ms 24752 KB Output is correct
64 Correct 138 ms 34240 KB Output is correct
65 Correct 152 ms 31528 KB Output is correct
66 Correct 149 ms 24940 KB Output is correct
67 Correct 115 ms 24404 KB Output is correct
68 Correct 149 ms 42364 KB Output is correct
69 Correct 128 ms 24504 KB Output is correct
70 Correct 132 ms 34240 KB Output is correct
71 Correct 128 ms 24528 KB Output is correct
72 Execution timed out 4011 ms 57412 KB Time limit exceeded
73 Halted 0 ms 0 KB -