oj.uz

답안 #251769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251769 2020-07-22T09:46:15 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
48 / 160
 20 ms 1920 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10010
#define M ll(10007)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 3> a3;
typedef array <int, 4> a4;
typedef pair <int, int> pt;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int n, val[105], ans, from[N], a[N], siz[N], h[N], l, r;

set <int> st[N];

vector <int> g[N];

bool bad;

void dfs_rev(int v)
{
    st[v].insert(a[v]);

    int lst = -1;

    for (auto it : st[v])
    {
        if (lst != -1 && it - lst != 1) {bad = 1; return;}

        lst = it;
    }

    if (v != 1)
    {
        int nxt = from[v];

        if (sz(st[nxt]) < sz(st[v])) swap(st[v], st[nxt]);

        for (auto it : st[v]) st[nxt].insert(it);
    }
    else if (r - l + 1 != sz(st[v])) bad = 1;

}

bool cmp(int x, int y) {return h[x] > h[y];}

void dfs(int v)
{
    siz[v] = 1;

    for (auto it : g[v])
    {
        h[it] = h[v] + 1;

        dfs(it);

        siz[v] += siz[it];
    }
}

int main()
{
    //freopen("mining.in", "r", stdin); freopen("mining.out", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    for (int i = 1; i <= n; i++) {cin >> a[i]; val[a[i]] = i;}

    for (int i = 1; i < n; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);

        from[y] = x;
    }

    dfs(1);

    for (l = 1; l <= 100; l++)
        for (r = l; r <= 100; r++)
            if (l <= a[1] && a[1] <= r)
            {
                bad = 0;

                vector <int> gr; gr.clear();

                for (int i = l; i <= r; i++) if (val[i] == 0) {bad = 1; break;} else {gr.pb(val[i]); st[val[i]].clear();}

                if (bad) continue;

                sort(gr.begin(), gr.end(), cmp);

                for (auto it : gr) {dfs_rev(it); if (bad) break;}

                if (!bad) ans++;
            }

    cout << ans << endl;
}

Subtask #1
48.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1024 KB Output isn't correct
2 Incorrect 1 ms 1024 KB Output isn't correct
3 Incorrect 1 ms 1024 KB Output isn't correct
4 Incorrect 1 ms 1024 KB Output isn't correct
5 Incorrect 1 ms 1024 KB Output isn't correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Incorrect 1 ms 1024 KB Output isn't correct
10 Incorrect 1 ms 1024 KB Output isn't correct
11 Incorrect 5 ms 1408 KB Output isn't correct
12 Incorrect 4 ms 1408 KB Output isn't correct
13 Correct 4 ms 1408 KB Output is correct
14 Incorrect 18 ms 1920 KB Output isn't correct
15 Incorrect 14 ms 1920 KB Output isn't correct
16 Incorrect 17 ms 1920 KB Output isn't correct
17 Correct 7 ms 1408 KB Output is correct
18 Correct 4 ms 1408 KB Output is correct
19 Incorrect 20 ms 1280 KB Output isn't correct
20 Incorrect 19 ms 1280 KB Output isn't correct