oj.uz

Submission #334584

# Submission time Handle Problem Language Result Execution time Memory
334584 2020-12-09T13:56:32 Z talant117408 Evacuation plan (IZhO18_plan) C++17
100 / 100
 790 ms 40936 KB 
/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}

const int N = 1e5+7;
set <int> st[N];
vector <int> npp;
vector <vector <pii>> graph(N);
int dist[N], n, ans[N];

class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n+1, 1); link.resize(n+1); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b, int val){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(sz(st[a]) < sz(st[b])) swap(a, b);
            
            for(auto to : st[b]){
                if(st[a].count(to)){
                    ans[to] = val;
                }
                else{
                    st[a].insert(to);
                }
            }
            st[b].clear();
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

void dijkstra(){
    for(int i = 1; i <= n; i++){
        dist[i] = 2e9;
    }
    for(auto to : npp) dist[to] = 0;
    priority_queue <pii> K;
    for(auto to : npp) K.push(mp(0, to));
    
    while(sz(K)){
        auto v = K.top(); K.pop();
        for(auto to : graph[v.second]){
            if(dist[to.first] > dist[v.second]+to.second){
                dist[to.first] = dist[v.second]+to.second;
                K.push(mp(-dist[to.first], to.first));
            }
        }
    }
}

bool cmp(int a, int b){
    return dist[a] > dist[b];
}

int main(){
    do_not_disturb
    /*
    int n, m;
    int i, j;
    cin >> n >> m;
    int grid[n+1][m+1];
    int pref[2][n+2][m+2], suff[2][n+2][m+2];
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            char ch;
            cin >> ch;
            if(ch == '0') grid[i][j] = 0;
            else grid[i][j] = 1;
        }
    }
    
    */
    
    int m;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        int x, y, w;
        cin >> x >> y >> w;
        graph[x].pb(mp(y, w));
        graph[y].pb(mp(x, w));
    }
    
    int k;
    cin >> k;
    npp.resize(k);
    for(auto &to : npp) cin >> to;
    dijkstra();
    
    int q;
    cin >> q;
    
    for(int i = 1; i <= q; i++){
        int x, y;
        cin >> x >> y;
        st[x].insert(i);
        st[y].insert(i);
    }
    
    Union t(n+1);
    
    int id[n+1], vis[n+1];
    for(int i = 1; i <= n; i++){
        id[i] = i;
        vis[i] = 0;
    }
    sort(id+1, id+n+1, cmp);
    for(int i = 1; i <= n; i++){
        vis[id[i]] = 1;
        for(auto to : graph[id[i]]){
            if(vis[to.first]){
                t.unite(id[i], to.first, dist[id[i]]);
            }
        }
    }
    
    for(int i = 1; i <= q; i++){
        cout << ans[i] << endl;
    }
    
    return 0;
}
/*
6 6
000111
011111
011111
111000
111000
111000

6 6
000000
111000
111100
001111
000111
000111
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 6 ms 7532 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 6 ms 7532 KB Output is correct
10 Correct 6 ms 7532 KB Output is correct
11 Correct 6 ms 7532 KB Output is correct
12 Correct 6 ms 7532 KB Output is correct
13 Correct 6 ms 7532 KB Output is correct
14 Correct 6 ms 7532 KB Output is correct
15 Correct 7 ms 7532 KB Output is correct
16 Correct 360 ms 25660 KB Output is correct
17 Correct 748 ms 38940 KB Output is correct
18 Correct 41 ms 10512 KB Output is correct
19 Correct 240 ms 26480 KB Output is correct
20 Correct 747 ms 37484 KB Output is correct
21 Correct 479 ms 30556 KB Output is correct
22 Correct 276 ms 26092 KB Output is correct
23 Correct 734 ms 37560 KB Output is correct
24 Correct 759 ms 37512 KB Output is correct
25 Correct 745 ms 37348 KB Output is correct
26 Correct 240 ms 26204 KB Output is correct
27 Correct 243 ms 26196 KB Output is correct
28 Correct 237 ms 26196 KB Output is correct
29 Correct 247 ms 26196 KB Output is correct
30 Correct 243 ms 26324 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 15804 KB Output is correct
2 Correct 460 ms 29140 KB Output is correct
3 Correct 465 ms 29324 KB Output is correct
4 Correct 91 ms 14060 KB Output is correct
5 Correct 474 ms 29328 KB Output is correct
6 Correct 454 ms 29488 KB Output is correct
7 Correct 457 ms 29320 KB Output is correct
8 Correct 452 ms 29324 KB Output is correct
9 Correct 455 ms 29500 KB Output is correct
10 Correct 450 ms 29328 KB Output is correct
11 Correct 469 ms 29452 KB Output is correct
12 Correct 450 ms 29324 KB Output is correct
13 Correct 447 ms 29328 KB Output is correct
14 Correct 471 ms 29312 KB Output is correct
15 Correct 457 ms 30048 KB Output is correct
16 Correct 454 ms 29320 KB Output is correct
17 Correct 449 ms 29320 KB Output is correct
18 Correct 465 ms 29452 KB Output is correct
19 Correct 90 ms 14060 KB Output is correct
20 Correct 473 ms 29456 KB Output is correct
21 Correct 475 ms 29640 KB Output is correct
22 Correct 107 ms 14936 KB Output is correct
23 Correct 99 ms 14700 KB Output is correct
24 Correct 107 ms 14944 KB Output is correct
25 Correct 104 ms 14932 KB Output is correct
26 Correct 110 ms 14756 KB Output is correct
27 Correct 94 ms 14060 KB Output is correct
28 Correct 115 ms 14944 KB Output is correct
29 Correct 97 ms 14060 KB Output is correct
30 Correct 109 ms 14932 KB Output is correct
31 Correct 96 ms 14188 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 6 ms 7532 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 6 ms 7532 KB Output is correct
10 Correct 6 ms 7532 KB Output is correct
11 Correct 6 ms 7532 KB Output is correct
12 Correct 6 ms 7532 KB Output is correct
13 Correct 6 ms 7532 KB Output is correct
14 Correct 6 ms 7532 KB Output is correct
15 Correct 7 ms 7532 KB Output is correct
16 Correct 360 ms 25660 KB Output is correct
17 Correct 748 ms 38940 KB Output is correct
18 Correct 41 ms 10512 KB Output is correct
19 Correct 240 ms 26480 KB Output is correct
20 Correct 747 ms 37484 KB Output is correct
21 Correct 479 ms 30556 KB Output is correct
22 Correct 276 ms 26092 KB Output is correct
23 Correct 734 ms 37560 KB Output is correct
24 Correct 759 ms 37512 KB Output is correct
25 Correct 745 ms 37348 KB Output is correct
26 Correct 240 ms 26204 KB Output is correct
27 Correct 243 ms 26196 KB Output is correct
28 Correct 237 ms 26196 KB Output is correct
29 Correct 247 ms 26196 KB Output is correct
30 Correct 243 ms 26324 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 5 ms 7404 KB Output is correct
33 Correct 5 ms 7404 KB Output is correct
34 Correct 5 ms 7404 KB Output is correct
35 Correct 5 ms 7404 KB Output is correct
36 Correct 5 ms 7404 KB Output is correct
37 Correct 5 ms 7404 KB Output is correct
38 Correct 5 ms 7404 KB Output is correct
39 Correct 5 ms 7404 KB Output is correct
40 Correct 5 ms 7404 KB Output is correct
41 Correct 212 ms 15804 KB Output is correct
42 Correct 460 ms 29140 KB Output is correct
43 Correct 465 ms 29324 KB Output is correct
44 Correct 91 ms 14060 KB Output is correct
45 Correct 474 ms 29328 KB Output is correct
46 Correct 454 ms 29488 KB Output is correct
47 Correct 457 ms 29320 KB Output is correct
48 Correct 452 ms 29324 KB Output is correct
49 Correct 455 ms 29500 KB Output is correct
50 Correct 450 ms 29328 KB Output is correct
51 Correct 469 ms 29452 KB Output is correct
52 Correct 450 ms 29324 KB Output is correct
53 Correct 447 ms 29328 KB Output is correct
54 Correct 471 ms 29312 KB Output is correct
55 Correct 457 ms 30048 KB Output is correct
56 Correct 454 ms 29320 KB Output is correct
57 Correct 449 ms 29320 KB Output is correct
58 Correct 465 ms 29452 KB Output is correct
59 Correct 90 ms 14060 KB Output is correct
60 Correct 473 ms 29456 KB Output is correct
61 Correct 475 ms 29640 KB Output is correct
62 Correct 107 ms 14936 KB Output is correct
63 Correct 99 ms 14700 KB Output is correct
64 Correct 107 ms 14944 KB Output is correct
65 Correct 104 ms 14932 KB Output is correct
66 Correct 110 ms 14756 KB Output is correct
67 Correct 94 ms 14060 KB Output is correct
68 Correct 115 ms 14944 KB Output is correct
69 Correct 97 ms 14060 KB Output is correct
70 Correct 109 ms 14932 KB Output is correct
71 Correct 96 ms 14188 KB Output is correct
72 Correct 509 ms 30644 KB Output is correct
73 Correct 766 ms 38536 KB Output is correct
74 Correct 747 ms 38536 KB Output is correct
75 Correct 739 ms 38532 KB Output is correct
76 Correct 747 ms 38588 KB Output is correct
77 Correct 742 ms 38464 KB Output is correct
78 Correct 747 ms 38432 KB Output is correct
79 Correct 715 ms 38408 KB Output is correct
80 Correct 741 ms 38404 KB Output is correct
81 Correct 752 ms 38408 KB Output is correct
82 Correct 741 ms 38540 KB Output is correct
83 Correct 729 ms 38592 KB Output is correct
84 Correct 728 ms 38388 KB Output is correct
85 Correct 723 ms 38872 KB Output is correct
86 Correct 769 ms 39148 KB Output is correct
87 Correct 790 ms 40568 KB Output is correct
88 Correct 788 ms 40624 KB Output is correct
89 Correct 364 ms 26092 KB Output is correct
90 Correct 719 ms 40724 KB Output is correct
91 Correct 710 ms 40936 KB Output is correct
92 Correct 376 ms 26324 KB Output is correct
93 Correct 476 ms 26988 KB Output is correct
94 Correct 367 ms 26204 KB Output is correct
95 Correct 354 ms 26452 KB Output is correct
96 Correct 588 ms 26148 KB Output is correct
97 Correct 384 ms 25708 KB Output is correct
98 Correct 379 ms 26128 KB Output is correct
99 Correct 398 ms 25820 KB Output is correct
100 Correct 364 ms 26324 KB Output is correct