NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Wrong Answer 0 Standard answer longer than user output.	2ms	380 KiB
#2	Wrong Answer 0 Standard answer longer than user output.	2ms	420 KiB
#3	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#4	Wrong Answer 0 Standard answer longer than user output.	2ms	408 KiB
#5	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#6	Wrong Answer 0 Standard answer longer than user output.	2ms	408 KiB
#7	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#8	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#9	Wrong Answer 0 Standard answer longer than user output.	2ms	408 KiB
#10	Wrong Answer 0 Standard answer longer than user output.	2ms	320 KiB
#11	Wrong Answer 0 Standard answer longer than user output.	2ms	508 KiB
#12	Wrong Answer 0 Standard answer longer than user output.	2ms	508 KiB
#13	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#14	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#15	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#16	Wrong Answer 0 Standard answer longer than user output.	2ms	276 KiB
#17	Wrong Answer 0 Standard answer longer than user output.	2ms	276 KiB
#18	Wrong Answer 0 Standard answer longer than user output.	2ms	280 KiB
#19	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#20	Wrong Answer 0 Standard answer longer than user output.	2ms	320 KiB
#21	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#22	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#23	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#24	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#25	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <cstdint>
#include <random>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>

typedef long long LL;
typedef unsigned long long ull;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;

#define rep(i,l,r) for(int i(l);i<=r;++i)
#define per(i,r,l) for(int i(r);i>=l;--i)

template<typename T>T min(T a,T b){return a<b?a:b;}
template<typename T>T max(T a,T b){return a>b?a:b;}
const auto N = 0;
const auto M = 0;
const auto mod = 1'000'000'007;
const auto INF = 0x3f3f3f3f;

int c,T;
int n,m;

struct edge{int u,v,w;}e[110];

LL fastpow(LL a,LL b){
    LL res=1;
    while(b){
        if(b&1){res=res*a%mod;}
        a=a*a%mod;
        b>>=1;
    }
    return res;
}

int main(){
    freopen("years.in","r",stdin);
    freopen("years.out","w",stdout);

    scanf("%d%d",&c,&T);

    while(T--){
        scanf("%d%d",&n,&m);
        rep(i,1,m){scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);}
        if(n==2){printf("%d\n",750000006);}
        if(n==3){if(m==2){printf("%d\n",500000004);}else{printf("%d\n",171875002);}}
    }

    return 0;
}
/*
-fsanitize=address,undefined
250000002
*/

递交者: JX-041
题目: NOISX2025GFE NOISX2025GFE
比赛: 【官方数据 JX】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 1.3 KiB
递交时间: 2025-3-6 22:57:07
评测时间: 2025-3-7 10:56:54

分数: 0
总耗时: 44ms
峰值时间: 2ms
峰值内存: 508 KiB

0 Wrong Answer

代码

信息

还没有账户？

登录