Submission #1061693

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061693		wood	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	0 ms	348 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));
    vector<vi> comps;
    bool done[n]; memset(done,0,sizeof done);
    for(int i = 0; i<n; i++){
        if(done[i]) continue;
        done[i] = true;
        vi comp = {i};
        for(int j = 0; j<n; j++){
            if(p[i][j]){
                  comp.pb(j);
                  done[j] = true;
            }
        }
        for(int j = 0; j<comp.size(); j++){
            for(int k = j+1; k<comp.size(); k++){
                if(p[comp[j]][comp[k]]==0||p[comp[k]][comp[j]]==0) return 0;
            }
        }
        for(int j = 0; j<comp.size()-1; j++){
            res[comp[j]][comp[j+1]] = res[comp[j+1]][comp[j]] = 1;
        }
    }
    build(res);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:43:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j = 0; j<comp.size(); j++){
      |                        ~^~~~~~~~~~~~
supertrees.cpp:44:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             for(int k = j+1; k<comp.size(); k++){
      |                              ~^~~~~~~~~~~~
supertrees.cpp:48:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int j = 0; j<comp.size()-1; j++){
      |                        ~^~~~~~~~~~~~~~

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