제출 #977266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977266		thegamercoder19	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	176 ms	30048 KiB

supertrees

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

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;

V<ll> comp;
V<bool> us;
V<V<int>> g;

ll n;
void dfs(ll u)
{
	us[u] = 1;
	FOR(ll, v, 0, n, 1)
		if (g[u][v] && !us[v])dfs(v);
	comp.push_back(u);
}

int construct(std::vector<std::vector<int>> p) {
	n = p.size(); us.resize(n);
	g.resize(n, V<int>(n));
	FOR(ll, i, 0, n, 1)
		FOR(ll, j, i + 1, n, 1)
		if (p[i][j])g[i][j] = g[j][i] = 1;
	V<V<int>> p1(n, V<int>(n)), g1(n, V<int>(n));
	FOR(ll,i,0,n,1)
		if (!us[i])
		{
			comp.clear();
			dfs(i);
			FOR(ll, j, 0, comp.size() - 1, 1) g1[comp[j]][comp[j + 1]] = g1[comp[j + 1]][comp[j]] = 1;
			FORA(comp, u)
				FORA(comp, v)
				p1[u][v] = p1[v][u] = 1;
		}
	FOR(ll, i, 0, n, 1)
		FOR(ll, j, 0, n, 1) if (p1[i][j] != p[i][j])RET 0;
	build(g1);
	return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:24:43: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 | #define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
......
   70 |    FOR(ll, j, 0, comp.size() - 1, 1) g1[comp[j]][comp[j + 1]] = g1[comp[j + 1]][comp[j]] = 1;
      |            ~~~~~~~~~~~~~~~~~~~~~           
supertrees.cpp:70:4: note: in expansion of macro 'FOR'
   70 |    FOR(ll, j, 0, comp.size() - 1, 1) g1[comp[j]][comp[j + 1]] = g1[comp[j + 1]][comp[j]] = 1;
      |    ^~~

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