oj.uz

답안 #251825

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

bool mk[105];

vector <int> val[105], gr;

set <int> st[N];

vector <int> g[N];

bool bad, found;

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 (nxt == 0) {bad = 1; return;}

        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];}
bool cmpr(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];
    }
}

void rec(int v, int r)
{
    if (r + 1 == v)
    {
        bad = 0;

        vector <int> pr = gr;

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

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

        if (!bad) {found = 1; ans++;}
    }
    else
    {
        for (auto it : val[v])
        {
            gr.pb(it);

            st[it].clear();

            rec(v + 1, r);

            if (found) break;
        }
    }

    if (sz(gr) != 0) gr.pop_back();
}
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 (int i = 1; i <= 100; i++) sort(val[i].begin(), val[i].end(), cmpr);

    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;

            found = 0;

            rec(l, r);
        }


    cout << ans << endl;
}

Subtask #1
64.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1089 ms 1024 KB Time limit exceeded
2 Execution timed out 1084 ms 1024 KB Time limit exceeded
3 Execution timed out 1086 ms 1024 KB Time limit exceeded
4 Incorrect 38 ms 1024 KB Output isn't correct
5 Incorrect 33 ms 1024 KB Output isn't correct
6 Correct 12 ms 1024 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 4 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Execution timed out 1081 ms 1656 KB Time limit exceeded
12 Execution timed out 1083 ms 1792 KB Time limit exceeded
13 Correct 6 ms 1408 KB Output is correct
14 Execution timed out 1080 ms 2040 KB Time limit exceeded
15 Execution timed out 1088 ms 2044 KB Time limit exceeded
16 Execution timed out 1042 ms 1912 KB Time limit exceeded
17 Correct 6 ms 1408 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct
19 Execution timed out 1099 ms 1280 KB Time limit exceeded
20 Execution timed out 1093 ms 1400 KB Time limit exceeded