NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Time Exceeded 0	≥5401ms	≥404 KiB
#2	Time Exceeded 0	≥5399ms	≥404 KiB
#3	Time Exceeded 0	≥5400ms	≥404 KiB
#4	Time Exceeded 0	≥5401ms	≥404 KiB
#5	Time Exceeded 0	≥5400ms	≥404 KiB
#6	Time Exceeded 0	≥5401ms	≥404 KiB
#7	Accepted 4	2ms	508 KiB
#8	Accepted 4	2ms	404 KiB
#9	Time Exceeded 0	≥5400ms	≥404 KiB
#10	Accepted 4	2ms	404 KiB
#11	Time Exceeded 0	≥5401ms	≥408 KiB
#12	Time Exceeded 0	≥5400ms	≥316 KiB
#13	Time Exceeded 0	≥5400ms	≥404 KiB
#14	Time Exceeded 0	≥5400ms	≥404 KiB
#15	Time Exceeded 0	≥5401ms	≥404 KiB
#16	Accepted 4	3ms	508 KiB
#17	Time Exceeded 0	≥5400ms	≥404 KiB
#18	Time Exceeded 0	≥5400ms	≥408 KiB
#19	Time Exceeded 0	≥5400ms	≥404 KiB
#20	Time Exceeded 0	≥5400ms	≥404 KiB
#21	Accepted 4	47ms	508 KiB
#22	Time Exceeded 0	≥5401ms	≥404 KiB
#23	Time Exceeded 0	≥5401ms	≥404 KiB
#24	Time Exceeded 0	≥5400ms	≥404 KiB
#25	Time Exceeded 0	≥5401ms	≥368 KiB

#include<iostream>
#include<stdio.h>
#include<utility>
#include<map>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
#define int long long
#define P 998244353ll
int a[3010],p2[3010];
signed main(){
    freopen("seal.in","r",stdin);
    freopen("seal.out","w",stdout);
    int c,T;
    cin>>c>>T;
        for(int I=1;I<=T;I++){
            int n,m;
            cin>>n>>m;
            for(int i=1;i<=n;i++)cin>>a[i];
            int cur=1,ans=0,r=0;
            p2[0]=1;
            for(int i=1;i<=3000;i++)p2[i]=p2[i-1]*2%P;
            while(1){
                if(r==0){
                    for(int i=cur;i<=n;i++){
                        ans=(ans+p2[i==1?0:(i==2?0:i-2-(a[1]==1))])%P;
                    }
                }else{
                    for(int i=cur;i<=n;i++){
                        ans=(ans+(i==n?p2[n-cur-((cur<n)&&(a[cur]==1))]:(i==cur?p2[n-cur-1]:p2[n-cur-1-(a[cur]==1)])))%P;
                    }
                }
                for(int i=1;i<=n;i++)a[i]--;
                while(cur<=n&&a[cur]==0)cur++;
                if(cur>n)break;
                r=1;
            }
            cout<<ans<<endl;
        }
    return 0;
}

递交者: HL-S022
题目: NOISX2025GFF NOISX2025GFF
比赛: 【官方数据 HL】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 1.2 KiB
递交时间: 2025-3-7 14:27:54
评测时间: 2025-3-7 14:42:51

分数: 20
总耗时: ≥108061ms
峰值时间: ≥5401ms
峰值内存: ≥508 KiB

20 Time Exceeded

代码

信息

还没有账户？

登录