oj.uz

Submission #607774

# Submission time Handle Problem Language Result Execution time Memory
607774 2022-07-27T03:53:02 Z Soul234 Burza (COCI16_burza) C++14
160 / 160
 58 ms 3276 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

constexpr bool onbit(int x, int i) { return x>>i&1; }

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const int MX = 4e2+5;
int N, K, tin[MX], tout[MX], dep[MX], tt;
vi adj[MX], lst[MX];
bool dp[MX][1<<20];

void dfs(int u, int p) {
    if(~p) dep[u] = dep[p] + 1;
    if(dep[u] == K) {
        tin[u] = tt++;
        tout[u] = tt;
        return;
    }
    tin[u] = tt;
    each(v, adj[u]) if(v != p) {
        dfs(v, u);
    }
    tout[u] = tt;
}

void solve() {
    cin>>N>>K;
    F0R(i,N-1) {
        int u,v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    if(K*K >= N) {
        cout << "DA\n";
        return;
    }
    memset(tin, -1, sizeof tin);
    dep[1] = 0;
    dfs(1, -1);
    FOR(i,2,N+1) if(~tin[i]) lst[tin[i]].pb(i);
    dp[0][0] = 1;
    F0R(i, tt) {
        F0R(msk, 1<<K) if(dp[i][msk]) {
            each(v, lst[i]) if(!onbit(msk, dep[v]-1)) {
                dp[tout[v]][msk|(1<<(dep[v]-1))] = 1;
            }
        }
    }
    bool ok = false;
    F0R(msk, 1<<K) ok |= dp[tt][msk];
    if(ok) cout << "DA\n";
    else cout << "NE\n";
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

burza.cpp: In function 'void setIO(std::string)':
burza.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
burza.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 36 ms 2524 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 0 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2636 KB Output is correct
2 Correct 33 ms 2508 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 53 ms 2992 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 2784 KB Output is correct
2 Correct 37 ms 2468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1244 KB Output is correct
2 Correct 51 ms 3276 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2180 KB Output is correct
2 Correct 41 ms 2860 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 2676 KB Output is correct
2 Correct 43 ms 2676 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 3104 KB Output is correct
2 Correct 45 ms 2764 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 53 ms 3072 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1236 KB Output is correct
2 Correct 41 ms 2736 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 58 ms 2932 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1648 KB Output is correct
2 Correct 50 ms 2888 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 21 ms 1644 KB Output is correct
6 Correct 1 ms 596 KB Output is correct