oj.uz

답안 #372493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372493 2021-02-28T13:25:29 Z Atill83 Uzastopni (COCI15_uzastopni) C++14
160 / 160
 22 ms 11244 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int joke[MAXN];
vector<int> adj[MAXN];
bool vr[MAXN];
pair<vector<int>, vector<int>> dfs(int v){
    vector<pair<int, pair<vector<int>, vector<int>>>> ls, gr;
    vector<bool> can(101, 0);
    for(int j: adj[v]){
        auto c = dfs(j);
        if(joke[j] < joke[v]){
            ls.push_back({joke[j], c});
        }else if(joke[j] > joke[v])
            gr.push_back({joke[j], c});
    }
    sort(ls.begin(), ls.end(), [](auto u, auto v){
        return u.ff > v.ff;
    });
    sort(gr.begin(), gr.end(), [](auto u, auto v){
        return u.ff < v.ff;
    });
    can[joke[v]] = 1;
    for(auto &u: ls){
        bool cn = 0;
        for(auto x: u.ss.ss){
            if(x < joke[v] && can[x + 1]){
                cn = 1;
                break;
            }
        }

        if(cn){
            for(auto x: u.ss.ff){
                can[x] = 1;
            }
        }
    }

    for(auto &u: gr){
        bool cn = 0;
        for(auto x: u.ss.ff){
            if(x > joke[v] && can[x - 1]){
                cn = 1;
                break;
            }
        }

        if(cn){
            for(auto x: u.ss.ss){
                can[x] = 1;
            }
        }
    }


    vector<int> sl, sg;

    for(int i = 1; i <= joke[v]; i++){
        if(can[i])  
            sl.push_back(i);
    }
    
    for(int i = joke[v]; i <= 100; i++){
        if(can[i])  
            sg.push_back(i);
    }

    return make_pair(sl, sg);
}



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

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


    auto ans = dfs(1);
    cout<<(ans.ff.size()) * (ans.ss.size());


    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct
11 Correct 16 ms 7660 KB Output is correct
12 Correct 16 ms 7660 KB Output is correct
13 Correct 16 ms 7660 KB Output is correct
14 Correct 20 ms 11244 KB Output is correct
15 Correct 20 ms 11244 KB Output is correct
16 Correct 22 ms 11244 KB Output is correct
17 Correct 16 ms 7660 KB Output is correct
18 Correct 16 ms 7660 KB Output is correct
19 Correct 19 ms 7788 KB Output is correct
20 Correct 18 ms 7788 KB Output is correct