Submission #426757

#	Time	Username	Problem	Language	Result	Execution time	Memory
426757		Blistering_Barnacles	Simurgh (IOI17_simurgh)	C++11	13 / 100	39 ms	13348 KiB

simurgh

#include "simurgh.h"
//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 ; C
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , vis[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void dfs(ll v , ll par){
    vis[v] = 1 ;
    for(auto u : adj[v]){
        if(u == par)C ;
        if(vis[u]){
            o = 0 ;
            C ;
        }
        dfs(u , v) ;
    }
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
    m = sz(u) ;
    for(ll i = 0 ; i < (1 << m) ; i++){
        if(__builtin_popcount(i) != n - 1)C ;
        for(ll i = 0 ; i < n ; i++){
            vis[i] = 0 ;
            adj[i].clear() ;
        }
        vll ret ;
        for(ll j = 0 ; j < m ; j++){
            if(i & (1 << j)){
                adj[u[j]].pb(v[j]) ;
                adj[v[j]].pb(u[j]) ;
                ret.pb(j) ;
            }
        }
        o = 1 ;
        dfs(0 , -1) ;
        p = 1 ;
        for(ll i = 0 ; i < n ; i++){
           //cout << vis[i] << " " ;
            p &= vis[i] ;
        }
        //cout << endl ;
        if(!p || !o)C ;
        if(count_common_roads(ret) == n - 1)R ret ;
    }
    R {} ;
}
/*
    4 6
    0 1
    0 2
    0 3
    1 2
    1 3
    2 3
    0 1 5
*/

• Subtask 1: 13 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30