제출 #967314

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967314		blackslex	Burza (COCI16_burza)	C++17	0 / 160	1 ms	432 KiB

burza

#include<bits/stdc++.h>

using namespace std;

int n, k, x, y;

int main() {
    scanf("%d %d", &n, &k);
    vector<vector<int>> v(n + 5, vector<int>());
    for (int i = 1; i < n; i++) scanf("%d %d", &x, &y), v[x].emplace_back(y), v[y].emplace_back(x);
    vector<int> dp(n + 5);
    function<void(int, int)> dfs = [&] (int cur, int par) {
        bool isleaf = 1;
        vector<int> u;
        for (auto &e: v[cur]) {
            if (par == e) continue; isleaf = 0;
            dfs(e, cur); u.emplace_back(dp[e]);
        }
        sort(u.rbegin(), u.rend());
        if (u.size() >= 2) dp[cur] = u[1] + 1;
    };
    dfs(1, 0);
    printf("%s", dp[1] >= k ? "NE" : "DA");
}

컴파일 시 표준 에러 (stderr) 메시지

burza.cpp: In lambda function:
burza.cpp:16:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   16 |             if (par == e) continue; isleaf = 0;
      |             ^~
burza.cpp:16:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   16 |             if (par == e) continue; isleaf = 0;
      |                                     ^~~~~~
burza.cpp:13:14: warning: variable 'isleaf' set but not used [-Wunused-but-set-variable]
   13 |         bool isleaf = 1;
      |              ^~~~~~
burza.cpp: In function 'int main()':
burza.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
burza.cpp:10:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     for (int i = 1; i < n; i++) scanf("%d %d", &x, &y), v[x].emplace_back(y), v[y].emplace_back(x);
      |                                 ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 16
• Subtask 2: 0 / 16
• Subtask 3: 0 / 16
• Subtask 4: 0 / 16
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16