oj.uz

Submission #292245

# Submission time Handle Problem Language Result Execution time Memory
292245 2020-09-06T15:23:20 Z Marlov Mag (COCI16_mag) C++14
120 / 120
 495 ms 156844 KB 
/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pi;
 
#define maxN 1000005
#define INF 2000000000
 
long long N;
vector<long long> adj[maxN];
long long magic[maxN];
long long dp1[maxN];
long long f1[maxN];
long long dp2[maxN];
long long f2[maxN];
long long tmv=INF;
long long top=1;
long long bottom=1;
 
void na(long long t,long long b){
	if(t*bottom<top*b){
		top=t;
		bottom=b;
	}
}
 
 
void dfsbu(long long n,long long p){
 
	for(long long i:adj[n]) if(i!=p){
		dfsbu(i,n);
	}
 
	if(magic[n]>2) return;
 
	for(long long i:adj[n]) if(i!=p){
		if(magic[i]==1){
			if(dp1[i]>=dp1[n]){
				dp2[n]=dp1[n];
				f2[n]=f1[n];
				dp1[n]=dp1[i]+1;
				f1[n]=i;
			}else if(dp1[i]>=dp2[n]){
				dp2[n]=dp1[i]+1;
				f2[n]=i;
			}
		}
	}
}
 
void dfsud(long long n,long long p){
	
	if(magic[n]<3&&magic[p]==1){
		if(dp1[p]>=dp1[n]&&f1[p]!=n){
			dp2[n]=dp1[n];
			f2[n]=f1[n];
			dp1[n]=dp1[p]+1;
			f1[n]=p;
		}else if(dp2[p]>=dp1[n]&&f2[p]!=n){
			dp2[n]=dp1[n];
			f2[n]=f1[n];
			dp1[n]=dp2[p]+1;
			f1[n]=p;
		}else if(dp1[p]>=dp2[n]&&f1[p]!=n){
			dp2[n]=dp1[p]+1;
			f2[n]=p;
		}else if(dp2[p]>=dp2[n]&&f2[p]!=n){
			dp2[n]=dp2[p]+1;
			f2[n]=p;
		}
	}
	for(long long i:adj[n]) if(i!=p){
		dfsud(i,n);
	}
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>N;
	long long u,v;
	for(long long i=0;i<N-1;i++){
		cin>>u>>v;
		u--;v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for(long long i=0;i<N;i++){
		cin>>magic[i];
		tmv=min(tmv,magic[i]);
		f1[i]=-1;
		f2[i]=-1;
		dp1[i]=0;
		dp2[i]=0;
		//if(magic[i]==1) dp1[i]=1;
	}
	if(tmv>1){
		cout<<tmv<<"/"<<1<<'\n';
		return 0;
	}
	dfsbu(0,-1);
	dfsud(0,-1);
    for(long long i=0;i<N;i++){
		if(magic[i]==2&&dp1[i]==dp2[i]){
			na(2,(dp1[i]+dp2[i]+1));
		}else if(magic[i]==1){
			na(1,(dp1[i]+dp2[i]+1));
		}
	}

		cout<<top<<"/"<<bottom<<'\n';

	return 0;
}
 
/* stuff you should look for
	* long long overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23968 KB Output is correct
2 Correct 17 ms 23936 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 105396 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23808 KB Output is correct
2 Correct 483 ms 155908 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 153592 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 93820 KB Output is correct
2 Correct 306 ms 75384 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 96220 KB Output is correct
2 Correct 98 ms 31480 KB Output is correct
3 Correct 495 ms 156844 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 31480 KB Output is correct
2 Correct 406 ms 94144 KB Output is correct
3 Correct 466 ms 62168 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 89024 KB Output is correct
2 Correct 421 ms 92988 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 94712 KB Output is correct
2 Correct 421 ms 62060 KB Output is correct