結果
問題 | No.317 辺の追加 |
ユーザー | vjudge1 |
提出日時 | 2024-09-22 17:57:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,815 bytes |
コンパイル時間 | 2,198 ms |
コンパイル使用メモリ | 203,760 KB |
実行使用メモリ | 8,240 KB |
最終ジャッジ日時 | 2024-09-22 17:57:59 |
合計ジャッジ時間 | 5,797 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 7 ms
5,376 KB |
testcase_22 | AC | 5 ms
5,376 KB |
testcase_23 | WA | - |
testcase_24 | AC | 12 ms
5,504 KB |
testcase_25 | AC | 9 ms
5,376 KB |
testcase_26 | AC | 10 ms
5,376 KB |
testcase_27 | AC | 8 ms
5,376 KB |
testcase_28 | WA | - |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 36 ms
5,760 KB |
testcase_33 | AC | 37 ms
5,760 KB |
testcase_34 | WA | - |
testcase_35 | AC | 36 ms
7,248 KB |
testcase_36 | AC | 36 ms
8,240 KB |
testcase_37 | AC | 37 ms
7,536 KB |
testcase_38 | WA | - |
testcase_39 | AC | 37 ms
8,124 KB |
コンパイルメッセージ
main.cpp: In function 'void get(ll, ll)': main.cpp:58:14: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 58 | _For(i,w,n) | ^ main.cpp:14:38: note: in definition of macro '_For' 14 | #define _For(i,l,r) for(register int i=r;i>=l;i--) | ^ main.cpp: In function 'int main()': main.cpp:64:13: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 64 | For(i,1,n){ | ^ main.cpp:13:37: note: in definition of macro 'For' 13 | #define For(i,l,r) for(register int i=l;i<=r;i++) | ^ main.cpp:72:13: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 72 | For(i,1,n) | ^ main.cpp:13:37: note: in definition of macro 'For' 13 | #define For(i,l,r) for(register int i=l;i<=r;i++) | ^ main.cpp:74:13: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 74 | For(i,1,n) | ^ main.cpp:13:37: note: in definition of macro 'For' 13 | #define For(i,l,r) for(register int i=l;i<=r;i++) | ^ main.cpp:76:13: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 76 | For(i,1,n){ | ^ main.cpp:13:37: note: in definition of macro 'For' 13 | #define For(i,l,r) for(register int i=l;i<=r;i++) | ^ main.cpp:79:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 79 | For(j,0,20){ | ^ main.cpp:13:37: note: in definition of macro 'For' 13 | #define For(i,l,r) for(register int i=l;i<=r;i++) | ^ main.cpp:88:13: warning: ISO C++17 does not allow 'register' storage class specifier
ソースコード
#include<bits/stdc++.h> #define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y) #define lowbit(x) x&(-x) #define pi pair<ll,ll> #define pii pair<ll,pair<ll,ll>> #define iip pair<pair<ll,ll>,ll> #define ppii pair<pair<ll,ll>,pair<ll,ll>> #define fi first #define se second #define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x #define Full(a) memset(a,0,sizeof(a)) #define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout); #define For(i,l,r) for(register int i=l;i<=r;i++) #define _For(i,l,r) for(register int i=r;i>=l;i--) using namespace std; typedef double db; typedef unsigned long long ull; typedef long long ll; bool Begin; const ll N=1e5+10,INF=1e9+10; inline ll read(){ ll x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){ if(c=='-') f=-1; c=getchar(); } while(c>='0'&&c<='9'){ x=(x<<1)+(x<<3)+(c^48); c=getchar(); } return x*f; } inline void write(ll x){ if(x<0){ putchar('-'); x=-x; } if(x>9) write(x/10); putchar(x%10+'0'); } ll n,m,x,y,a,s,k,cnt; ll p[N],fa[N],siz[N],ans[N],v[N],w[N],dp[N]; ll Find(ll x){ if(x!=fa[x]) return fa[x]=Find(fa[x]); return fa[x]; } void merge(ll x,ll y){ x=Find(x),y=Find(y); if(x==y) return ; fa[x]=y; } void get(ll w,ll v){ _For(i,w,n) dp[i]=min(dp[i],dp[i-w]+v); } bool End; int main(){ n=read(),m=read(); For(i,1,n){ dp[i]=INF; fa[i]=i; } while(m--){ x=read(),y=read(); merge(x,y); } For(i,1,n) siz[Find(i)]++; For(i,1,n) p[siz[i]]++; For(i,1,n){ if(!p[i]) continue; For(j,0,20){ if((1<<j)<=p[i]){ get(i<<j,1<<j); p[i]-=(1<<j); } if(p[i]) get(p[i]*i,p[i]); } } For(i,1,n){ if(dp[i]==INF) puts("-1"); else{ write(dp[i]-1); putchar('\n'); } } cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB"; return 0; }