結果
| 問題 | No.317 辺の追加 |
| ユーザー |
 LayCurse
|
| 提出日時 | 2015-12-10 15:29:05 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 14 ms / 2,000 ms |
| コード長 | 6,302 bytes |
| コンパイル時間 | 1,566 ms |
| コンパイル使用メモリ | 163,988 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-09-15 07:33:24 |
| 合計ジャッジ時間 | 4,188 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 38 |
コンパイルメッセージ
main.cpp: In function ‘void update(int, int, int)’:
main.cpp:100:23: warning: narrowing conversion of ‘c’ from ‘int’ to ‘unsigned int’ [-Wnarrowing]
100 | unsigned cc[4] = {c,c,c,c};
| ^
main.cpp:100:25: warning: narrowing conversion of ‘c’ from ‘int’ to ‘unsigned int’ [-Wnarrowing]
100 | unsigned cc[4] = {c,c,c,c};
| ^
main.cpp:100:27: warning: narrowing conversion of ‘c’ from ‘int’ to ‘unsigned int’ [-Wnarrowing]
100 | unsigned cc[4] = {c,c,c,c};
| ^
main.cpp:100:29: warning: narrowing conversion of ‘c’ from ‘int’ to ‘unsigned int’ [-Wnarrowing]
100 | unsigned cc[4] = {c,c,c,c};
| ^
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
15 | void reader(double *x){scanf("%lf",x);}
| ~~~~~^~~~~~~~~
In member function ‘void* unionFind::malloc(int, void*)’,
inlined from ‘int main()’ at main.cpp:115:18:
main.cpp:43:16: warning: ‘uf.unionFind::N’ is used uninitialized [-Wuninitialized]
43 | return d + N;
| ^
main.cpp: In function ‘int main()’:
main.cpp:112:13: note: ‘uf’ declared here
112 | unionFind uf;
| ^~
ソースコード
#include<bits/stdc++.h>using namespace std;#define REP(i,a,b) for(i=a;i<b;i++)#define rep(i,n) REP(i,0,n)#define mygc(c) (c)=getchar_unlocked()#define mypc(c) putchar_unlocked(c)#define ll long long#define ull unsigned llvoid reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}void reader(double *x){scanf("%lf",x);}int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}void writer(double x, char c){printf("%.15f",x);mypc(c);}void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}template<class T> void writerLn(T x){writer(x,'\n');}template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}char memarr[17000000]; void *mem = memarr;#define INF 1000000000template<class T> void sort(int N, T a[], void *mem = NULL){sort(a,a+N);}template<class T1, class T2> void sort(int N, T1 a[], T2 b[], void *mem){int i;pair<T1,T2> *r=(pair<T1, T2>*)mem;rep(i,N)r[i].first=a[i],r[i].second=b[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second;}template<class T1, class T2, class T3> void sort(int N, T1 a[], T2 b[], T3 c[], void *mem){int i;pair<T1,pair<T2,T3> > *r=(pair<T1,pair<T2,T3> >*)mem;rep(i,N)r[i].first=a[i],r[i].second.first=b[i],r[i].second.second=c[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second.first,c[i]=r[i].second.second;}template<class T1, class T2, class T3, class T4> void sort(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem){int i;pair<pair<T1,T2>,pair<T3,T4> > *r=(pair<pair<T1,T2>,pair<T3,T4> >*)mem;rep(i,N)r[i].first.first=a[i],r[i].first.second=b[i],r[i].second.first=c[i],r[i].second.second=d[i];sort(r,r+N);rep(i,N)a[i]=r[i].first.first,b[i]=r[i].first.second,c[i]=r[i].second.first,d[i]=r[i].second.second;}struct unionFind{int *d, N;void *malloc(int n, void *mem){d = (int*)mem;return d + N;}void init(int n){int i;N = n;rep(i,n) d[i] = -1;}int get(int i){int t = i, k;while(d[t]>=0) t=d[t];while(d[i]>=0) k=d[i],d[i]=t,i=k;return i;}int connect(int a, int b){a=get(a);b=get(b);if(a==b) return 0;if(d[a] < d[b]) d[a] += d[b], d[b] = a;else d[b] += d[a], d[a] = b;return 1;}int sizeList(int res[]){int i, sz=0;rep(i,N) if(d[i]<0) res[sz++] = -d[i];return sz;}};void unionInit(int d[],int s){int i;rep(i,s)d[i]=i;}int unionGet(int d[],int n){int t=n,k;while(d[t]!=t)t=d[t];while(d[n]!=n)k=d[n],d[n]=t,n=k;return n;}int unionConnect(int d[],int a,int b){a=unionGet(d,a);b=unionGet(d,b);if(a==b)return 0;d[a]=b;return 1;}template<class S, class T> inline void chmin(S &a, T b){if(a>b)a=b;}template<class S, class T> inline void chmax(S &a, T b){if(a<b)a=b;}#define SSE2_M128I_ADD32(c,a,b) asm volatile("movdqu %1, %%xmm0;" "movdqu %2, %%xmm1;" "paddd %%xmm1, %%xmm0;" "movdqu %%xmm0, %0;" :"=m"(c) :"m"(a),"m"(b) :);#define SSE4_M128U_MIN32(c,a,b) asm volatile("movdqu %1, %%xmm0;" "movdqu %2, %%xmm1;" "pminud %%xmm1, %%xmm0;" "movdqu %%xmm0, %0;" :"=m"(c) :"m"(a), "m"(b) :);// d = min(a,b+c)#define SSE4_M128U_MINADD32(d,a,b,c) asm volatile("movdqu %2, %%xmm0;" "movdqu %3, %%xmm1;" "paddd %%xmm1, %%xmm0;" "movdqu %1, %%xmm1;" "pminud%%xmm1, %%xmm0;" "movdqu %%xmm0, %0;" :"=m"(d) :"m"(a), "m"(b), "m"(c) :);#define AVX2_M256I_ADD32(c,a,b) asm volatile("vmovdqu %1, %%ymm0;" "vmovdqu %2, %%ymm1;" "vpaddd %%ymm1, %%ymm0, %%ymm0;" "vmovdqu %%ymm0, %0;" :"=m"(c) :"m"(a), "m"(b) :);#define AVX2_M256I_MIN32(c,a,b) asm volatile("vmovdqu %1, %%ymm0;" "vmovdqu %2, %%ymm1;" "vpminud %%ymm1, %%ymm0, %%ymm0;" "vmovdqu %%ymm0, %0;" :"=m"(c) :"m"(a), "m"(b) :);// d = min(a,b+c)#define AVX2_M256U_MINADD32(d,a,b,c) asm volatile("vmovdqu %2, %%ymm0;" "vmovdqu %3, %%ymm1;" "vpaddd %%ymm1, %%ymm0, %%ymm0;" "vmovdqu %1, %%ymm1;""vpminud %%ymm1, %%ymm0, %%ymm0;" "vmovdqu %%ymm0, %0;" :"=m"(d) :"m"(a), "m"(b), "m"(c) :);int N, M;int dp[100001];int ind[100001];int cnt[100001], gain[100001];inline void update(int g, int c, int st){int i;if(g < 8){for(i=st;i>=g;i--) chmin(dp[i], dp[i-g]+c);} else {unsigned cc[4] = {c,c,c,c};for(i=st;i-3>=g;i-=4){SSE4_M128U_MINADD32(dp[i-3], dp[i-3], dp[i-g-3], cc[0]);}for(;i>=g;i--) chmin(dp[i], dp[i-g]+c);}}int qs, qcost[100001], qgain[100001];int main(){int i, j, k, st;unionFind uf;reader(&N,&M);mem = uf.malloc(N, mem);uf.init(N);while(M--){reader(&i,&j);uf.connect(i-1, j-1);}k = uf.sizeList(cnt);rep(i,k) gain[cnt[i]]++;st = 0;REP(i,1,N+1) dp[i] = INF;REP(k,1,N+1) while(gain[k]){i = (gain[k]+1) / 2;qcost[qs] = i;qgain[qs++] = k*i;gain[k] -= i;}sort(qs, qgain, qcost, mem);// rep(i,qs) writerLn(i,qgain[i],qcost[i]); return 0;rep(i,qs) update(qgain[i], qcost[i], st+=qgain[i]);REP(i,1,N+1){if(dp[i]==INF) writerLn("-1");else writerLn(dp[i]-1);}return 0;}