| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 872371 |
2023-11-13T03:06:09 Z |
xjonwang |
Burza (COCI16_burza) |
C++17 |
|
154 ms |
29776 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
template<class T> bool umin(T& a, const T& b) {
return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) {
return a<b?a=b, 1:0;
}
ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
while(lb<rb) {
ll mb=(lb+rb)/2;
f(mb)?rb=mb:lb=mb+1;
}
return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
while(lb<rb) {
ll mb=(lb+rb+1)/2;
f(mb)?lb=mb:rb=mb-1;
}
return lb;
}
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
EACH(a, x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
EACH(a, x)
read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
cin >> x.first >> x.second;
}
string to_string(char c) {
return string(1, c);
}
string to_string(bool b) {
return b?"true":"false";
}
string to_string(const char* s) {
return string(s);
}
string to_string(string s) {
return s;
}
string to_string(vt<bool> v) {
string res;
FOR(sz(v))
res+=char('0'+v[i]);
return res;
}
template<size_t S> string to_string(bitset<S> b) {
string res;
FOR(S)
res+=char('0'+b[i]);
return res;
}
template<class T> string to_string(T v) {
bool f=1;
string res;
EACH(x, v) {
if(!f)
res+=' ';
f=0;
res+=to_string(x);
}
return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
return to_string(x.first) + ' ' + to_string(x.second);
}
template<class A> void write(A x) {
cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) {
write(h);
write(t...);
}
void print() {
write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) {
write(h);
if(sizeof...(t))
write(' ');
print(t...);
}
vt<vt<int>> adj, hi;
vt<vt<bool>> child;
vt<int> height, children;
int n, k;
pair<int, vt<int>> dfs(int v, int p) {
height[v]=p!=-1 ? height[p]+1 : 0;
vt<int> ch; ch.pb(v);
int c=(height[v]==k);
EACH(u, adj[v]) {
if (u==p) continue;
pair<int, vt<int>> d=dfs(u, v);
c+=d.first;
EACH(x, d.second) child[v][x]=1, ch.pb(x);
}
children[v]=c;
if (height[v]>0 && height[v]<=k) hi[height[v]-1].pb(v);
return {c, ch};
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b; read(n, k);
if (k>20) {
print("DA");
return 0;
}
k=min(k, 20);
adj.resize(n), height.resize(n), children.resize(n), child.assign(n, vt<bool>(n, 0)), hi.resize(k);
FOR(n-1) {
read(a, b); a--, b--;
adj[a].pb(b), adj[b].pb(a);
}
int e=dfs(0, -1).first;
vt<pair<int, vt<bool>>> dp(1<<k, {0, vt<bool>(n, 1)});
FOR(i, 1, 1<<k) {
int m=0, idx1, idx2;
FOR(j, k) {
if (i & (1<<j)) {
EACH(v, hi[j]) {
if (dp[i^(1<<j)].second[v]) {
if (umax(m, dp[i^(1<<j)].first+children[v])) {
idx1=j, idx2=v;
}
}
}
}
}
if (m==e) {
print("DA");
return 0;
}
dp[i]={m, dp[1^(1<<idx1)].second};
FOR(j, n) {
if (child[idx2][j] || child[j][idx2]) dp[i].second[j]=0;
}
}
assert(false);
print("NE");
}
Compilation message
burza.cpp: In function 'int main()':
burza.cpp:200:18: warning: 'idx2' may be used uninitialized in this function [-Wmaybe-uninitialized]
200 | if (child[idx2][j] || child[j][idx2]) dp[i].second[j]=0;
| ^
burza.cpp:198:20: warning: 'idx1' may be used uninitialized in this function [-Wmaybe-uninitialized]
198 | dp[i]={m, dp[1^(1<<idx1)].second};
| ~~^~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
13 ms |
1880 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
78 ms |
14684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
9 ms |
14684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
3932 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
154 ms |
29776 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
17 ms |
14892 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
68 ms |
14684 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
37 ms |
8016 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
15 ms |
3672 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
7516 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
