oj.uz

답안 #414099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
414099 2021-05-30T03:21:02 Z cpp219 Evacuation plan (IZhO18_plan) C++14
100 / 100
 1629 ms 33272 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 <= 30;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";
    }
    /// parallel binary search idea
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5712 KB Output is correct
2 Correct 7 ms 5964 KB Output is correct
3 Correct 7 ms 5936 KB Output is correct
4 Correct 5 ms 5812 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 7 ms 5896 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5964 KB Output is correct
12 Correct 7 ms 5964 KB Output is correct
13 Correct 8 ms 5916 KB Output is correct
14 Correct 8 ms 5936 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5712 KB Output is correct
2 Correct 7 ms 5964 KB Output is correct
3 Correct 7 ms 5936 KB Output is correct
4 Correct 5 ms 5812 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 7 ms 5896 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5964 KB Output is correct
12 Correct 7 ms 5964 KB Output is correct
13 Correct 8 ms 5916 KB Output is correct
14 Correct 8 ms 5936 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct
16 Correct 607 ms 22512 KB Output is correct
17 Correct 1521 ms 33272 KB Output is correct
18 Correct 85 ms 8984 KB Output is correct
19 Correct 320 ms 21748 KB Output is correct
20 Correct 1629 ms 33164 KB Output is correct
21 Correct 896 ms 25916 KB Output is correct
22 Correct 393 ms 23132 KB Output is correct
23 Correct 1576 ms 33168 KB Output is correct
24 Correct 1588 ms 33116 KB Output is correct
25 Correct 1503 ms 33180 KB Output is correct
26 Correct 320 ms 21108 KB Output is correct
27 Correct 333 ms 21616 KB Output is correct
28 Correct 316 ms 21476 KB Output is correct
29 Correct 327 ms 21188 KB Output is correct
30 Correct 325 ms 21528 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5708 KB Output is correct
2 Correct 5 ms 5708 KB Output is correct
3 Correct 6 ms 5800 KB Output is correct
4 Correct 7 ms 5708 KB Output is correct
5 Correct 5 ms 5800 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 6 ms 5708 KB Output is correct
8 Correct 5 ms 5796 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 6 ms 5836 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 762 ms 15008 KB Output is correct
2 Correct 1316 ms 23188 KB Output is correct
3 Correct 1403 ms 23264 KB Output is correct
4 Correct 239 ms 11116 KB Output is correct
5 Correct 1341 ms 23088 KB Output is correct
6 Correct 1273 ms 23112 KB Output is correct
7 Correct 1370 ms 23048 KB Output is correct
8 Correct 1338 ms 23248 KB Output is correct
9 Correct 1347 ms 23204 KB Output is correct
10 Correct 1315 ms 23124 KB Output is correct
11 Correct 1358 ms 23136 KB Output is correct
12 Correct 1346 ms 23152 KB Output is correct
13 Correct 1329 ms 23224 KB Output is correct
14 Correct 1299 ms 23124 KB Output is correct
15 Correct 1314 ms 23448 KB Output is correct
16 Correct 1278 ms 23136 KB Output is correct
17 Correct 1356 ms 23076 KB Output is correct
18 Correct 1328 ms 22920 KB Output is correct
19 Correct 194 ms 11080 KB Output is correct
20 Correct 1318 ms 23000 KB Output is correct
21 Correct 1110 ms 22712 KB Output is correct
22 Correct 226 ms 12704 KB Output is correct
23 Correct 294 ms 11580 KB Output is correct
24 Correct 240 ms 12576 KB Output is correct
25 Correct 249 ms 12696 KB Output is correct
26 Correct 341 ms 11580 KB Output is correct
27 Correct 270 ms 11028 KB Output is correct
28 Correct 249 ms 12600 KB Output is correct
29 Correct 217 ms 10984 KB Output is correct
30 Correct 233 ms 12588 KB Output is correct
31 Correct 228 ms 10948 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5712 KB Output is correct
2 Correct 7 ms 5964 KB Output is correct
3 Correct 7 ms 5936 KB Output is correct
4 Correct 5 ms 5812 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 7 ms 5896 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 6 ms 5836 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5964 KB Output is correct
12 Correct 7 ms 5964 KB Output is correct
13 Correct 8 ms 5916 KB Output is correct
14 Correct 8 ms 5936 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct
16 Correct 607 ms 22512 KB Output is correct
17 Correct 1521 ms 33272 KB Output is correct
18 Correct 85 ms 8984 KB Output is correct
19 Correct 320 ms 21748 KB Output is correct
20 Correct 1629 ms 33164 KB Output is correct
21 Correct 896 ms 25916 KB Output is correct
22 Correct 393 ms 23132 KB Output is correct
23 Correct 1576 ms 33168 KB Output is correct
24 Correct 1588 ms 33116 KB Output is correct
25 Correct 1503 ms 33180 KB Output is correct
26 Correct 320 ms 21108 KB Output is correct
27 Correct 333 ms 21616 KB Output is correct
28 Correct 316 ms 21476 KB Output is correct
29 Correct 327 ms 21188 KB Output is correct
30 Correct 325 ms 21528 KB Output is correct
31 Correct 6 ms 5708 KB Output is correct
32 Correct 5 ms 5708 KB Output is correct
33 Correct 6 ms 5800 KB Output is correct
34 Correct 7 ms 5708 KB Output is correct
35 Correct 5 ms 5800 KB Output is correct
36 Correct 5 ms 5708 KB Output is correct
37 Correct 6 ms 5708 KB Output is correct
38 Correct 5 ms 5796 KB Output is correct
39 Correct 5 ms 5708 KB Output is correct
40 Correct 6 ms 5836 KB Output is correct
41 Correct 762 ms 15008 KB Output is correct
42 Correct 1316 ms 23188 KB Output is correct
43 Correct 1403 ms 23264 KB Output is correct
44 Correct 239 ms 11116 KB Output is correct
45 Correct 1341 ms 23088 KB Output is correct
46 Correct 1273 ms 23112 KB Output is correct
47 Correct 1370 ms 23048 KB Output is correct
48 Correct 1338 ms 23248 KB Output is correct
49 Correct 1347 ms 23204 KB Output is correct
50 Correct 1315 ms 23124 KB Output is correct
51 Correct 1358 ms 23136 KB Output is correct
52 Correct 1346 ms 23152 KB Output is correct
53 Correct 1329 ms 23224 KB Output is correct
54 Correct 1299 ms 23124 KB Output is correct
55 Correct 1314 ms 23448 KB Output is correct
56 Correct 1278 ms 23136 KB Output is correct
57 Correct 1356 ms 23076 KB Output is correct
58 Correct 1328 ms 22920 KB Output is correct
59 Correct 194 ms 11080 KB Output is correct
60 Correct 1318 ms 23000 KB Output is correct
61 Correct 1110 ms 22712 KB Output is correct
62 Correct 226 ms 12704 KB Output is correct
63 Correct 294 ms 11580 KB Output is correct
64 Correct 240 ms 12576 KB Output is correct
65 Correct 249 ms 12696 KB Output is correct
66 Correct 341 ms 11580 KB Output is correct
67 Correct 270 ms 11028 KB Output is correct
68 Correct 249 ms 12600 KB Output is correct
69 Correct 217 ms 10984 KB Output is correct
70 Correct 233 ms 12588 KB Output is correct
71 Correct 228 ms 10948 KB Output is correct
72 Correct 955 ms 25620 KB Output is correct
73 Correct 1554 ms 33044 KB Output is correct
74 Correct 1545 ms 33076 KB Output is correct
75 Correct 1447 ms 33212 KB Output is correct
76 Correct 1530 ms 33048 KB Output is correct
77 Correct 1520 ms 33076 KB Output is correct
78 Correct 1539 ms 33020 KB Output is correct
79 Correct 1510 ms 33040 KB Output is correct
80 Correct 1516 ms 32864 KB Output is correct
81 Correct 1524 ms 32840 KB Output is correct
82 Correct 1489 ms 32776 KB Output is correct
83 Correct 1485 ms 32876 KB Output is correct
84 Correct 1508 ms 32752 KB Output is correct
85 Correct 1515 ms 32780 KB Output is correct
86 Correct 1467 ms 32792 KB Output is correct
87 Correct 1469 ms 32664 KB Output is correct
88 Correct 1550 ms 32728 KB Output is correct
89 Correct 415 ms 22960 KB Output is correct
90 Correct 1483 ms 32564 KB Output is correct
91 Correct 1286 ms 32104 KB Output is correct
92 Correct 299 ms 21048 KB Output is correct
93 Correct 423 ms 21556 KB Output is correct
94 Correct 308 ms 20988 KB Output is correct
95 Correct 288 ms 20756 KB Output is correct
96 Correct 475 ms 19912 KB Output is correct
97 Correct 421 ms 21376 KB Output is correct
98 Correct 300 ms 20404 KB Output is correct
99 Correct 405 ms 21448 KB Output is correct
100 Correct 328 ms 20980 KB Output is correct