提出 #73540093

---

ソースコード 拡げる

//#pragma GCC optimize("O3", "unroll-loops", "inline-functions")

#include <bits/stdc++.h>

using namespace std;
 


#define all(X) X.begin(),X.end()
#define rall(X) X.rbegin(),X.rend()
 
#define ll long long
 
template<typename T>
static inline void chmax(T &x , T v){x = max(x , v);}

template<typename T>
static inline void chmin(T &x , T v){x = min(x , v);}

const ll mod = 998244353;
 
ll mult(ll a , ll b){
	a %= mod;b %= mod;
	return (a * b)%mod;
}
ll add(ll a , ll b){
	a %= mod;b %= mod;
	return (a + b)%mod;
}
static inline ll binpow_m(ll a,  ll p){
	ll res = 1;
	for(ll i = 1;i <= p;i <<= 1){
		if(i & p)res = mult(res , a);
		a = mult(a , a);
	}
	return res;
}
static inline void fix(ll &val){
	val %= mod;
	if(val < 0)val += mod;
}
const ll INF = 2e18;
const int OL = 2e5 + 5;
int dir1[] = {0 , 1 , 0 , -1};
int dir2[] = {1 , 0 , -1 , 0};
//################################################
#define int ll

void solve(){
	int n;
	cin>>n;

	vector<ll>arr(n + 3);
	auto dp = arr;
	auto mem = dp;

	for(int i = 1;i <= n;i++){
		cin>>arr[i];
	}
	deque<int>idxs[n + 1] ;
	
	dp[0] = 1;
	ll acu = 0;
	for(int i = 1;i <= n;i++){
		dp[i] = 1;
		idxs[arr[i]].push_back(i);
		if(idxs[arr[i]].size() == arr[i]){
			mem[arr[i]] = dp[idxs[arr[i]].front() - 1];
			(acu += mem[arr[i]]) %= mod;
		}
		else if(idxs[arr[i]].size() > arr[i]){
			
			(acu -= mem[arr[i]]) %= mod;
			
			idxs[arr[i]].pop_front();
			int z = idxs[arr[i]].front();
			mem[arr[i]] = dp[z - 1];

			(acu += mem[arr[i]]) %= mod;
			//if(acu < 0)acu += mod;
		}
		
		ll cont = (acu - mem[arr[i + 1]]) % mod;
		(dp[i] = cont + 1) %= mod;
		if(dp[i] < 0)dp[i] += mod;

	}

	dp[n] -= 1;
	dp[n] %= mod;
	if(dp[n] < 0)dp[n] += mod;
	cout<<dp[n]<<'\n';
}

int32_t main()
{

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
#endif
	//mock();
	
	
	int t = 1;
	//cin >> t;
	
	while (t--)
	{
		
		solve();
	}
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'void solve()':
./Main.cpp:67:40: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} [-Wsign-compare]
   67 |                 if(idxs[arr[i]].size() == arr[i]){
./Main.cpp:71:45: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} [-Wsign-compare]
   71 |                 else if(idxs[arr[i]].size() > arr[i]){

ジャッジ結果