Submission #1062244

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062244		wood	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	177 ms	24148 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay



int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector<vi> res(n,vi(n));
    int leader[n]; for(int i = 0; i<n; i++) leader[i] = i;
    bool done[n]; memset(done,0,sizeof done);
    for(int i = 0; i<n; i++){
        if(done[i])continue;
        done[i] = true;
        set<int> zeros, ones, twos;
        for(int j = 0; j<n; j++){
            if(p[i][j]==0) zeros.insert(j);
            else if(p[i][j]==1){
              ones.insert(j);
              done[j] = true;
            }
            else twos.insert(j);
        }
        for(int x : ones){
            for(int j = 0; j<n; j++)
                if((p[x][j]==0&&!zeros.count(j))||(p[x][j]==1&&!ones.count(j))||(p[x][j]==2&&!twos.count(j))) return 0;
        }
        vi comp(ones.begin(),ones.end());
        for(int j = 0; j<comp.size()-1; j++){
            int a = comp[j], b = comp[j+1];
            res[a][b] = res[b][a] = 1;
            leader[j+1] = i;
        }
    }
    memset(done,0,sizeof done);
    for(int ii = 0; ii<n; ii++){
       // int i = leader[ii];
       // if(done[i]) continue;
       // done[i] = true;
       // set<int> t;
       // for(int j = 0; j<n; j++){
       //     if(p[ii][j]==2) t.insert(j);
       // }
       // for(int x : t){
       //     for(int j = 0; j<n; j++){
       //         if((p[ii][j]==2&&!t.count(j))||(p[ii][j]==0&&t.count(j))) return 0;
       //     }
       // }
       // vi comp(t.begin(),t.end());
       // for(int j = 0; j<comp.size()-1; j++){
       //     int a = comp[j], b = comp[j+1];
       //     res[a][b] = res[b][a] = 1;
       //     leader[j+1] = i;
       // }
       // int a = comp[0], b = comp[n-1];
       // res[a][b] = res[b][a] = 1;
    }
    build(res);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:50:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         for(int j = 0; j<comp.size()-1; j++){
      |                        ~^~~~~~~~~~~~~~
supertrees.cpp:31:9: warning: variable 'leader' set but not used [-Wunused-but-set-variable]
   31 |     int leader[n]; for(int i = 0; i<n; i++) leader[i] = i;
      |         ^~~~~~

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