oj.uz

Submission #250052

# Submission time Handle Problem Language Result Execution time Memory
250052 2020-07-16T18:17:05 Z leaked Burza (COCI16_burza) C++14
160 / 160
 37 ms 6696 KB 
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=1e5+3;
const int M=1e9+7;

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
    cout<<-1;
    exit(0);
}
 int n,k;
vector<int>g[N];
vector<int>lol[N];
int t=0,l[N],r[N],le[N],is[N];
bool dfs(int depth,int v,int p=0){
    if(depth==k){
        l[v]=t++;
        r[v]=t;
        le[v]=depth;
        is[v]=1;
        return 1;
    }
    l[v]=t;
    le[v]=depth;
    for(auto &z : g[v]){
        if(z==p) continue;
        if(dfs(depth+1,z,v)) is[v]=1;
    }
    r[v]=t;
    //debug()<<imie(v)<<imie(l[v])<<imie(r[v])<<imie(is[v]);
    return is[v];
}
signed main()
{
    fast_io;
    cin>>n>>k;
    /// самый худший случай , когда у нас все поддеревья равных размеров sqrt(n)*sqrt(n)
    if(k*k>=n){
        cout<<"DA";
        exit(0);
    }
    int v,u;
    for(int i=0;i<n-1;i++){
        cin>>v>>u;--v;--u;
        g[v].p_b(u);
        g[u].p_b(v);
    }
    dfs(0,0);
    for(int i=1;i<n;i++){
        if(l[i]!=r[i])lol[l[i]].p_b(i);
    }
    vector<vector<bool>>f(t+1,vector<bool>(pw(k),0));
    f[0][0]=1;
    for(int i=0;i<t;i++){
        for(int mask=0;mask<pw(k);mask++){
            if(!f[i][mask]) continue;
            for(auto &z : lol[i]){
                if(mask & pw(le[z]-1)) continue;
                else{
                    f[r[z]][mask+pw(le[z]-1)] =1 ;
                }
            }
        }
        //debug()<<imie(f[i]);
    }
//    debug()<<imie(f);
    for(int mask=0;mask<pw(k);mask++){
        if(!f[t][mask]) continue;
        cout<<"DA";
        exit(0);
    }
    cout<<"NE";
    return 0;
}
/*
    2 0 2 0 1
*/

Compilation message

burza.cpp: In function 'int main()':
burza.cpp:136:35: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
                 if(mask & pw(le[z]-1)) continue;
                              ~~~~~^~
burza.cpp:58:23: note: in definition of macro 'pw'
 #define pw(x) (1ll << x)
                       ^
burza.cpp:138:42: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
                     f[r[z]][mask+pw(le[z]-1)] =1 ;
                                     ~~~~~^~
burza.cpp:58:23: note: in definition of macro 'pw'
 #define pw(x) (1ll << x)
                       ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5248 KB Output is correct
2 Correct 28 ms 6656 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6400 KB Output is correct
2 Correct 27 ms 6400 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 34 ms 6400 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6400 KB Output is correct
2 Correct 28 ms 6400 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 5120 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5760 KB Output is correct
2 Correct 37 ms 6696 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 6144 KB Output is correct
2 Correct 30 ms 6272 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 6528 KB Output is correct
2 Correct 29 ms 6272 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 6400 KB Output is correct
2 Correct 33 ms 6400 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 29 ms 6272 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5376 KB Output is correct
2 Correct 31 ms 6528 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 5 ms 5120 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5248 KB Output is correct
2 Correct 32 ms 6528 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5504 KB Output is correct
2 Correct 32 ms 6528 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 17 ms 5632 KB Output is correct
6 Correct 3 ms 5092 KB Output is correct