oj.uz

Submission #57414

# Submission time Handle Problem Language Result Execution time Memory
57414 2018-07-15T01:23:16 Z Benq Evacuation plan (IZhO18_plan) C++14
100 / 100
 1380 ms 33604 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,m,q,l[MX],r[MX];
pi p[MX];
vi tri[MX];
vi po;

template<int SZ> struct Dijkstra {
    int dist[SZ];
    vector<pi> adj[SZ];
    priority_queue<pi,vector<pi>,greater<pi>> q;
    
    void addEdge(int a, int b, int c) {
        adj[a].pb({b,c}), adj[b].pb({a,c});
        // cout << a << " " << b << " " << c << "\n";
    }
    
    void gen() {
        fill_n(dist,SZ,MOD); 
        for (int i: po) {
            dist[i] = 0;
            q.push({0,i});
        }
    	while (q.size()) {
    		pi x = q.top(); q.pop();
    		if (dist[x.s] < x.f) continue;
    		for (pi y: adj[x.s]) if (x.f+y.s < dist[y.f]) {
    			dist[y.f] = x.f+y.s;
    			// cout << "OOPS " << x.f << " " << y.f << " " << y.s << "\n";
    			q.push({dist[y.f],y.f});
    		}
    	}
    }
};

Dijkstra<MX> D;

template<int SZ> struct DSU {
    int par[SZ], sz[SZ];
    DSU() {
        F0R(i,SZ) par[i] = i, sz[i] = 1;
    }
    
    int get(int x) { // path compression
    	if (par[x] != x) par[x] = get(par[x]);
    	return par[x];
    }
    
    bool unite(int x, int y) { // union-by-rank
    	x = get(x), y = get(y);
    	if (x == y) return 0;
    	if (sz[x] < sz[y]) swap(x,y);
    	sz[x] += sz[y], par[y] = x;
    	return 1;
    }
};

vpi v; 

void binSearch() {
    F0R(i,MX) tri[i].clear();
    F0R(i,q) tri[(l[i]+r[i])/2].pb(i);
    DSU<MX> Z = DSU<MX>();
    F0R(i,sz(v)) {
        for (auto a: D.adj[v[i].s]) if (D.dist[a.f] >= D.dist[v[i].s]) Z.unite(a.f,v[i].s);
        for (int x: tri[i]) {
            if (Z.get(p[x].f) == Z.get(p[x].s)) r[x] = i;
            else l[x] = i+1;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    F0R(i,m) {
        int a,b,c; cin >> a >> b >> c;
        D.addEdge(a,b,c);
    }
    int k; cin >> k;
    F0R(i,k) {
        int g; cin >> g;
        po.pb(g);
    }
    D.gen();
    FOR(i,1,n+1) v.pb({D.dist[i],i});
    sort(all(v)); reverse(all(v));
    cin >> q;
    F0R(i,q) {
        cin >> p[i].f >> p[i].s;
        l[i] = 0, r[i] = sz(v)-1;
    }
    F0R(i,17) binSearch();
    F0R(i,q) cout << v[l[i]].f << "\n";
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6136 KB Output is correct
2 Correct 14 ms 6264 KB Output is correct
3 Correct 14 ms 6268 KB Output is correct
4 Correct 12 ms 6264 KB Output is correct
5 Correct 13 ms 6264 KB Output is correct
6 Correct 14 ms 6392 KB Output is correct
7 Correct 12 ms 6264 KB Output is correct
8 Correct 12 ms 6264 KB Output is correct
9 Correct 15 ms 6400 KB Output is correct
10 Correct 14 ms 6392 KB Output is correct
11 Correct 14 ms 6392 KB Output is correct
12 Correct 15 ms 6392 KB Output is correct
13 Correct 14 ms 6392 KB Output is correct
14 Correct 14 ms 6392 KB Output is correct
15 Correct 16 ms 6392 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6136 KB Output is correct
2 Correct 14 ms 6264 KB Output is correct
3 Correct 14 ms 6268 KB Output is correct
4 Correct 12 ms 6264 KB Output is correct
5 Correct 13 ms 6264 KB Output is correct
6 Correct 14 ms 6392 KB Output is correct
7 Correct 12 ms 6264 KB Output is correct
8 Correct 12 ms 6264 KB Output is correct
9 Correct 15 ms 6400 KB Output is correct
10 Correct 14 ms 6392 KB Output is correct
11 Correct 14 ms 6392 KB Output is correct
12 Correct 15 ms 6392 KB Output is correct
13 Correct 14 ms 6392 KB Output is correct
14 Correct 14 ms 6392 KB Output is correct
15 Correct 16 ms 6392 KB Output is correct
16 Correct 464 ms 22224 KB Output is correct
17 Correct 1186 ms 32708 KB Output is correct
18 Correct 76 ms 8568 KB Output is correct
19 Correct 266 ms 21072 KB Output is correct
20 Correct 1216 ms 32636 KB Output is correct
21 Correct 677 ms 25148 KB Output is correct
22 Correct 458 ms 22720 KB Output is correct
23 Correct 1170 ms 32688 KB Output is correct
24 Correct 1309 ms 32780 KB Output is correct
25 Correct 1225 ms 32696 KB Output is correct
26 Correct 256 ms 20920 KB Output is correct
27 Correct 264 ms 20716 KB Output is correct
28 Correct 268 ms 21036 KB Output is correct
29 Correct 250 ms 21176 KB Output is correct
30 Correct 250 ms 20960 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6236 KB Output is correct
2 Correct 12 ms 6136 KB Output is correct
3 Correct 12 ms 6264 KB Output is correct
4 Correct 12 ms 6264 KB Output is correct
5 Correct 13 ms 6264 KB Output is correct
6 Correct 12 ms 6264 KB Output is correct
7 Correct 12 ms 6264 KB Output is correct
8 Correct 12 ms 6264 KB Output is correct
9 Correct 12 ms 6264 KB Output is correct
10 Correct 12 ms 6264 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 14176 KB Output is correct
2 Correct 1036 ms 22292 KB Output is correct
3 Correct 1027 ms 22256 KB Output is correct
4 Correct 255 ms 10216 KB Output is correct
5 Correct 927 ms 22268 KB Output is correct
6 Correct 1012 ms 22200 KB Output is correct
7 Correct 974 ms 22124 KB Output is correct
8 Correct 988 ms 22196 KB Output is correct
9 Correct 947 ms 22256 KB Output is correct
10 Correct 1006 ms 22316 KB Output is correct
11 Correct 975 ms 22184 KB Output is correct
12 Correct 972 ms 22188 KB Output is correct
13 Correct 968 ms 22768 KB Output is correct
14 Correct 969 ms 23020 KB Output is correct
15 Correct 945 ms 23676 KB Output is correct
16 Correct 952 ms 22876 KB Output is correct
17 Correct 1008 ms 22776 KB Output is correct
18 Correct 1006 ms 22760 KB Output is correct
19 Correct 279 ms 10600 KB Output is correct
20 Correct 1049 ms 22892 KB Output is correct
21 Correct 833 ms 22576 KB Output is correct
22 Correct 226 ms 12012 KB Output is correct
23 Correct 245 ms 10988 KB Output is correct
24 Correct 274 ms 12140 KB Output is correct
25 Correct 189 ms 12112 KB Output is correct
26 Correct 329 ms 11032 KB Output is correct
27 Correct 235 ms 10472 KB Output is correct
28 Correct 182 ms 12028 KB Output is correct
29 Correct 230 ms 10520 KB Output is correct
30 Correct 192 ms 12136 KB Output is correct
31 Correct 251 ms 10612 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6136 KB Output is correct
2 Correct 14 ms 6264 KB Output is correct
3 Correct 14 ms 6268 KB Output is correct
4 Correct 12 ms 6264 KB Output is correct
5 Correct 13 ms 6264 KB Output is correct
6 Correct 14 ms 6392 KB Output is correct
7 Correct 12 ms 6264 KB Output is correct
8 Correct 12 ms 6264 KB Output is correct
9 Correct 15 ms 6400 KB Output is correct
10 Correct 14 ms 6392 KB Output is correct
11 Correct 14 ms 6392 KB Output is correct
12 Correct 15 ms 6392 KB Output is correct
13 Correct 14 ms 6392 KB Output is correct
14 Correct 14 ms 6392 KB Output is correct
15 Correct 16 ms 6392 KB Output is correct
16 Correct 464 ms 22224 KB Output is correct
17 Correct 1186 ms 32708 KB Output is correct
18 Correct 76 ms 8568 KB Output is correct
19 Correct 266 ms 21072 KB Output is correct
20 Correct 1216 ms 32636 KB Output is correct
21 Correct 677 ms 25148 KB Output is correct
22 Correct 458 ms 22720 KB Output is correct
23 Correct 1170 ms 32688 KB Output is correct
24 Correct 1309 ms 32780 KB Output is correct
25 Correct 1225 ms 32696 KB Output is correct
26 Correct 256 ms 20920 KB Output is correct
27 Correct 264 ms 20716 KB Output is correct
28 Correct 268 ms 21036 KB Output is correct
29 Correct 250 ms 21176 KB Output is correct
30 Correct 250 ms 20960 KB Output is correct
31 Correct 12 ms 6236 KB Output is correct
32 Correct 12 ms 6136 KB Output is correct
33 Correct 12 ms 6264 KB Output is correct
34 Correct 12 ms 6264 KB Output is correct
35 Correct 13 ms 6264 KB Output is correct
36 Correct 12 ms 6264 KB Output is correct
37 Correct 12 ms 6264 KB Output is correct
38 Correct 12 ms 6264 KB Output is correct
39 Correct 12 ms 6264 KB Output is correct
40 Correct 12 ms 6264 KB Output is correct
41 Correct 539 ms 14176 KB Output is correct
42 Correct 1036 ms 22292 KB Output is correct
43 Correct 1027 ms 22256 KB Output is correct
44 Correct 255 ms 10216 KB Output is correct
45 Correct 927 ms 22268 KB Output is correct
46 Correct 1012 ms 22200 KB Output is correct
47 Correct 974 ms 22124 KB Output is correct
48 Correct 988 ms 22196 KB Output is correct
49 Correct 947 ms 22256 KB Output is correct
50 Correct 1006 ms 22316 KB Output is correct
51 Correct 975 ms 22184 KB Output is correct
52 Correct 972 ms 22188 KB Output is correct
53 Correct 968 ms 22768 KB Output is correct
54 Correct 969 ms 23020 KB Output is correct
55 Correct 945 ms 23676 KB Output is correct
56 Correct 952 ms 22876 KB Output is correct
57 Correct 1008 ms 22776 KB Output is correct
58 Correct 1006 ms 22760 KB Output is correct
59 Correct 279 ms 10600 KB Output is correct
60 Correct 1049 ms 22892 KB Output is correct
61 Correct 833 ms 22576 KB Output is correct
62 Correct 226 ms 12012 KB Output is correct
63 Correct 245 ms 10988 KB Output is correct
64 Correct 274 ms 12140 KB Output is correct
65 Correct 189 ms 12112 KB Output is correct
66 Correct 329 ms 11032 KB Output is correct
67 Correct 235 ms 10472 KB Output is correct
68 Correct 182 ms 12028 KB Output is correct
69 Correct 230 ms 10520 KB Output is correct
70 Correct 192 ms 12136 KB Output is correct
71 Correct 251 ms 10612 KB Output is correct
72 Correct 804 ms 25772 KB Output is correct
73 Correct 1224 ms 33340 KB Output is correct
74 Correct 1257 ms 33216 KB Output is correct
75 Correct 1279 ms 33200 KB Output is correct
76 Correct 1272 ms 33256 KB Output is correct
77 Correct 1226 ms 33264 KB Output is correct
78 Correct 1254 ms 33544 KB Output is correct
79 Correct 1237 ms 33604 KB Output is correct
80 Correct 1256 ms 33096 KB Output is correct
81 Correct 1197 ms 32720 KB Output is correct
82 Correct 1170 ms 32524 KB Output is correct
83 Correct 1195 ms 32624 KB Output is correct
84 Correct 1173 ms 32576 KB Output is correct
85 Correct 1177 ms 32740 KB Output is correct
86 Correct 1380 ms 32520 KB Output is correct
87 Correct 1230 ms 32556 KB Output is correct
88 Correct 1164 ms 32732 KB Output is correct
89 Correct 489 ms 22892 KB Output is correct
90 Correct 1205 ms 32520 KB Output is correct
91 Correct 993 ms 31312 KB Output is correct
92 Correct 244 ms 21044 KB Output is correct
93 Correct 399 ms 21156 KB Output is correct
94 Correct 263 ms 20460 KB Output is correct
95 Correct 268 ms 21096 KB Output is correct
96 Correct 426 ms 19612 KB Output is correct
97 Correct 448 ms 21448 KB Output is correct
98 Correct 276 ms 20860 KB Output is correct
99 Correct 442 ms 21476 KB Output is correct
100 Correct 274 ms 20728 KB Output is correct