oj.uz

답안 #551975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551975 2022-04-22T04:39:31 Z aadit_ambadkar Burza (COCI16_burza) C++11
160 / 160
 66 ms 3288 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 dad, int nod)
{
    if(nod)
        level[nod] = level[dad] + 1;
    if(level[nod] == k-1)
    {
        st[nod] = pz++;
        dr[nod] = pz;
        return;
    }
    st[nod] = pz;
    for(int i = 0; i < v[nod].size(); ++i)
    {
        int vecin = v[nod][i];
        if(vecin == dad)
            continue;
        dfs(nod, vecin);
    }
    dr[nod] = 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(-1, 0);
    cout << (solve() ? "DA\n" : "NE\n");
}

Compilation message

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

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 37 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 980 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 2716 KB Output is correct
2 Correct 42 ms 2536 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 64 ms 2964 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 2768 KB Output is correct
2 Correct 41 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 468 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1228 KB Output is correct
2 Correct 58 ms 3288 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 340 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 2260 KB Output is correct
2 Correct 51 ms 2792 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 2640 KB Output is correct
2 Correct 46 ms 2724 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 848 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 2972 KB Output is correct
2 Correct 52 ms 2692 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 58 ms 3076 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1144 KB Output is correct
2 Correct 49 ms 2688 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #9
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 59 ms 2940 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #10
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 1668 KB Output is correct
2 Correct 57 ms 2904 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 22 ms 1620 KB Output is correct
6 Correct 1 ms 596 KB Output is correct