提出 #54615129


ソースコード 拡げる

#include <bits/stdc++.h> 
using namespace std;
#define ll long long
#define db double 
#define re register
#define pb(x) push_back(x)
#define F(i,a,b) for(re ll i = a;i <= b;i++)
#define D(i,a,b) for(re ll i = a;i >= b;i--)
const int N = 2e5+10;
const ll inf = 1e17,mod = 998244353;

ll read(){
	ll x = 0,f = 1;char c = getchar();
	for(;c < '0' || c > '9';c = getchar())if(c == '-')f = -1;
	for(;c >= '0' && c <= '9';c = getchar())x = (x<<1) + (x<<3) + c-'0';
	return x * f;
}

ll n,m;
ll ksm(ll x,ll y,ll p){
	ll ans = 1;
	while(y){
		if(y & 1)ans = (ans * x) % p;
		x = (x * x) % p,y >>= 1;
	}return ans;
}
ll a[30],sum,ans;
ll in[N] = {1,1},inv[N] = {1,1};
ll C(ll n,ll m){return in[n] * inv[m] % mod * inv[n-m] % mod;}
ll f[30][1010];
void work(){
	F(i,2,30000)in[i] = in[i-1] * i % mod,inv[i] = ksm(in[i],mod-2,mod);
	n = read();
	F(i,1,26)a[i] = read();
	f[0][0] = 1;
	F(i,1,26)
		F(j,0,n)
			F(k,0,a[i])if(j+k <= n)f[i][j+k] = (f[i][j+k] + f[i-1][j] * C(j+k,k) % mod) % mod;
	ll ans = 0;
	F(i,1,min(n,1000ll))(ans += f[26][i]) %= mod;
	printf("%lld\n",ans);
}
int main(){
	ll t = 1;
	while(t--)work();
	
	return cerr<<clock()<<"ms"<<endl,0;
	
}

提出情報

提出日時
問題 E - Alphabet Tiles
ユーザ _XU_
言語 C++ 20 (gcc 12.2)
得点 475
コード長 1199 Byte
結果 AC
実行時間 72 ms
メモリ 4644 KiB

コンパイルエラー

Main.cpp: In function ‘void work()’:
Main.cpp:32:11: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   32 |         F(i,2,30000)in[i] = in[i-1] * i % mod,inv[i] = ksm(in[i],mod-2,mod);
      |           ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^
Main.cpp:34:11: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   34 |         F(i,1,26)a[i] = read();
      |           ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^
Main.cpp:36:11: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   36 |         F(i,1,26)
      |           ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^
Main.cpp:37:19: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   37 |                 F(j,0,n)
      |                   ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^
Main.cpp:38:27: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   38 |                         F(k,0,a[i])if(j+k <= n)f[i][j+k] = (f[i][j+k] + f[i-1][j] * C(j+k,k) % mod) % mod;
      |                           ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^
Main.cpp:40:11: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   40 |         F(i,1,min(n,1000ll))(ans += f[26][i]) %= mod;
      |           ^
Main.cpp:7:28: note: in definition of macro ‘F’
    7 | #define F(i,a,b) for(re ll i = a;i <= b;i++)
      |                            ^

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 475 / 475
結果
AC × 3
AC × 22
セット名 テストケース
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt
ケース名 結果 実行時間 メモリ
sample00.txt AC 5 ms 4348 KiB
sample01.txt AC 5 ms 4404 KiB
sample02.txt AC 72 ms 4480 KiB
testcase00.txt AC 6 ms 4540 KiB
testcase01.txt AC 5 ms 4400 KiB
testcase02.txt AC 5 ms 4620 KiB
testcase03.txt AC 9 ms 4540 KiB
testcase04.txt AC 14 ms 4412 KiB
testcase05.txt AC 7 ms 4396 KiB
testcase06.txt AC 48 ms 4476 KiB
testcase07.txt AC 25 ms 4424 KiB
testcase08.txt AC 22 ms 4556 KiB
testcase09.txt AC 5 ms 4328 KiB
testcase10.txt AC 43 ms 4524 KiB
testcase11.txt AC 33 ms 4544 KiB
testcase12.txt AC 11 ms 4412 KiB
testcase13.txt AC 5 ms 4528 KiB
testcase14.txt AC 29 ms 4352 KiB
testcase15.txt AC 10 ms 4348 KiB
testcase16.txt AC 36 ms 4352 KiB
testcase17.txt AC 6 ms 4356 KiB
testcase18.txt AC 5 ms 4644 KiB