oj.uz

답안 #1024084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024084 2024-07-15T11:36:53 Z caterpillow Burza (COCI16_burza) C++17
144 / 160
 576 ms 410812 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

#define char unsigned char

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
int n, k, t;
vt<vt<int>> adj;
vt<int> depth, pos, jump, rpos;
vt<char> val;
 
void dfs(int u, int p = -1) {
    pos[u] = t++;
    if (depth[u] == k) val[u] = 1;
    for (int v : adj[u]) {
        if (v == p) continue;
        depth[v] = depth[u] + 1;
        dfs(v, u);
        val[u] += val[v];
    }
    jump[u] = t;
}
 
const int mxk = 20;
char dp[401][1 << mxk];
 
main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> n >> k;
    if (k * k >= n) {
        cout << "DA\n";
        return 0;
    }
    adj.resize(n);
    depth = pos = jump = rpos = vt<int>(n, 0);
    val.resize(n);
    F0R (i, n - 1) {
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
 
    dfs(0);
    F0R (i, n) rpos[pos[i]] = i;

    ROF (i, 0, n) {
        int u = rpos[i];
        F0R (msk, 1 << mxk) { 
            dp[i][msk] = dp[i + 1][msk];
            if (depth[u] <= k && (1 & (msk >> depth[u]))) dp[i][msk] = max(dp[i][msk], (char) (val[u] + dp[jump[u]][msk ^ (1 << depth[u])]));
        }   
    }

    if (dp[0][(1 << mxk) - 2] == val[0]) cout << "DA\n";
    else cout << "NE\n";
}

Compilation message

burza.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main() {
      | ^~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 382 ms 320340 KB Output is correct
2 Correct 536 ms 410812 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 464 ms 393284 KB Output is correct
6 Correct 111 ms 93776 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 473 ms 390296 KB Output is correct
2 Correct 496 ms 392316 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 518 ms 397448 KB Output is correct
6 Incorrect 448 ms 406612 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 516 ms 395340 KB Output is correct
2 Correct 491 ms 395364 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 382 ms 318368 KB Output is correct
6 Correct 122 ms 100944 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 465 ms 386104 KB Output is correct
2 Correct 526 ms 410672 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 327 ms 273288 KB Output is correct
6 Correct 95 ms 83536 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 504 ms 377992 KB Output is correct
2 Correct 576 ms 390336 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 457 ms 394316 KB Output is correct
6 Correct 376 ms 278348 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 495 ms 393364 KB Output is correct
2 Correct 474 ms 387156 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 419 ms 364624 KB Output is correct
6 Correct 287 ms 245448 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 400448 KB Output is correct
2 Correct 481 ms 389200 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 494 ms 390252 KB Output is correct
6 Correct 384 ms 322384 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 408 ms 345168 KB Output is correct
2 Correct 542 ms 402640 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 288 ms 245540 KB Output is correct
6 Correct 493 ms 400480 KB Output is correct

Subtask #9
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 346 ms 286652 KB Output is correct
2 Correct 505 ms 406604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 280 ms 247652 KB Output is correct
6 Correct 435 ms 368748 KB Output is correct

Subtask #10
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 414 ms 341072 KB Output is correct
2 Correct 524 ms 405584 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 432 ms 345180 KB Output is correct
6 Correct 202 ms 175700 KB Output is correct