제출 #145506

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145506		MvC	Split the Attractions (IOI19_split)	C++14	18 / 100	137 ms	13428 KiB

split

#include "split.h"
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,m,i,j,t,a[5],rs[nmax],x,vz[nmax];
vector<int>vc,g[nmax];
void dfs(int x)
{
	vz[x]=1;
	while(!a[t])t++;
	a[t]--;
	rs[x]=t;
	for(int i=0;i<g[x].size();i++)
	{
		if(!vz[g[x][i]])dfs(g[x][i]);
	}
}
vector<int> find_split(int N, int A, int B, int C, vector<int> P, vector<int> Q) 
{
	n=N,a[1]=A,a[2]=B,a[3]=C,m=P.size();
	for(i=0;i<m;i++)
	{
		P[i]++,Q[i]++;
		g[P[i]].pb(Q[i]);
		g[Q[i]].pb(P[i]);
	}
	for(i=1;i<=n;i++)if(g[i].size()==1)break;
	x=i,t=1;
	if(x==n+1)x=1;
	dfs(x);
	for(i=1;i<=n;i++)vc.pb(rs[i]);
	return vc;
}

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

split.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
split.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
split.cpp: In function 'void dfs(int)':
split.cpp:30:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[x].size();i++)
              ~^~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36