제출 #613567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
613567		PanTkd	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	154 ms	24008 KiB

supertrees

//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//
#include "supertrees.h"

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////
void build(vector<vector<ll> > b);
int construct(vector<vector<ll> > p)
{
    ll s=0;
    ll n=p.size();
    vector<vector<ll> > ans (n, vector<int>(n, 0));
    for(ll i=0;i<n;i++){
        for(ll j=0;j<n;j++){
            if(j==s)
                if(i!=s){
                    ans[i][j]=1;
                    ans[j][i]=1;
                }
        }   
    }
    build(ans);
    return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4