oj.uz

답안 #372490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372490 2021-02-28T12:26:49 Z Atill83 Uzastopni (COCI15_uzastopni) C++14
128 / 160
 13 ms 9964 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];

pii dfs(int v){
    vector<pair<int, pii>> ls, gr;
    vector<bool> can(101);
    for(int j: adj[v]){
        pii 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(), greater<pair<int, pii>>());
    sort(gr.begin(), gr.end());
    can[joke[v]] = 1;
    for(auto &u: ls){
        u.ss.ss = min(u.ss.ss, joke[v] - 1);
        bool cn = 0;

        for(int j = u.ff + 1; j <= u.ss.ss + 1; j++){
            if(can[j]){
                cn = 1;
                break;
            }
        }

        if(cn){
            for(int j = u.ss.ff; j <= u.ff; j++)
                can[j] = 1;
        }
    }

    for(auto &u: gr){
        u.ss.ff = max(u.ss.ff, joke[v] + 1);
        bool cn = 0;

        for(int j = u.ss.ff - 1; j < u.ff; j++){
            if(can[j]){
                cn = 1;
                break;
            }
        }
        if(cn){
            for(int j = u.ff; j <= u.ss.ss; j++){
                can[j] = 1;
            }
        }
    }
    int mn = 0, mx = 100; 
    
    while(!can[mn])
        mn++;

    while(!can[mx])
        mx--;
    
    return make_pair(mn, mx);
}



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);
    }


    pii ans = dfs(1);

    cout<<(joke[1] - ans.ff + 1) * (ans.ss - joke[1] + 1);


    

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

Subtask #1
128.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 7404 KB Output isn't correct
2 Correct 5 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 Incorrect 5 ms 7404 KB Output isn't correct
6 Correct 6 ms 7444 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 5 ms 7404 KB Output is correct
11 Incorrect 12 ms 7788 KB Output isn't correct
12 Incorrect 10 ms 7660 KB Output isn't correct
13 Correct 11 ms 7660 KB Output is correct
14 Correct 12 ms 9964 KB Output is correct
15 Correct 13 ms 9964 KB Output is correct
16 Correct 13 ms 9964 KB Output is correct
17 Correct 11 ms 7660 KB Output is correct
18 Correct 12 ms 7660 KB Output is correct
19 Correct 11 ms 7660 KB Output is correct
20 Correct 9 ms 7660 KB Output is correct