NOI批量评测 - 记录详情

foo.cc: In function 'void dfs(int)':
foo.cc:55:13: warning: unused variable 'res' [-Wunused-variable]
   55 |         int res=0x3f3f3f3f;
      |             ^~~
foo.cc: In function 'int main()':
foo.cc:94:12: warning: unused variable 'pw' [-Wunused-variable]
   94 |         ll pw=1;ans=0;
      |            ^~
Expand

#	状态分数	耗时	内存占用

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

#include<bits/stdc++.h>//T1 BF
using namespace std;
#define ll long long
#define pb push_back
const int N=25;
const ll mod=1e9+7,Q=250000002;
ll ans;
int c,t,n,m,MST;
bool b[N][N];
struct edge{
    int x,y,w;
}e[N*N],p[N*N];
int fa[N],tp[N*N];
ll f[1<<15],g[1<<15];
int get(int x){
    if(x!=fa[x]) return fa[x]=get(fa[x]);
    return fa[x];
}
bool cmp(edge x,edge y){
    return x.w<y.w;
}
int mst(int ct){
    for(int i=1;i<=n;i++) fa[i]=i;
    sort(p+1,p+ct+1,cmp);int now=0,ans=0;
    for(int i=1;i<=ct;i++){ 
        int x=get(p[i].x),y=get(p[i].y),w=p[i].w;
        if(x==y) continue;
        fa[x]=y,ans+=w,now++;
        if(now==n-1) break;
    }
    if(now<n-1) return 0x3f3f3f3f;
    return ans;
}
bool vis[N];
int s,RES;
vector<edge>E;
void D(int u,int sum,int cnt){
    if(sum>MST||RES==MST) return;
    if(cnt==n-1){
        RES=sum;
        return;
    }
    vis[u]=1;
    for(edge e:E){
        if(e.x==u){
            if(!vis[e.y]){
                D(e.y,sum+e.w,cnt+1);
            }
        }
    }
    vis[u]=0;
}
void dfs(int k){
    if(k==m+1){
        int res=0x3f3f3f3f;
        for(int i=1;i<=n;i++){
            memset(vis,0,sizeof(vis));
            RES=0x3f3f3f3f;
            D(i,0,0);
            if(RES==MST){
                ans++;
                break;
            }
        }
        return;
    }
    dfs(k+1);
    E.pb({e[k].x,e[k].y,e[k].w});
    dfs(k+1);
    E.pop_back();
    E.pb({e[k].y,e[k].x,e[k].w});
    dfs(k+1);
    E.pop_back();
    E.pb({e[k].x,e[k].y,e[k].w});
    E.pb({e[k].y,e[k].x,e[k].w});
    dfs(k+1);
    E.pop_back();E.pop_back();
}
ll qp(ll x,ll y){
    ll res=1;
    while(y){
        if(y&1) res=res*x%mod;
        x=x*x%mod,y>>=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);
        for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) b[i][j]=0;
        ll pw=1;ans=0;
        for(int i=1;i<=m;i++){
            scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].w),p[i]=e[i];
            b[e[i].x][e[i].y]=b[e[i].y][e[i].x]=1;
        }
        if(c>=4&&c<=6){
            ll iv=(mod+1)/2;
            ans=(n-1)*qp(iv,n-2)%mod*iv%mod*iv%mod;
            (ans+=qp(iv,n-1))%=mod;
            printf("%lld\n",ans);
            continue;
        }
        
        // if(c>=7&&c<=16){
        //     memset(f,0,sizeof(f));
        //     memset(g,0,sizeof(g));
        //     g[0]=1;
        //     for(int i=1;i<=n;i++){
        //         g[1<<i-1]=1;
        //         for(int S=1;S<(1<<n);S++){
        //             if((S>>i-1)&1){
        //                 int T=S^(1<<i-1),lw=T&-T;
        //                 if(!lw)continue;
        //                 for(int T=T^lw;;T=(T-1)&S){
        //                     int P=T|lw;
        //                     // for(int j=0;j<n;j++){
        //                     //     if(P>>j&1){
        //                     //         if(b[j+1][])
        //                     //     }
        //                     // }
        //                     // if(!T) break;
        //                 }
        //             }
                    
        //         }
        //     }
        // }
        // pw=qp(2,2*m);
        // MST=mst(m); 
        // if(n<=6){
        //     dfs(1);
        //     printf("%lld\n",ans*qp(pw,mod-2)%mod);
        // }
    }
    return 0;
}

递交者: ZJ-113
题目: NOISX2025GFE NOISX2025GFE
比赛: 【官方数据 ZJ】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 3.3 KiB
递交时间: 2025-3-6 19:41:31
评测时间: 2025-3-6 20:03:24

分数: 12
总耗时: 31ms
峰值时间: 1ms
峰值内存: 408 KiB

12 Wrong Answer

代码

信息

还没有账户？

登录