제출 #307013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307013		cheetose	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	1234 ms	1867128 KiB

supertrees

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
#include "supertrees.h"
int parent[1000];
int find(int a)
{
	if (parent[a] < 0)return a;
	return parent[a] = find(parent[a]);
}
void merge(int a, int b)
{
	a = find(a), b = find(b);
	if (a != b)
	{
		parent[b] = a;
	}
}
int last[1000],cnt[1000];
bool chk[1000];
int construct(vector<Vi> p){
	MEM_1(parent);
	int n=p.size();
	fup(i,0,n-1,1)last[i]=i;
	vector<Vi> b(n,Vi(n));
	/*int mx=1;
	fup(i,0,n-1,1){
		fup(j,i+1,n-1,1){
			mx=max(mx,p[i][j]);
		}
	}
	if(mx==3){
		fup(i,0,n-1,1){
			fup(j,i+1,n-1,1)if(p[i][j]==2)return 0;
		}
	}*/
	fup(i,0,n-1,1){
		fup(j,i+1,n-1,1){
			if(p[i][j]==3)return 0;
			if(p[i][j]==1){
				chk[i]=chk[j]=1;
				merge(i,j);
			}
		}
	}
	fup(i,0,n-1,1){
		fup(j,i+1,n-1,1){
			if(p[i][j]==2 && find(i)==find(j))return 0;
			if(p[i][j]==1){
				if(i!=find(i))b[i][find(i)]=b[find(i)][i]=1;
				if(j!=find(j))b[j][find(j)]=b[find(j)][j]=1;
			}
		}
	}
	fup(i,0,n-1,1){
		fup(j,i+1,n-1,1){
			if(p[i][j]==2){
				int ii=find(i),jj=find(j);
				if(chk[ii]){
					parent[jj]=ii;
				}else{
					parent[ii]=jj;
				}
			}
		}
	}
	fup(i,0,n-1,1){
		fup(j,i+1,n-1,1){
			if(p[i][j]==0 && find(i)==find(j))return 0;
		}
	}
	fup(i,0,n-1,1){
		if(i!=find(i) && !chk[i]){
			int j=find(i);
			cnt[j]++;
			b[last[j]][i]=b[i][last[j]]=1;
			last[j]=i;
		}
	}
	fup(i,0,n-1,1){
		if(cnt[i]==1 || cnt[i]==2)return 0;
		if(i!=last[i])b[i][last[i]]=b[last[i]][i]=1;
	}
	build(b);
	return 1;
}/*
int main() {
}*/

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:63:2: note: in expansion of macro 'fup'
   63 |  fup(i,0,n-1,1)last[i]=i;
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:76:2: note: in expansion of macro 'fup'
   76 |  fup(i,0,n-1,1){
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:77:3: note: in expansion of macro 'fup'
   77 |   fup(j,i+1,n-1,1){
      |   ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:85:2: note: in expansion of macro 'fup'
   85 |  fup(i,0,n-1,1){
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:86:3: note: in expansion of macro 'fup'
   86 |   fup(j,i+1,n-1,1){
      |   ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:94:2: note: in expansion of macro 'fup'
   94 |  fup(i,0,n-1,1){
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:95:3: note: in expansion of macro 'fup'
   95 |   fup(j,i+1,n-1,1){
      |   ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:106:2: note: in expansion of macro 'fup'
  106 |  fup(i,0,n-1,1){
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:107:3: note: in expansion of macro 'fup'
  107 |   fup(j,i+1,n-1,1){
      |   ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:111:2: note: in expansion of macro 'fup'
  111 |  fup(i,0,n-1,1){
      |  ^~~
supertrees.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
supertrees.cpp:119:2: note: in expansion of macro 'fup'
  119 |  fup(i,0,n-1,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