제출 #146709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
146709		MvC	Calvinball championship (CEOI15_teams)	C++14	20 / 100	770 ms	700 KiB

teams

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.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=1e4+50;
const ll mod=1e6+7;
using namespace std;
int n,i,j;
ll b[nmax],c[2][nmax];
void ad(ll &x,ll y)
{
	x+=y;
	if(x>=mod)x-=mod;
	if(x>=mod)x-=mod;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	c[0][0]=b[0]=1;
	for(i=1;i<=n;i++)
	{
		for(j=0;j<=i;j++)
		{
			if(!i || !j)c[1][j]=1;
			else ad(c[1][j],c[0][j]+c[0][j-1]);
			if(j<i)ad(b[i],c[0][j]*b[j]%mod);
		}
		for(j=0;j<=i;j++)
		{
			c[0][j]=c[1][j];
			c[1][j]=0;
		}
	}
	cout<<b[n]<<endl;
	return 0;
}

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

teams.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
teams.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10