oj.uz

Submission #720608

# Submission time Handle Problem Language Result Execution time Memory
720608 2023-04-08T15:31:12 Z Ahmed57 Mag (COCI16_mag) C++14
0 / 120
 4000 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;
vector<int> adj[1000006];
int ma[1000006];
int lon[1000006];
int pref[1000006];
int suf[1000006];vector<int> ch;
int n ;
void calc(int i,int pr){
    int ch = (ma[i]==1?1:0);
    for(auto j:adj[i]){
        if(j!=pr){
            calc(j,i);
            if(ma[i]==1)ch = max(ch,lon[j]+1);
        }
    }
    lon[i] = ch;
}
int maa = 0;
void dfs(int i,int pr){
    maa = max(maa,lon[i]);
    for(auto j:adj[i]){
        if(j==pr)continue;
        dfs(j,i);
    }
    if(ma[i]==1){
        int firstma = 0 , secondma = 0;
        for(auto j:adj[i]){
            if(j==pr)continue;
            if(firstma<=lon[j]){
                secondma = firstma;
                firstma = lon[j];
            }else if(secondma<=lon[j]){
                secondma = lon[j];
            }
        }
        maa = max(maa,firstma+secondma+1);
    }
}
bool ss = 0;int mm = 0;
void reroor(int i,int pr,int cnt){
    if(ma[i]==2){
        int firstma = cnt , secondma = 0;
        for(auto j:adj[i]){
            if(j==pr)continue;
            if(firstma<=lon[j]){
                secondma = firstma;
                firstma = lon[j];
            }else if(secondma<=lon[j]){
                secondma = lon[j];
            }
        }
        if(firstma==secondma&&firstma==maa){
            ss = 1;
        }
    }
    ch.clear();
    mm = 0;
    for(auto j:adj[i]){
        if(j==pr)continue;
        pref[j] = mm;
        mm = max(mm,lon[j]);
        ch.push_back(j);
    }
    mm = cnt;
    reverse(ch.begin(),ch.end());
    for(auto j:ch){
        suf[j] = mm;
        mm = max(mm,lon[j]);
    }
    for(auto j:adj[i]){
        reroor(j,i,(ma[i]==1?max(suf[j],pref[j])+1:0));
    }
}
signed main(){
    cin>>n;
    for(int i = 0;i<n-1;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    int mi = 1e9;
    for(int i = 0;i<n;i++){
        cin>>ma[i+1];
        mi = min(mi,ma[i+1]);
    }
    if(mi!=1){
        cout<<mi<<"/"<<1<<endl;
        return 0;
    }
    calc(1,0);
    dfs(1,0);
    reroor(1,0,0);
    if(ss) cout<<2<<"/"<<2*maa+1<<endl;
    else cout<<1<<"/"<<maa<<endl;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Runtime error 122 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 120 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 819 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 121 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 978 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4056 ms 100908 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4049 ms 73404 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 221 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4069 ms 65860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 891 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -