| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 242603 |
2020-06-28T10:27:36 Z |
ne4eHbKa |
Burza (COCI16_burza) |
C++17 |
|
6 ms |
512 KB |
//{ <defines>
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 405;
int n, k;
list<int> g[N], d[N];
int h[N], l[N], r[N], tt, p[N], w[N], H[N];
bool bad[N], mk[N];
void ch(int v = 0, int pr = -1, int he = 0) {
bad[v] = he >= k;
l[p[tt] = v] = tt++;
h[v] = he; g[v].remove(pr);
for(int u : g[v]) {
ch(u, v, he + 1);
if(bad[u]) bad[v] = true;
}
r[v] = tt - 1;
d[he].pb(v);
}
vi s;
bool dfs(int v = 0) {
if(mk[v]) re false;
if(h[v] > k) re true;
w[v] = bad[v] = h[v] == k;
for(int u : g[v]) {
if(dfs(u)) bad[v] = true;
w[v] += w[u];
}
re bad[v];
}
void solve() {
tt = 0;
cin >> n >> k;
fo(n) g[i].clear(), d[i].clear();
fo(n - 1) {
int x, y;
cin >> x >> y;
--x, --y;
g[x].pb(y);
g[y].pb(x);
}
ch();
set<int> Q;
s.reserve(n);
clr(H, 0);
for(; sz(Q) <= k; ) {
s.resize(0);
clr(bad, 0);
clr(w, 0);
if(!dfs()) break;
int z = 0;
for(int i = 1; i <= k; ++i) {
z += H[i];
if(z < i) for(int v : d[i]) if(bad[v]) s.pb(v);
}
if(s.empty()) break;
sort(s.begin(), s.end(), [&] (const int &a, const int &b)
{return w[a] > w[b];});
int v = s[0];
// for(int i = l[v]; i <= r[v]; ++i) {
// int j = p[i];
// if(!mk[j]) continue;
// mk[j] = false;
// H[h[j]]--;
// Q.erase(j);
// }
mk[v] = true;
Q.insert(v);
H[h[v]]++;
}
if(sz(Q) > k || dfs()) re void(cout << "NE\n");
cout << "DA\n";
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
burza.cpp: In function 'int m_bpow(ll, ll)':
burza.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
burza.cpp: In function 'void ch(int, int, int)':
burza.cpp:72:22: warning: operation on 'tt' may be undefined [-Wsequence-point]
l[p[tt] = v] = tt++;
~~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
