oj.uz

답안 #40966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40966 2018-02-10T15:05:22 Z Kerim 관광 (NOI14_sightseeing) C++14
15 / 25
 3500 ms 95732 KB 
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx") 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include "bits/stdc++.h"
#define MAXN 500009
#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 ata[MAXN],ans[MAXN],sz[MAXN];
vector<PII>s[MAXN],adj[MAXN];
int tap(int x){
	if(ata[x]==x)
		return x;
	return ata[x]=tap(ata[x]);		
}
bool merge(int x,int y,int val){
	if((x=tap(x))==(y=tap(y)))
		return 0;
	if(sz[x]<sz[y])
		swap(x,y);
	sz[x]+=sz[y];	
	ata[y]=x;return 1;
}
void dfs(int nd,int pr,int mn){
	ans[nd]=mn;
	tr(it,adj[nd])
		if(it->ff!=pr)
			dfs(it->ff,nd,min(mn,it->ss));
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,m,q;
    scanf("%d%d%d",&n,&m,&q);
    for(int i=1;i<=n;i++)	
		ata[i]=i,sz[i]=1;
	for(int i=1;i<=m;i++){
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		s[w].pb(mp(u,v));
	}
	for(int i=MAXN-1;i>=0;i--){
		tr(it,s[i]){
			if(merge(it->ff,it->ss,i)){
				adj[it->ff].pb(mp(it->ss,i));
				adj[it->ss].pb(mp(it->ff,i));
			}
		}
	}
	dfs(1,-1,INF);
	while(q--){
		int x;
		scanf("%d",&x);
		printf("%d\n",ans[x]);
	}
	return 0;
}

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:50:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&q);
                             ^
sightseeing.cpp:55:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&u,&v,&w);
                           ^
sightseeing.cpp:69:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23796 KB Output is correct
2 Correct 23 ms 23904 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23980 KB Output is correct
2 Correct 25 ms 24104 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 26980 KB Output is correct
2 Correct 59 ms 26980 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2459 ms 78348 KB Output is correct
2 Execution timed out 3590 ms 95732 KB Time limit exceeded