제출 #369787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
369787		maozkurt	Mag (COCI16_mag)	C++17	84 / 120	4041 ms	80236 KiB

mag

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <numeric>
#include <cassert>

#define endl '\n'
#define sp ' '

#define pb push_back
#define mp make_pair
#define ff first
#define ss second

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn = 1e6+5;
const int inf = 1e9;

vector<int> adj[maxn];
int magic[maxn];
int visited[maxn];

int dfs1(int v, int s, int d){
    int ret = 1;

    if(d==1 && s==-1){
        int maxx=0,iki=0;
        for(int i : adj[v]){
            if(magic[i] == 1 && visited[i]!=s){
                visited[i] = s;
                int cur = dfs1(i,s,0);
                if(cur > maxx){
                    iki = maxx;
                    maxx = cur;
                }
                else if(cur > iki){
                    iki = cur;
                }
            }
        }
        return maxx+iki+1; 
    }
    else{
        for(int i : adj[v]){
            if(magic[i] == 1 && visited[i]!=s){
                visited[i] = s;
                ret = max(ret,dfs1(i,s,0)+1);
            }
        }
    }

    return ret;
}

int main(){

    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cerr.tie(nullptr);

    int n;cin>>n; 

    for(int i=0;i<n-1;i++){
        int a,b;cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    int minn = inf;

    vector<int> iki;
    for(int i=1;i<=n;i++){
        cin>>magic[i];
        minn = min(minn, magic[i]);
        if(magic[i] == 2)
            iki.pb(i);
    }   
    if(minn != 1){
        cout << minn << '/' << 1 << endl;
        exit(0);
    }

    int ikimaxx = 0;
    for(int i : iki){
        int birmaxx = -1;
        int biriki = -1;
        int birr = 0;
        for(int v : adj[i]){
            if(magic[v]==1)
                birr++;
        }       
        if(birr<2)
            continue;
        for(int v : adj[i]){
            if(magic[v] == 1){
                visited[v] = i;
                int cur = dfs1(v,i,0);
                if(cur>birmaxx){
                    biriki = birmaxx;
                    birmaxx = cur;
                }
                else if(cur>biriki){
                    biriki = cur;
                }
            }
        }
        cerr << i << sp << biriki << sp << birmaxx << endl;
        if(birmaxx != -1 && biriki != -1){
            ikimaxx = max(ikimaxx, birmaxx + biriki);
        }
    }

    int maxx = 0;
    for(int i=1;i<=n;i++){
        if(visited[i]!=-1 && magic[i] == 1){
            visited[i] = -1;
            maxx = max(maxx, dfs1(i,-1,1));
        }
    }
    if(2*maxx >= ikimaxx+1){
        cout << 1 << '/' << maxx << endl;
    }
    else{
        cout << ((ikimaxx+1)%2==0 ? 1 : 2) << '/' << ((ikimaxx+1)%2==0?(ikimaxx+1)/2:ikimaxx+1) << endl;
    }



}

• 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: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 12 / 12
• Subtask 10: 0 / 12