Submission #366577

#	Time	Username	Problem	Language	Result	Execution time	Memory
366577		maozkurt	Mag (COCI16_mag)	C++17	12 / 120	383 ms	85484 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];
bool visited[maxn];

int dfs1(int v){
    int ret = 1;
    
    for(int i : adj[v]){
        if(magic[i] == 1 && !visited[i]){
            visited[i] = true;
            ret += dfs1(i);
        }
    }

    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;

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

    int maxx = 0;
    for(int i=1;i<=n;i++){
        if(!visited[i] && magic[i] == 1){
            visited[i] = true;
            maxx = max(maxx, dfs1(i));
        }
    }

    cout << 1 << '/' << maxx << endl;

    


}

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