oj.uz

Submission #237376

# Submission time Handle Problem Language Result Execution time Memory
237376 2020-06-06T09:36:57 Z _7_7_ Evacuation plan (IZhO18_plan) C++14
100 / 100
 750 ms 35760 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int n, m, q, v, u, w, k, d[N], res[N], p[N], pp[N];
vector < pair < int, pii > > gg[N];
set < pii > Q;
vpii g[N];

bool cmp (int x, int y) {
	return d[x] > d[y];
}

int get (int v) {
	return v == p[v] ? v : p[v] = get(p[v]);
}

void merge (int v, int u, int w) {
	v = get(v), u = get(u);
	if (v == u)
		return;

	if (sz(gg[v]) > sz(gg[u]))
		swap(v, u);

	for (auto x : gg[v]) {
		if (res[x.f] != -1)
			continue;
		int p1 = get(x.s.f), p2 = get(x.s.s);
		if ((p1 == v && p2 == u) || (p1 == u && p2 == v)) {
			res[x.f] = w;
			continue;
		}
		gg[u].pb(x);
	}		

	p[v] = u;
}


main () {
	scanf("%d%d", &n, &m);
	while (m--) {
		scanf("%d%d%d", &v, &u, &w);
		g[v].pb({w, u});
		g[u].pb({w, v});
	}

	for (int i = 1; i <= n; ++i)
		d[i] = inf;

	scanf("%d", &k);
	while (k--) {
		scanf("%d", &v);
		d[v] = 0;
		Q.insert({0, v});
	}

	while (sz(Q)) {
		int v = Q.begin()->s;
		Q.erase(Q.begin());
		for (auto x : g[v])
			 if (d[x.s] > d[v] + x.f) {
			 	Q.erase(mp(d[x.s], x.s));
			 	d[x.s] = d[v] + x.f;
			 	Q.insert({d[x.s], x.s});
			 }
	}

	
	memset(res, -1, sizeof(res));
	scanf("%d", &q);

	for (int i = 1; i <= q; ++i) {
		scanf("%d%d", &v, &u);
		gg[v].pb({i, {v, u}});
		gg[u].pb({i, {v, u}});
	}


	for (int i = 1; i <= n; ++i)  
		pp[i] = p[i] = i;


	sort(pp + 1, pp + 1 + n, cmp);	
	for (int i = 1; i <= n; ++i) {
		int v = pp[i];
		for (auto u : g[v])
			if (d[u.s] >= d[v]) 
				merge(v, u.s, d[v]);			
	}

	for (int i = 1; i <= q; ++i)
		printf("%d\n", res[i]);
}

Compilation message

plan.cpp:76:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
plan.cpp: In function 'int main()':
plan.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
plan.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v, &u, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:87:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &k);
  ~~~~~^~~~~~~~~~
plan.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v);
   ~~~~~^~~~~~~~~~
plan.cpp:107:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
plan.cpp:110:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &v, &u);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Correct 9 ms 5504 KB Output is correct
3 Correct 9 ms 5504 KB Output is correct
4 Correct 7 ms 5376 KB Output is correct
5 Correct 9 ms 5504 KB Output is correct
6 Correct 9 ms 5504 KB Output is correct
7 Correct 7 ms 5376 KB Output is correct
8 Correct 7 ms 5376 KB Output is correct
9 Correct 9 ms 5632 KB Output is correct
10 Correct 9 ms 5504 KB Output is correct
11 Correct 9 ms 5504 KB Output is correct
12 Correct 9 ms 5504 KB Output is correct
13 Correct 9 ms 5504 KB Output is correct
14 Correct 9 ms 5632 KB Output is correct
15 Correct 9 ms 5504 KB Output is correct
16 Correct 210 ms 18480 KB Output is correct
17 Correct 750 ms 34884 KB Output is correct
18 Correct 49 ms 8144 KB Output is correct
19 Correct 190 ms 18540 KB Output is correct
20 Correct 684 ms 34988 KB Output is correct
21 Correct 348 ms 23876 KB Output is correct
22 Correct 184 ms 17904 KB Output is correct
23 Correct 699 ms 35240 KB Output is correct
24 Correct 699 ms 35104 KB Output is correct
25 Correct 718 ms 34952 KB Output is correct
26 Correct 211 ms 18504 KB Output is correct
27 Correct 209 ms 18412 KB Output is correct
28 Correct 190 ms 18284 KB Output is correct
29 Correct 195 ms 18536 KB Output is correct
30 Correct 192 ms 18540 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 18168 KB Output is correct
2 Correct 596 ms 30776 KB Output is correct
3 Correct 626 ms 30712 KB Output is correct
4 Correct 90 ms 11384 KB Output is correct
5 Correct 577 ms 30744 KB Output is correct
6 Correct 597 ms 30840 KB Output is correct
7 Correct 610 ms 30712 KB Output is correct
8 Correct 644 ms 30840 KB Output is correct
9 Correct 654 ms 30840 KB Output is correct
10 Correct 656 ms 30840 KB Output is correct
11 Correct 604 ms 30712 KB Output is correct
12 Correct 648 ms 30716 KB Output is correct
13 Correct 618 ms 30816 KB Output is correct
14 Correct 633 ms 30840 KB Output is correct
15 Correct 667 ms 30968 KB Output is correct
16 Correct 629 ms 30840 KB Output is correct
17 Correct 613 ms 30712 KB Output is correct
18 Correct 643 ms 30864 KB Output is correct
19 Correct 93 ms 11384 KB Output is correct
20 Correct 677 ms 30736 KB Output is correct
21 Correct 558 ms 32044 KB Output is correct
22 Correct 131 ms 16876 KB Output is correct
23 Correct 104 ms 11896 KB Output is correct
24 Correct 122 ms 16744 KB Output is correct
25 Correct 135 ms 16876 KB Output is correct
26 Correct 123 ms 12280 KB Output is correct
27 Correct 85 ms 11384 KB Output is correct
28 Correct 143 ms 16872 KB Output is correct
29 Correct 93 ms 11384 KB Output is correct
30 Correct 146 ms 16872 KB Output is correct
31 Correct 103 ms 11384 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Correct 9 ms 5504 KB Output is correct
3 Correct 9 ms 5504 KB Output is correct
4 Correct 7 ms 5376 KB Output is correct
5 Correct 9 ms 5504 KB Output is correct
6 Correct 9 ms 5504 KB Output is correct
7 Correct 7 ms 5376 KB Output is correct
8 Correct 7 ms 5376 KB Output is correct
9 Correct 9 ms 5632 KB Output is correct
10 Correct 9 ms 5504 KB Output is correct
11 Correct 9 ms 5504 KB Output is correct
12 Correct 9 ms 5504 KB Output is correct
13 Correct 9 ms 5504 KB Output is correct
14 Correct 9 ms 5632 KB Output is correct
15 Correct 9 ms 5504 KB Output is correct
16 Correct 210 ms 18480 KB Output is correct
17 Correct 750 ms 34884 KB Output is correct
18 Correct 49 ms 8144 KB Output is correct
19 Correct 190 ms 18540 KB Output is correct
20 Correct 684 ms 34988 KB Output is correct
21 Correct 348 ms 23876 KB Output is correct
22 Correct 184 ms 17904 KB Output is correct
23 Correct 699 ms 35240 KB Output is correct
24 Correct 699 ms 35104 KB Output is correct
25 Correct 718 ms 34952 KB Output is correct
26 Correct 211 ms 18504 KB Output is correct
27 Correct 209 ms 18412 KB Output is correct
28 Correct 190 ms 18284 KB Output is correct
29 Correct 195 ms 18536 KB Output is correct
30 Correct 192 ms 18540 KB Output is correct
31 Correct 8 ms 5504 KB Output is correct
32 Correct 7 ms 5504 KB Output is correct
33 Correct 7 ms 5504 KB Output is correct
34 Correct 8 ms 5376 KB Output is correct
35 Correct 7 ms 5376 KB Output is correct
36 Correct 8 ms 5376 KB Output is correct
37 Correct 7 ms 5376 KB Output is correct
38 Correct 8 ms 5504 KB Output is correct
39 Correct 8 ms 5376 KB Output is correct
40 Correct 7 ms 5504 KB Output is correct
41 Correct 256 ms 18168 KB Output is correct
42 Correct 596 ms 30776 KB Output is correct
43 Correct 626 ms 30712 KB Output is correct
44 Correct 90 ms 11384 KB Output is correct
45 Correct 577 ms 30744 KB Output is correct
46 Correct 597 ms 30840 KB Output is correct
47 Correct 610 ms 30712 KB Output is correct
48 Correct 644 ms 30840 KB Output is correct
49 Correct 654 ms 30840 KB Output is correct
50 Correct 656 ms 30840 KB Output is correct
51 Correct 604 ms 30712 KB Output is correct
52 Correct 648 ms 30716 KB Output is correct
53 Correct 618 ms 30816 KB Output is correct
54 Correct 633 ms 30840 KB Output is correct
55 Correct 667 ms 30968 KB Output is correct
56 Correct 629 ms 30840 KB Output is correct
57 Correct 613 ms 30712 KB Output is correct
58 Correct 643 ms 30864 KB Output is correct
59 Correct 93 ms 11384 KB Output is correct
60 Correct 677 ms 30736 KB Output is correct
61 Correct 558 ms 32044 KB Output is correct
62 Correct 131 ms 16876 KB Output is correct
63 Correct 104 ms 11896 KB Output is correct
64 Correct 122 ms 16744 KB Output is correct
65 Correct 135 ms 16876 KB Output is correct
66 Correct 123 ms 12280 KB Output is correct
67 Correct 85 ms 11384 KB Output is correct
68 Correct 143 ms 16872 KB Output is correct
69 Correct 93 ms 11384 KB Output is correct
70 Correct 146 ms 16872 KB Output is correct
71 Correct 103 ms 11384 KB Output is correct
72 Correct 383 ms 24100 KB Output is correct
73 Correct 743 ms 35136 KB Output is correct
74 Correct 700 ms 35112 KB Output is correct
75 Correct 723 ms 35368 KB Output is correct
76 Correct 709 ms 35160 KB Output is correct
77 Correct 725 ms 35264 KB Output is correct
78 Correct 721 ms 35248 KB Output is correct
79 Correct 741 ms 35248 KB Output is correct
80 Correct 716 ms 35136 KB Output is correct
81 Correct 730 ms 35120 KB Output is correct
82 Correct 719 ms 35160 KB Output is correct
83 Correct 725 ms 35136 KB Output is correct
84 Correct 718 ms 35112 KB Output is correct
85 Correct 733 ms 35244 KB Output is correct
86 Correct 713 ms 34992 KB Output is correct
87 Correct 742 ms 35160 KB Output is correct
88 Correct 719 ms 35240 KB Output is correct
89 Correct 176 ms 18924 KB Output is correct
90 Correct 700 ms 35280 KB Output is correct
91 Correct 639 ms 35760 KB Output is correct
92 Correct 211 ms 20072 KB Output is correct
93 Correct 240 ms 27944 KB Output is correct
94 Correct 199 ms 20200 KB Output is correct
95 Correct 221 ms 20072 KB Output is correct
96 Correct 240 ms 28204 KB Output is correct
97 Correct 176 ms 19152 KB Output is correct
98 Correct 209 ms 20072 KB Output is correct
99 Correct 186 ms 19288 KB Output is correct
100 Correct 224 ms 20076 KB Output is correct