oj.uz

Submission #414098

# Submission time Handle Problem Language Result Execution time Memory
414098 2021-05-30T03:17:39 Z cpp219 Evacuation plan (IZhO18_plan) C++14
100 / 100
 2091 ms 41784 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e5 + 9;
const ll Log2 = 20;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
vector<LL> g[N];
ll n,m,x,y,w,k,d[N],pos[N];

priority_queue<LL,vector<LL>,greater<LL>> pq;

void Dij(){
    while(!pq.empty()){
        LL t = pq.top(); pq.pop();
        ll u = t.sc,val = t.fs;
        for (auto i : g[u]){
            ll v = i.fs,L = i.sc;
            if (d[v] > val + L){
                d[v] = val + L; pq.push({d[v],v});
            }
        }
    }
}

bool lf(ll x,ll y){
    return d[x] > d[y];
}

ll lab[N];
ll Find(ll u){
    if (lab[u] < 0) return u;
    return lab[u] = Find(lab[u]);
}

void Union(ll p,ll q){
    ll r = Find(p),s = Find(q);
    if (r == s) return;
    if (lab[r] > lab[s]) swap(r,s);
    lab[r] += lab[s]; lab[s] = r;
}
LL q[N];
ll l[N],h[N],was[N],Q;
vector<ll> v[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "test"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>m;
    for (ll i = 1;i <= m;i++){
        cin>>x>>y>>w;
        g[x].push_back({y,w}); g[y].push_back({x,w});
    }
    for (ll i = 1;i <= n;i++){
        d[i] = inf; pos[i] = i;
    }
    cin>>k;
    for (ll i = 1;i <= k;i++) cin>>x,d[x] = 0,pq.push({0,x});
    Dij(); sort(pos + 1,pos + n + 1,lf);
    cin>>Q;
    for (ll i = 1;i <= Q;i++) cin>>q[i].fs>>q[i].sc,l[i] = 1,h[i] = n;
    for (ll i = 1;i <= 45;i++){
        memset(lab,-1,sizeof(lab)); memset(was,0,sizeof(was));
        for (ll j = 1;j <= n;j++) v[j].clear();
        for (ll j = 1;j <= Q;j++){
            if (l[j] > h[j]) continue;
            ll mid = (l[j] + h[j]) / 2;
            v[mid].push_back(j);
        }
        for (ll j = 1;j <= n;j++){
            ll now = pos[j]; was[now] = 1;
            for (auto k : g[now]) if (was[k.fs]) Union(now,k.fs);
            for (auto k : v[j]){
                if (Find(q[k].fs) == Find(q[k].sc)) h[k] = j - 1;
                else l[k] = j + 1;
            }
        }
    }
    for (ll i = 1;i <= Q;i++){
        ll now = pos[l[i]];
        cout<<d[now]<<"\n";
    }
}

Compilation message

plan.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
plan.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
plan.cpp: In function 'int main()':
plan.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5712 KB Output is correct
2 Correct 8 ms 5964 KB Output is correct
3 Correct 8 ms 5964 KB Output is correct
4 Correct 6 ms 5796 KB Output is correct
5 Correct 8 ms 5964 KB Output is correct
6 Correct 9 ms 5940 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 9 ms 5936 KB Output is correct
10 Correct 9 ms 5936 KB Output is correct
11 Correct 9 ms 5992 KB Output is correct
12 Correct 8 ms 5912 KB Output is correct
13 Correct 9 ms 5964 KB Output is correct
14 Correct 10 ms 5964 KB Output is correct
15 Correct 9 ms 5940 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5712 KB Output is correct
2 Correct 8 ms 5964 KB Output is correct
3 Correct 8 ms 5964 KB Output is correct
4 Correct 6 ms 5796 KB Output is correct
5 Correct 8 ms 5964 KB Output is correct
6 Correct 9 ms 5940 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 9 ms 5936 KB Output is correct
10 Correct 9 ms 5936 KB Output is correct
11 Correct 9 ms 5992 KB Output is correct
12 Correct 8 ms 5912 KB Output is correct
13 Correct 9 ms 5964 KB Output is correct
14 Correct 10 ms 5964 KB Output is correct
15 Correct 9 ms 5940 KB Output is correct
16 Correct 819 ms 24312 KB Output is correct
17 Correct 2076 ms 41628 KB Output is correct
18 Correct 99 ms 8900 KB Output is correct
19 Correct 444 ms 23632 KB Output is correct
20 Correct 2035 ms 41580 KB Output is correct
21 Correct 1174 ms 29640 KB Output is correct
22 Correct 450 ms 25092 KB Output is correct
23 Correct 2071 ms 41552 KB Output is correct
24 Correct 2091 ms 41476 KB Output is correct
25 Correct 2088 ms 41544 KB Output is correct
26 Correct 406 ms 23016 KB Output is correct
27 Correct 414 ms 23508 KB Output is correct
28 Correct 392 ms 23368 KB Output is correct
29 Correct 395 ms 23096 KB Output is correct
30 Correct 420 ms 23572 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1139 ms 14120 KB Output is correct
2 Correct 1794 ms 22312 KB Output is correct
3 Correct 1868 ms 22348 KB Output is correct
4 Correct 307 ms 10276 KB Output is correct
5 Correct 1813 ms 22196 KB Output is correct
6 Correct 1705 ms 22316 KB Output is correct
7 Correct 1794 ms 22200 KB Output is correct
8 Correct 1784 ms 22324 KB Output is correct
9 Correct 1638 ms 22132 KB Output is correct
10 Correct 1803 ms 22296 KB Output is correct
11 Correct 1727 ms 22204 KB Output is correct
12 Correct 1722 ms 22300 KB Output is correct
13 Correct 1725 ms 22208 KB Output is correct
14 Correct 1746 ms 22204 KB Output is correct
15 Correct 1758 ms 22460 KB Output is correct
16 Correct 1755 ms 22300 KB Output is correct
17 Correct 1724 ms 22084 KB Output is correct
18 Correct 1720 ms 22276 KB Output is correct
19 Correct 245 ms 10052 KB Output is correct
20 Correct 1691 ms 22080 KB Output is correct
21 Correct 1506 ms 21804 KB Output is correct
22 Correct 289 ms 11804 KB Output is correct
23 Correct 399 ms 10612 KB Output is correct
24 Correct 317 ms 11680 KB Output is correct
25 Correct 324 ms 11808 KB Output is correct
26 Correct 469 ms 10672 KB Output is correct
27 Correct 284 ms 10180 KB Output is correct
28 Correct 320 ms 11792 KB Output is correct
29 Correct 285 ms 10180 KB Output is correct
30 Correct 319 ms 11800 KB Output is correct
31 Correct 275 ms 10172 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5712 KB Output is correct
2 Correct 8 ms 5964 KB Output is correct
3 Correct 8 ms 5964 KB Output is correct
4 Correct 6 ms 5796 KB Output is correct
5 Correct 8 ms 5964 KB Output is correct
6 Correct 9 ms 5940 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 9 ms 5936 KB Output is correct
10 Correct 9 ms 5936 KB Output is correct
11 Correct 9 ms 5992 KB Output is correct
12 Correct 8 ms 5912 KB Output is correct
13 Correct 9 ms 5964 KB Output is correct
14 Correct 10 ms 5964 KB Output is correct
15 Correct 9 ms 5940 KB Output is correct
16 Correct 819 ms 24312 KB Output is correct
17 Correct 2076 ms 41628 KB Output is correct
18 Correct 99 ms 8900 KB Output is correct
19 Correct 444 ms 23632 KB Output is correct
20 Correct 2035 ms 41580 KB Output is correct
21 Correct 1174 ms 29640 KB Output is correct
22 Correct 450 ms 25092 KB Output is correct
23 Correct 2071 ms 41552 KB Output is correct
24 Correct 2091 ms 41476 KB Output is correct
25 Correct 2088 ms 41544 KB Output is correct
26 Correct 406 ms 23016 KB Output is correct
27 Correct 414 ms 23508 KB Output is correct
28 Correct 392 ms 23368 KB Output is correct
29 Correct 395 ms 23096 KB Output is correct
30 Correct 420 ms 23572 KB Output is correct
31 Correct 5 ms 5708 KB Output is correct
32 Correct 5 ms 5800 KB Output is correct
33 Correct 5 ms 5836 KB Output is correct
34 Correct 6 ms 5708 KB Output is correct
35 Correct 6 ms 5836 KB Output is correct
36 Correct 6 ms 5800 KB Output is correct
37 Correct 6 ms 5836 KB Output is correct
38 Correct 6 ms 5708 KB Output is correct
39 Correct 6 ms 5708 KB Output is correct
40 Correct 6 ms 5708 KB Output is correct
41 Correct 1139 ms 14120 KB Output is correct
42 Correct 1794 ms 22312 KB Output is correct
43 Correct 1868 ms 22348 KB Output is correct
44 Correct 307 ms 10276 KB Output is correct
45 Correct 1813 ms 22196 KB Output is correct
46 Correct 1705 ms 22316 KB Output is correct
47 Correct 1794 ms 22200 KB Output is correct
48 Correct 1784 ms 22324 KB Output is correct
49 Correct 1638 ms 22132 KB Output is correct
50 Correct 1803 ms 22296 KB Output is correct
51 Correct 1727 ms 22204 KB Output is correct
52 Correct 1722 ms 22300 KB Output is correct
53 Correct 1725 ms 22208 KB Output is correct
54 Correct 1746 ms 22204 KB Output is correct
55 Correct 1758 ms 22460 KB Output is correct
56 Correct 1755 ms 22300 KB Output is correct
57 Correct 1724 ms 22084 KB Output is correct
58 Correct 1720 ms 22276 KB Output is correct
59 Correct 245 ms 10052 KB Output is correct
60 Correct 1691 ms 22080 KB Output is correct
61 Correct 1506 ms 21804 KB Output is correct
62 Correct 289 ms 11804 KB Output is correct
63 Correct 399 ms 10612 KB Output is correct
64 Correct 317 ms 11680 KB Output is correct
65 Correct 324 ms 11808 KB Output is correct
66 Correct 469 ms 10672 KB Output is correct
67 Correct 284 ms 10180 KB Output is correct
68 Correct 320 ms 11792 KB Output is correct
69 Correct 285 ms 10180 KB Output is correct
70 Correct 319 ms 11800 KB Output is correct
71 Correct 275 ms 10172 KB Output is correct
72 Correct 1202 ms 29188 KB Output is correct
73 Correct 1932 ms 41420 KB Output is correct
74 Correct 2005 ms 41568 KB Output is correct
75 Correct 1951 ms 41572 KB Output is correct
76 Correct 1931 ms 41512 KB Output is correct
77 Correct 2017 ms 41544 KB Output is correct
78 Correct 1982 ms 41784 KB Output is correct
79 Correct 2001 ms 41352 KB Output is correct
80 Correct 2001 ms 41524 KB Output is correct
81 Correct 1994 ms 41584 KB Output is correct
82 Correct 1912 ms 41512 KB Output is correct
83 Correct 1961 ms 41484 KB Output is correct
84 Correct 2017 ms 41428 KB Output is correct
85 Correct 2011 ms 41516 KB Output is correct
86 Correct 1993 ms 41404 KB Output is correct
87 Correct 1968 ms 41612 KB Output is correct
88 Correct 1956 ms 41484 KB Output is correct
89 Correct 463 ms 25276 KB Output is correct
90 Correct 1981 ms 41436 KB Output is correct
91 Correct 1707 ms 41428 KB Output is correct
92 Correct 372 ms 23476 KB Output is correct
93 Correct 536 ms 23868 KB Output is correct
94 Correct 394 ms 23352 KB Output is correct
95 Correct 366 ms 23144 KB Output is correct
96 Correct 599 ms 22376 KB Output is correct
97 Correct 447 ms 23800 KB Output is correct
98 Correct 409 ms 22956 KB Output is correct
99 Correct 447 ms 23856 KB Output is correct
100 Correct 369 ms 23488 KB Output is correct