Submission #1047949

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047949		cpdreamer	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	105 ms	24144 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define V vector
#define P pair
#define S second
#define F first
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7
int construct(std::vector<std::vector<int>> p) {
    int n=(int)p.size();
    V<V<int>>ans(n,V<int>(n,0));
    V<int>component(n);
    V<int>visited(n,false);
    V<bool>vp(n);
    for(int i=0;i<n;i++){
        if(visited[i])continue;
        component[i]=i;
        vp[i]=true;
        visited[i]=true;
        for(int j=0;j<n;j++){
            if(i==j)continue;
            if(p[i][j]==1) {
                if (visited[j])continue;
                visited[j] = true;
                ans[i][j] = ans[j][i] = 1;
                component[j]=i;
            }
        }
    }
    for(int i=0;i<n-1;i++){
        if(vp[i]){
            V<int>ls;
            ls.pb(i);
            for(int j=i+1;j<n;j++){
                if(vp[j])
                    if(p[i][j]==2)
                        ls.pb(j);
            }
            if(ls.size()>2) {
                int s = (int) ls.size();
                ans[ls[0]][ls[s - 1]] = ans[ls[s - 1]][ls[0]] = 1;
                for (int j = 0; j < s - 1; j++) {
                    ans[ls[j]][ls[j + 1]] = ans[ls[j + 1]][ls[j]] = 1;
                }
            }
        }
    }
    build(ans);
    return 1;
}

Compilation message (stderr)

supertrees.cpp:16:12: warning: 'called' defined but not used [-Wunused-variable]
   16 | static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7
      |            ^~~~~~

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