제출 #441736

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

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define FOR(i,j,n) for(int i=j;i<n;i++)

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 

/*
subtask 1: make a line graph
subtask 2: make multiple line graphs, make sure no components have contradictions
subtask 3: make multiple rings, make sure no contradictions
subtask 4: in each component, make components of 2s. Form these into rings. connect the rings. 
then get components of ones and make them into line graphs.
subtask 5: subtask 4 and check for contradictions
subtask 6: for the components of 3, make a ring and add an extra edge

rings must have at least 3 nodes
3-rings must have at least 4 nodes
*/

// void build(vector<vector<int>> b){
//     int n=sz(b); 
//     for(int i=0;i<n;i++){
//         for(int j=0;j<n;j++){
//             cout<<b[i][j]<<" ";
//         }
//         cout<<"\n";
//     }
// }

int construct(vector<vector<int>> p){
    int n=sz(p);
    vector<vector<int>> b;
    b.resize(n);
    for(auto &u:b)
        u.resize(n);
    for(int i=0;i<n-1;i++){
        b[i][i+1]=b[i+1][i]=1;
    }
    build(b);
    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