oj.uz

Submission #551982

# Submission time Handle Problem Language Result Execution time Memory
551982 2022-04-22T04:43:30 Z aadit_ambadkar Burza (COCI16_burza) C++11
48 / 160
 76 ms 2784 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
 
vector<int>v[402], q[402];
int n, k, level[402], st[402], dr[402], pz;
void dfs(int u, int p) {
    if (u==p) return;
    if (u) {
        level[u]=level[p]+1;
    }
    if (level[u]==k-1) {
        st[u]=pz++;
        dr[u]=pz;
    }
    st[u]=pz;
    for (auto i : v[u]) {
        if (i!=p) dfs(i, u);
    }
    dr[u]=pz;
}
bool dp[402][(1<<20)];
bool solve()
{
    dp[0][0] = 1;
    for(int i = 1; i < n; ++i)
        q[st[i]].push_back(i);
 
    for(int i = 0; i < pz; ++i)
    {
        for(int j = 0; j < (1<<k); ++j)
        {
            if (!dp[i][j])
                continue;
            for(int jj = 0; jj < q[i].size(); ++jj)
            {
                int it = q[i][jj];
                if (!(j >> level[it] & 1))
                    dp[dr[it]][j | (1<<level[it])] = 1;
            }
        }
    }
    for(int j = 0; j < (1<<k); ++j)
        if (dp[pz][j])
            return 1;
 
    return 0;
}
int main() {
    cin >> n >> k;
    if (k*k >= n) {
        cout << "DA\n";
        return 0;
    }
    for (int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        a--; b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    level[0]=-1;
    dfs(0, -1);
    cout << (solve() ? "DA\n" : "NE\n");
}

Compilation message

burza.cpp: In function 'bool solve()':
burza.cpp:36:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |             for(int jj = 0; jj < q[i].size(); ++jj)
      |                             ~~~^~~~~~~~~~~~~

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 59 ms 2524 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2504 KB Output is correct
2 Correct 59 ms 2508 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 65 ms 2384 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 63 ms 2492 KB Output is correct
2 Correct 67 ms 2600 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1108 KB Output is correct
2 Correct 54 ms 2508 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 724 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2324 KB Output is correct
2 Correct 54 ms 2488 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 852 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 2436 KB Output is correct
2 Correct 54 ms 2508 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 596 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 2636 KB Output is correct
2 Correct 56 ms 2320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 66 ms 2764 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1040 KB Output is correct
2 Correct 64 ms 2364 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 724 KB Output is correct
2 Correct 68 ms 2400 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 596 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1396 KB Output is correct
2 Correct 67 ms 2784 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 24 ms 1476 KB Output isn't correct
6 Halted 0 ms 0 KB -