제출 #144662

#제출 시각아이디문제언어결과실행 시간메모리
144662stefdascaBurza (COCI16_burza)C++14
0 / 160
2 ms400 KiB
#include<bits/stdc++.h> #pragma GCC optimize("O3") #define fi first #define se second #define pb push_back #define pf push_front #define mod 1000000007 using namespace std; typedef long long ll; int add(int a, int b) { ll x = a+b; if(x >= mod) x -= mod; if(x < 0) x += mod; return x; } ll mul(ll a, ll b) { return (a*b) % mod; } ll pw(ll a, ll b) { ll ans = 1; while(b) { if(b & 1) ans = (ans * a) % mod; a = (a * a) % mod; b >>= 1; } return ans; } vector<int>v[402]; int n, k, height[402], level[402]; void dfs(int dad, int nod) { vector<int>he; height[nod] = 1; for(int i = 0; i < v[nod].size(); ++i) { int vecin = v[nod][i]; if(vecin == dad) continue; dfs(nod, vecin); he.push_back(height[nod]); } sort(he.begin(), he.end()); if(he.size()) he.pop_back(); if(he.size()) height[nod] += he.back(); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); 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; v[a].pb(b); v[b].pb(a); } dfs(0, 1); cout << (height[1] <= k ? "DA" : "NE"); return 0; }

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

burza.cpp: In function 'void dfs(int, int)':
burza.cpp:46:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[nod].size(); ++i)
                    ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...