oj.uz

Submission #334406

# Submission time Handle Problem Language Result Execution time Memory
334406 2020-12-09T06:08:55 Z Kerim Evacuation plan (IZhO18_plan) C++17
100 / 100
 840 ms 35396 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int dis[MAXN],ata[MAXN],id[MAXN],ans[MAXN],vis[MAXN];
vector<PII>adj[MAXN];
set<int>s[MAXN];
PII query[MAXN];
bool cmp(int x,int y){
	return dis[x]>dis[y];	
}
int tap(int x){
	if(ata[x]==x)
		return x;
	return ata[x]=tap(ata[x]);	
}
void merge(int x,int y,int val){
	if((x=tap(x))==(y=tap(y)))
		return;
	if((int)s[x].size()<(int)s[y].size())	
		swap(x,y);
	tr(it,s[y]){
		if(s[x].count(*it))
			ans[*it]=val;
		else
			s[x].insert(*it);
	}s[y].clear();
	ata[y]=x;
}
int main(){
   // freopen("file.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
    	int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		adj[u].pb(mp(v,w));
		adj[v].pb(mp(u,w));	
    }
    for(int i=1;i<=n;i++)
    	dis[i]=INF;
    int k;
    scanf("%d",&k);
    queue<int>q;
    for(int i=1;i<=k;i++){
    	int x;
		scanf("%d",&x);
		q.push(x);dis[x]=0;	
    }
    while(!q.empty()){
    	int nd=q.front();q.pop();	
    	tr(it,adj[nd])
    		if(umin(dis[it->ff],dis[nd]+it->ss))
    			q.push(it->ff);
    }
    int qq;
    scanf("%d",&qq);
    for(int i=1;i<=qq;i++){
    	int u,v;
		scanf("%d%d",&u,&v);
		s[u].insert(i);
		s[v].insert(i);
		query[i]=mp(u,v);
    }
    for(int i=1;i<=n;i++)
    	ata[i]=id[i]=i;
    sort(id+1,id+n+1,cmp);
    for(int i=1;i<=n;i++){
    	vis[id[i]]=1;
		tr(it,adj[id[i]])	
			if(vis[it->ff])
				merge(it->ff,id[i],dis[id[i]]);
    }
    for(int i=1;i<=qq;i++)
    	printf("%d\n",ans[i]);
	return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:89:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   89 |     for(int i=1;i<=qq;i++)
      |     ^~~
plan.cpp:91:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   91 |  return 0;
      |  ^~~~~~
plan.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
plan.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |   scanf("%d%d%d",&u,&v,&w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
plan.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |     scanf("%d",&k);
      |     ~~~~~^~~~~~~~~
plan.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |   scanf("%d",&x);
      |   ~~~~~^~~~~~~~~
plan.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |     scanf("%d",&qq);
      |     ~~~~~^~~~~~~~~~
plan.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |   scanf("%d%d",&u,&v);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 7 ms 7660 KB Output is correct
3 Correct 7 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct
10 Correct 7 ms 7532 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 7 ms 7532 KB Output is correct
13 Correct 7 ms 7532 KB Output is correct
14 Correct 7 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 7404 KB Output is correct
2 Correct 7 ms 7660 KB Output is correct
3 Correct 7 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct
10 Correct 7 ms 7532 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 7 ms 7532 KB Output is correct
13 Correct 7 ms 7532 KB Output is correct
14 Correct 7 ms 7532 KB Output is correct
15 Correct 7 ms 7532 KB Output is correct
16 Correct 389 ms 25964 KB Output is correct
17 Correct 840 ms 35396 KB Output is correct
18 Correct 43 ms 10476 KB Output is correct
19 Correct 215 ms 25696 KB Output is correct
20 Correct 838 ms 34668 KB Output is correct
21 Correct 482 ms 27884 KB Output is correct
22 Correct 288 ms 25580 KB Output is correct
23 Correct 808 ms 34668 KB Output is correct
24 Correct 795 ms 34656 KB Output is correct
25 Correct 752 ms 34536 KB Output is correct
26 Correct 215 ms 25568 KB Output is correct
27 Correct 214 ms 25696 KB Output is correct
28 Correct 222 ms 25568 KB Output is correct
29 Correct 216 ms 25696 KB Output is correct
30 Correct 228 ms 25832 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 6 ms 7404 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 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 6 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 201 ms 18412 KB Output is correct
2 Correct 471 ms 25580 KB Output is correct
3 Correct 477 ms 25580 KB Output is correct
4 Correct 82 ms 13676 KB Output is correct
5 Correct 504 ms 25580 KB Output is correct
6 Correct 449 ms 25560 KB Output is correct
7 Correct 450 ms 25580 KB Output is correct
8 Correct 456 ms 25636 KB Output is correct
9 Correct 472 ms 25420 KB Output is correct
10 Correct 458 ms 25484 KB Output is correct
11 Correct 456 ms 25580 KB Output is correct
12 Correct 440 ms 25552 KB Output is correct
13 Correct 437 ms 25408 KB Output is correct
14 Correct 435 ms 25580 KB Output is correct
15 Correct 424 ms 25324 KB Output is correct
16 Correct 443 ms 25400 KB Output is correct
17 Correct 449 ms 25488 KB Output is correct
18 Correct 466 ms 25580 KB Output is correct
19 Correct 82 ms 13676 KB Output is correct
20 Correct 467 ms 25580 KB Output is correct
21 Correct 402 ms 25108 KB Output is correct
22 Correct 73 ms 15072 KB Output is correct
23 Correct 87 ms 14188 KB Output is correct
24 Correct 76 ms 14944 KB Output is correct
25 Correct 72 ms 14944 KB Output is correct
26 Correct 92 ms 14280 KB Output is correct
27 Correct 81 ms 13676 KB Output is correct
28 Correct 78 ms 14944 KB Output is correct
29 Correct 88 ms 13676 KB Output is correct
30 Correct 78 ms 14944 KB Output is correct
31 Correct 85 ms 13676 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 7 ms 7660 KB Output is correct
3 Correct 7 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct
10 Correct 7 ms 7532 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 7 ms 7532 KB Output is correct
13 Correct 7 ms 7532 KB Output is correct
14 Correct 7 ms 7532 KB Output is correct
15 Correct 7 ms 7532 KB Output is correct
16 Correct 389 ms 25964 KB Output is correct
17 Correct 840 ms 35396 KB Output is correct
18 Correct 43 ms 10476 KB Output is correct
19 Correct 215 ms 25696 KB Output is correct
20 Correct 838 ms 34668 KB Output is correct
21 Correct 482 ms 27884 KB Output is correct
22 Correct 288 ms 25580 KB Output is correct
23 Correct 808 ms 34668 KB Output is correct
24 Correct 795 ms 34656 KB Output is correct
25 Correct 752 ms 34536 KB Output is correct
26 Correct 215 ms 25568 KB Output is correct
27 Correct 214 ms 25696 KB Output is correct
28 Correct 222 ms 25568 KB Output is correct
29 Correct 216 ms 25696 KB Output is correct
30 Correct 228 ms 25832 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 5 ms 7404 KB Output is correct
33 Correct 6 ms 7404 KB Output is correct
34 Correct 5 ms 7404 KB Output is correct
35 Correct 6 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 6 ms 7404 KB Output is correct
40 Correct 5 ms 7404 KB Output is correct
41 Correct 201 ms 18412 KB Output is correct
42 Correct 471 ms 25580 KB Output is correct
43 Correct 477 ms 25580 KB Output is correct
44 Correct 82 ms 13676 KB Output is correct
45 Correct 504 ms 25580 KB Output is correct
46 Correct 449 ms 25560 KB Output is correct
47 Correct 450 ms 25580 KB Output is correct
48 Correct 456 ms 25636 KB Output is correct
49 Correct 472 ms 25420 KB Output is correct
50 Correct 458 ms 25484 KB Output is correct
51 Correct 456 ms 25580 KB Output is correct
52 Correct 440 ms 25552 KB Output is correct
53 Correct 437 ms 25408 KB Output is correct
54 Correct 435 ms 25580 KB Output is correct
55 Correct 424 ms 25324 KB Output is correct
56 Correct 443 ms 25400 KB Output is correct
57 Correct 449 ms 25488 KB Output is correct
58 Correct 466 ms 25580 KB Output is correct
59 Correct 82 ms 13676 KB Output is correct
60 Correct 467 ms 25580 KB Output is correct
61 Correct 402 ms 25108 KB Output is correct
62 Correct 73 ms 15072 KB Output is correct
63 Correct 87 ms 14188 KB Output is correct
64 Correct 76 ms 14944 KB Output is correct
65 Correct 72 ms 14944 KB Output is correct
66 Correct 92 ms 14280 KB Output is correct
67 Correct 81 ms 13676 KB Output is correct
68 Correct 78 ms 14944 KB Output is correct
69 Correct 88 ms 13676 KB Output is correct
70 Correct 78 ms 14944 KB Output is correct
71 Correct 85 ms 13676 KB Output is correct
72 Correct 490 ms 28396 KB Output is correct
73 Correct 791 ms 34732 KB Output is correct
74 Correct 781 ms 34704 KB Output is correct
75 Correct 770 ms 35004 KB Output is correct
76 Correct 764 ms 34796 KB Output is correct
77 Correct 750 ms 34796 KB Output is correct
78 Correct 762 ms 34772 KB Output is correct
79 Correct 760 ms 34796 KB Output is correct
80 Correct 780 ms 34752 KB Output is correct
81 Correct 764 ms 34540 KB Output is correct
82 Correct 744 ms 34696 KB Output is correct
83 Correct 755 ms 34588 KB Output is correct
84 Correct 748 ms 34728 KB Output is correct
85 Correct 758 ms 34796 KB Output is correct
86 Correct 756 ms 34836 KB Output is correct
87 Correct 775 ms 35052 KB Output is correct
88 Correct 789 ms 35024 KB Output is correct
89 Correct 364 ms 26092 KB Output is correct
90 Correct 763 ms 34796 KB Output is correct
91 Correct 715 ms 34540 KB Output is correct
92 Correct 358 ms 24792 KB Output is correct
93 Correct 530 ms 25712 KB Output is correct
94 Correct 352 ms 24672 KB Output is correct
95 Correct 389 ms 25176 KB Output is correct
96 Correct 620 ms 24728 KB Output is correct
97 Correct 448 ms 24496 KB Output is correct
98 Correct 399 ms 25032 KB Output is correct
99 Correct 436 ms 24548 KB Output is correct
100 Correct 371 ms 25156 KB Output is correct