Submission #735023

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
735023	2023-05-03T11:39:16 Z	vjudge1	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	212 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
#define INF 1e9+7
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define pdd pair<long double,long double>
#define pipii pair<int,pii>
#define plpll pair<ll,pll>
#define vi vector<int>
#define vvi vector<vi>
#define v3i vector<vvi>
#define v4i vector<v3i>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ins insert
#define ln '\n'
#define all(v) v.begin(),v.end()
#define bigint __int128

using namespace std;

int construct(vvi p) {
	int n = p.size();
    vvi answer(n,vi(n,0));
    vi color(n,0);
    int nxt=0;
    if(n==1){
        build(answer);
        return 1;
    }
    int flaq=0;
	for (int i=0;i<n;++i) {
		if(!color[i]){
            color[i]=++nxt;
            flaq=1;
		}
		if(!p[i][i]) return 0;
		for(int j=0;j<n;++j){
            if(p[i][j]==1){
                if(!color[j]){
                    color[j]=color[i];
                }
                else{
                    if(flaq==1&&i!=j) return 0;
                    if(color[i]!=color[j]){
                        return 0;
                    }
                }
            }
		}
	}
	vvi node(nxt+1);
	for(int i=0;i<n;++i){
        node[color[i]].eb(i);
	}
	for(int i=1;i<=nxt;++i){
	    for(int j=1;j<node[i].size()-1;++j){
            answer[node[i][j]][node[i][j-1]]=answer[node[i][j]][node[i][j+1]]=1;
	    }
	    if(node[i].size()!=1){
            answer[node[i][0]][node[i][1]]=answer[node[i][node[i].size()-1]][node[i][node[i].size()-2]]=1;
	    }
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |      for(int j=1;j<node[i].size()-1;++j){
      |                  ~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	0 ms	212 KB	Answer gives possible 0 while actual possible 1
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	0 ms	212 KB	Answer gives possible 0 while actual possible 1
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-