Submission #430959

#	Time	Username	Problem	Language	Result	Execution time	Memory
430959		Blistering_Barnacles	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	251 ms	37064 KiB

supertrees

#include "supertrees.h"
#include <vector>
//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 int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
int construct(vector<vector<int>> p) {
    n = sz(p) ;
    vector < vll > ans ;
    ans.resize(n) ;
    for(ll i = 0 ; i < n ; i++){
        //cout << i << endl ;
        ans[i].resize(n) ;
        if(i){
            for(ll j = 0 ; j < n ; j++){
                if(j){
                    ans[i][j] = 0 ;
                }
                else {
                    ans[i][j] = 1 ;
                }
            }
        }
        else {
            for(ll j = 0 ; j < n ; j++){
                if(j){
                    ans[i][j] = 1 ;
                }
                else {
                    ans[i][j] = 0 ;
                }
            }
        }
    }
    build(ans) ;
    R 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