제출 #147083

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147083		MvC	Calvinball championship (CEOI15_teams)	C++11	100 / 100	400 ms	760 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<<61);
const int inf=(1<<30);
const int nmax=1e4+50;
const ll mod=1e6+7;
using namespace std;
int n,i,j,a[nmax],mx[nmax];
ll f[2][nmax],rs;
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;
	for(i=1;i<=n;i++)
	{
		cin>>a[i];
		mx[i]=max(mx[i-1],a[i]);
	}
	for(i=1;i<=n;i++)f[0][i]=1;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			f[1][j]=f[0][j]*1LL*j+f[0][j+1];
			f[1][j]%=mod;
		}
		if(i==n)continue;
		rs+=1LL*(a[n-i+1]-1)*f[0][mx[n-i]];
		rs%=mod;
		for(j=1;j<=n;j++)
		{
			f[0][j]=f[1][j];
			f[1][j]=0;
		}
	}
	rs++;
	rs%=mod;
	cout<<rs<<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: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10