제출 #274458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
274458		kshitij_sodani	Mag (COCI16_mag)	C++14	120 / 120	651 ms	262144 KiB

mag

#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define all(x) x.begin(),x.end()
void setIO(string s){
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
 
pair<llo,llo> ans;
vector<llo> adj[1000001];
vector<pair<llo,llo>> kk[1000001];
llo it[1000001];
llo dp[1000001];
llo n;
void remin(pair<llo,llo> xx){
	llo yo=__gcd(xx.a,xx.b);
	xx.a/=yo;
	xx.b/=yo;
	if(xx.a*ans.b<xx.b*ans.a){
		ans=xx;
	}
}
void dfs(llo no,llo par=-1,llo co=0){
	co+=1;
	if(it[no]>1){
		co=0;
	}
	llo ma=0;
	for(auto j:adj[no]){
		if(j==par){
			continue;
		}
		dfs(j,no,co);
		ma=max(ma,dp[j]);
		kk[no].pb({dp[j],j});
	}
	sort(all(kk[no]));
	reverse(all(kk[no]));
	llo cc=0;
	for(llo i=0;i<kk[no].size();i++){
		if(i==2){
			break;
		}
		cc+=kk[no][i].a;
	}
	remin({it[no],1+cc});
	if(it[no]==1){
		dp[no]=ma+1;
	}
}
void dfs2(llo no,llo par=-1,llo co=0){
	llo kp=co+1;
	if(kk[no].size()){
		kp+=kk[no][0].a;
	}
	remin({it[no],kp});
	if(it[no]==1){
		co+=1;
	}
	else{
		co=0;
	}
	llo ma=0;
	for(auto j:adj[no]){
		if(j==par){
			continue;
		}
		llo se=0;
		if(it[no]==1){
			se=max(se,co);
			llo su=1;
			for(int i=0;i<2;i++){
				if(i==kk[no].size()){
					break;
				}
				if(kk[no][i].b==j){
					continue;
				}
				su+=kk[no][i].a;
				break;
			}
			se=max(se,su);
		}
		dfs2(j,no,se);
	}
 
 
}
 
 
 
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n-1;i++){
		llo aa,bb;
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
	}
	for(llo i=0;i<n;i++){
		cin>>it[i];
	}
	ans={it[0],1};
	dfs(0);
	dfs2(0);
	cout<<ans.a<<"/"<<ans.b<<endl;
 
 
 
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

mag.cpp: In function 'void dfs(llo, llo, llo)':
mag.cpp:45:15: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long int'} and 'std::vector<std::pair<long int, long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(llo i=0;i<kk[no].size();i++){
      |              ~^~~~~~~~~~~~~~
mag.cpp: In function 'void dfs2(llo, llo, llo)':
mag.cpp:78:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long int, long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     if(i==kk[no].size()){
      |        ~^~~~~~~~~~~~~~~
mag.cpp:68:6: warning: unused variable 'ma' [-Wunused-variable]
   68 |  llo ma=0;
      |      ^~
mag.cpp: In function 'void setIO(std::string)':
mag.cpp:10:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   10 |  freopen((s+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mag.cpp:11:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   11 |  freopen((s+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12