oj.uz

답안 #960776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960776 2024-04-11T03:31:06 Z doducanh Burza (COCI16_burza) C++14
160 / 160
 39 ms 1540 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
int max_cover[(1<<20)+7];
vector<int>a[405];
vector<int>dep[405];
vector<vector<int>>cutoff;
vector<pair<int,int>>interval;
map<int,int>lost;
int n,k;
void process(int at,int prev,int depth)
{
    dep[depth].push_back(at);
    if(depth==k){
        lost[at]=lost.size();
        cutoff[at]={at};
        return;
    }
    for(int v:a[at])if(v!=prev){
        process(v,at,depth+1);
        cutoff[at].insert(cutoff[at].end(),cutoff[v].begin(),cutoff[v].end());
    }
}
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>k;
    cutoff.resize(n+1);
    for(int i=1;i<=n-1;i++){
        int x,y;
        cin>>x>>y;
        x--,y--;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    if(k*k>=n){
        cout<<"DA";
        return 0;
    }
    process(0,0,0);
    for(const vector<int>&cc:cutoff){
        if(cc.empty()){
            interval.push_back({-1,-1});
        }
        else interval.push_back({lost[cc.front()]+1,lost[cc.back()]+1});
    }
    max_cover[0]=0;
    for(int mask=1;mask<(1<<k);mask++){
        int &curr=max_cover[mask];
        for(int to_add=0;to_add<k;to_add++){
            if(((mask>>to_add)&1)){
                int prev=max_cover[mask^(1<<to_add)];
                for(int v:dep[to_add+1]){
                    if(prev+1>=interval[v].fi){
                        curr=max(curr,interval[v].se);
                    }
                }
            }
        }
        if(curr==lost.size()){
            cout<<"DA";
            return 0;
        }
    }
    cout<<"NE";
}

Compilation message

burza.cpp:26:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 | main()
      | ^~~~
burza.cpp: In function 'int main()':
burza.cpp:62:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         if(curr==lost.size()){
      |            ~~~~^~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 35 ms 1524 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 484 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 1532 KB Output is correct
2 Correct 32 ms 1492 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 38 ms 1384 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1404 KB Output is correct
2 Correct 33 ms 1412 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 484 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 38 ms 1540 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1360 KB Output is correct
2 Correct 30 ms 1372 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 1368 KB Output is correct
2 Correct 30 ms 1468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1372 KB Output is correct
2 Correct 36 ms 1420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 32 ms 1364 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 604 KB Output is correct
2 Correct 33 ms 1368 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #9
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 34 ms 1448 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #10
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 860 KB Output is correct
2 Correct 35 ms 1380 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 15 ms 1112 KB Output is correct
6 Correct 1 ms 348 KB Output is correct