제출 #447536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447536		Blistering_Barnacles	Pastiri (COI20_pastiri)	C++11	8 / 100	197 ms	39180 KiB

pastiri

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[500005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
ll mem(ll i){
    ll &r = dp[i] ;
    if(i == k)R r = 1 ;
    if(i > k)R r = 0 ;
    if(r != -1)R r ;
    r = mem(i + 1) + 1 ;
    if((a[i + 1] - a[i] + 1) & 1)r = min(r , mem(i + 2) + 1) ;
    R r ;
}
void solve(){
    msdp(dp) ;
    cin >> n >> k ;
    for(ll i = 1 ; i < n ; i++){
        cin >> o >> p ;
    }
    for(ll i = 1 ; i <= k ; i++){
        cin >> a[i] ;
    }
    sort(a + 1 , a + k + 1) ;
    cout << mem(1) << endl ;
    o = 1 ;
    while(o <= k){
        p = o + 1 ;
        ll ans = a[o]  ;
        if((a[o + 1] - a[o] + 1) & 1 && dp[o + 2] < dp[o + 1])p = o + 2 , ans = (a[o + 1] + a[o]) / 2 ;
        cout << ans << " " ;
        o = p ;
    }
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 18
• Subtask 3: 0 / 23
• Subtask 4: 0 / 51