NOI批量评测 - 记录详情

foo.cc: In function 'void sol1::KR()':
foo.cc:20:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   20 |             auto [u,v,w]=e[i];u=gf(u),v=gf(v);
      |                  ^
foo.cc: In function 'void sol1::sol()':
foo.cc:41:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   41 |                 auto [u,v,w]=e[j+1];
      |                      ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	2ms	404 KiB
#2	Accepted 4	2ms	404 KiB
#3	Accepted 4	2ms	404 KiB
#4	Wrong Answer 0 读取到 98183193，应为 535644535。	1ms	404 KiB
#5	Wrong Answer 0 读取到 649408345，应为 427734378。	1ms	404 KiB
#6	Wrong Answer 0 读取到 880195147，应为 981689460。	1ms	404 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	404 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	408 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>
#define LL long long
#define pc __builtin_popcount
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=17,M=305,mod=1e9+7;
int id,T,n,m;int mn,fa[N];
inline int gf(int x){return x==fa[x]?x:fa[x]=gf(fa[x]);}
struct node{int u,v,w;}e[M];
inline int ksm(int x,int p){int s=1;for(;p;(p&1)&&(s=1ll*s*x%mod),x=1ll*x*x%mod,p>>=1);return s;}
namespace sol1
{
    bool f[1<<12|5],vis[N];
    basic_string<int>E[N];
    inline void KR()
    {
        iota(fa+1,fa+1+n,1);mn=0;
        for(int i=1;i<=m;i++)
        {
            auto [u,v,w]=e[i];u=gf(u),v=gf(v);
            if(u!=v) fa[v]=u,mn+=w;
        }
    }
    void dfs(int x)
    {
        vis[x]=1;
        for(int i:E[x]) if(!vis[i]) dfs(i);
    }
    inline void sol()
    {
        KR();
        for(int i=1;i<=m;i++) e[i+m]=e[i],swap(e[i+m].u,e[i+m].v);
        memset(f,0,sizeof(f));m<<=1;
        for(int i=0;i<(1<<m);i++) if(pc(i)==n-1)
        {
            int s=0;
            fill(fa+1,fa+1+n,0);fill(vis+1,vis+1+n,0);
            for(int i=1;i<=n;i++) E[i].clear();
            for(int j=0;j<m;j++) if(i>>j&1)
            {
                auto [u,v,w]=e[j+1];
                fa[v]=u,s+=w;E[u]+=v;
            }
            if(s!=mn) continue;
            for(int j=1;j<=n;j++) if(!fa[j]){dfs(j);break;}
            bool o=1;
            for(int j=1;j<=n;j++) if(!vis[j]){o=0;break;}
            f[i]=o;
        }
        for(int j=0;j<m;j++) for(int i=0;i<(1<<m);i++) if(i>>j&1)
            f[i]|=f[i^(1<<j)];
        int c=0;
        for(int i=0;i<(1<<m);i++) c+=f[i];
        cout<<(1ll*c*ksm(1<<m,mod-2)%mod)<<"\n";
    }
}
inline bool difw()
{
    for(int i=1;i<n;i++) if(e[i].w==e[i+1].w) return 0;
    return 1;
}
namespace sol2
{
    inline void sol()
    {
        cout<<(2ll*(2*n-1)*ksm(1<<((n-1)*2),mod-2)%mod)<<"\n";
    }
}
int main()
{
    fr(years)
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>id>>T;
    while(T--)
    {
        cin>>n>>m;
        for(int i=1,u,v,w;i<=m;i++) cin>>u>>v>>w,e[i]={u,v,w};
        sort(e+1,e+1+m,[](node x,node y){return x.w<y.w;});
        if(max(n,m)<=6){sol1::sol();continue;}
        if(difw()){sol2::sol();continue;}
    }
    return 0;
}

递交者: FJ-SX0020
题目: NOISX2025GFE NOISX2025GFE
比赛: 【官方数据 FJ】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 2.2 KiB
递交时间: 2025-3-6 13:05:51
评测时间: 2025-3-6 16:31:20

分数: 12
总耗时: 33ms
峰值时间: 2ms
峰值内存: 408 KiB

12 Wrong Answer

代码

信息

还没有账户？

登录