oj.uz

답안 #251796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251796 2020-07-22T10:17:16 Z Vimmer Uzastopni (COCI15_uzastopni) C++14
24 / 160
 24 ms 16784 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 100010
#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, ans, from[N], a[N], siz[N], h[N], l, r;

bool mk[105];

vector <int> val[105];

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]].pb(i); mk[a[i]] = 1;}

    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++)
      if (mk[l])
        for (r = l; r <= 100; r++)
        {
            if (!mk[r]) break;

            if (!(l <= a[1] && a[1] <= r)) continue;

            bad = 0;

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

            for (int i = 1; i <= n; i++) st[val[i].back()].clear();

            for (int i = l; i <= r; i++) gr.pb(val[i].back());

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

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

            if (!bad) ans++;
            else
            {
                bad = 0;

                gr.clear();

                for (int i = 1; i <= n; i++) st[val[i][0]].clear();

                for (int i = l; i <= r; i++) gr.pb(val[i][0]);

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

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

                if (!bad) ans++;
            }
        }

    cout << ans << endl;
}

Subtask #1
24.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 14720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 13 ms 14720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 13 ms 14720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 16 ms 14848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 18 ms 14720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Correct 18 ms 7424 KB Output is correct
7 Correct 22 ms 7424 KB Output is correct
8 Correct 9 ms 7424 KB Output is correct
9 Runtime error 12 ms 14720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 12 ms 14848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 17 ms 15616 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 23 ms 15488 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 23 ms 15488 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 17 ms 16768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 16 ms 16640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 24 ms 16784 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 18 ms 15488 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 16 ms 15488 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 17 ms 15360 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 15 ms 15360 KB Execution killed with signal 11 (could be triggered by violating memory limits)