oj.uz

답안 #40962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40962 2018-02-10T14:52:33 Z Kerim 관광 (NOI14_sightseeing) C++14
15 / 25
 3500 ms 101500 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],cnt;
vector<int>s[MAXN];
vector<PII>adj[MAXN];
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;
	int root=tap(1);
	if(x==root){
		tr(it,s[y]){
			cnt--;
			ans[*it]=val;
			s[x].pb(*it);
		}
		s[y].clear();
		ata[y]=x;
	}
	else if(y==root){
		tr(it,s[x]){
			cnt--;
			ans[*it]=val;
			s[y].pb(*it);
		}
		s[x].clear();
		ata[x]=y;
	}
	else{
		if(s[x].size()<s[y].size())
			swap(x,y);
		tr(it,s[y])
			s[x].pb(*it);
		s[y].clear();
		ata[y]=x;	
	}
}
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,s[i].pb(i);
	cnt=n-1;	
	for(int i=1;i<=m;i++){
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		adj[w].pb(mp(u,v));
	}
	for(int i=MAXN-1;i>=0;i--){
		if(cnt==0)
			break;
		tr(it,adj[i])
			merge(it->ff,it->ss,i);
	}
	while(q--){
		int x;
		scanf("%d",&x);
		printf("%d\n",ans[x]);
	}
	return 0;
}

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:68: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:74: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:85: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 24 ms 23800 KB Output is correct
2 Correct 24 ms 23904 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 27264 KB Output is correct
2 Correct 63 ms 27264 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2493 ms 82664 KB Output is correct
2 Execution timed out 3607 ms 101500 KB Time limit exceeded