oj.uz

Submission #242586

# Submission time Handle Problem Language Result Execution time Memory
242586 2020-06-28T10:17:04 Z Vimmer Burza (COCI16_burza) C++14
48 / 160
 1000 ms 27264 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 N 405
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

vector <int> g[N];

int n, k, h[N], mx_h[N], kl[N][N], koler[N], id[20];

bool f[N][N], dp[N], dpr[N][(1 << 16)], fr[(1 << 16)];

void check(int v, int it, int cur)
{
    if (cur == k)
    {
        int msk = 0, smsk = 0;

        for (int i = 0; i < k; i++)
            if (id[i] == 1) msk |= (1 << i); else if (id[i] == 2) smsk |= (1 << i);

        if (!dpr[it][smsk] || !dpr[v][msk]) return;

        fr[smsk | msk] = 1;

        return;
    }

    for (int i = 0; i < 3; i++)
    {
        id[cur] = i;

        check(v, it, cur + 1);
    }
}
void dfs(int v, int p)
{
    if (p != -1) h[v] = h[p] + 1;

    mx_h[v] = h[v];

    if (h[v] == k)
        {
            for (int i = 0; i < N; i++) {kl[v][i] = 1e9; f[v][i] = 0;}

            for (int i = 0; i < k; i++) {kl[v][i] = 1; f[v][i] = 1;}

            return;
        }

    for (auto it : g[v])
    {
        if (it == p) continue;

        dfs(it, v);

        mx_h[v] = max(mx_h[v], mx_h[it]);

        if (mx_h[it] >= k)
        {
            for (int i = 0; i < N; i++) {dp[i] = 0; koler[i] = 1e9;}

            for (int i = 0; i < k; i++)
                  {
                      if (!f[v][i]) continue;

                      for (int u = i + kl[v][i]; u < k; u++)
                          if (f[it][u]) {koler[i] = min(koler[i], kl[v][i] + kl[it][u]); dp[i] = 1;}
                  }

            for (int i = 0; i < N; i++) {kl[v][i] = koler[i]; f[v][i] = dp[i];}
        }
    }

    for (int i = 0; i < h[v]; i++) if (!f[v][i] || kl[v][i] > 1) {kl[v][i] = 1; f[v][i] = 1;}
}

void rec(int v, int p)
{
    if (h[v] == k) {for (int i = 0; i < k; i++) dpr[v][(1 << i)] = 1; return;}

    for (auto it : g[v])
      if (it != p && mx_h[it] >= k)
      {
            rec(it, v);

            memset(fr, 0, sizeof(fr));

            check(v, it, 0);

            for (int msk = 0; msk < (1 << k); msk++) dpr[v][msk] = fr[msk];
      }

    for (int i = 0; i < h[v]; i++) dpr[v][(1 << i)] = 1;
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

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

    cin >> n >> k;

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

        cin >> x >> y;

        g[x].pb(y);

        g[y].pb(x);
    }

    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++) {kl[i][j] = 0; f[i][j] = 1;}

    dfs(1, -1);

    bool gd = 0;

    if (k <= 16)
    {
        memset(dpr, 1, sizeof(dpr));

        rec(1, -1);

        for (int msk = 0; msk < (1 << k); msk++) gd |= dpr[1][msk];
    }
    if (f[1][0] || gd) {cout << "DA" << endl; exit(0);}

    cout << "NE" << endl;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 27136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Incorrect 6 ms 1152 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 32 ms 27136 KB Output is correct
6 Correct 19 ms 27264 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 27136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 7 ms 1152 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 36 ms 27136 KB Output is correct
6 Correct 21 ms 27136 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 7 ms 1152 KB Output is correct
4 Correct 11 ms 1152 KB Output is correct
5 Correct 19 ms 27136 KB Output is correct
6 Correct 24 ms 27136 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 9 ms 1152 KB Output is correct
5 Incorrect 6 ms 1152 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 27136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 27136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 27136 KB Time limit exceeded
2 Halted 0 ms 0 KB -