#64464 (C++11) No.317 辺の追加

• 問題: No.317 辺の追加
• ユーザー: LayCurse
• 提出日時: 2015-12-10 14:26:28
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 21 ms / 2,000 ms
• コード長: 4,243 bytes
• コンパイル時間: 1,868 ms
• コンパイル使用メモリ: 163,208 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-15 07:31:17
• 合計ジャッジ時間: 4,167 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	11 ms; 5,376 KB
testcase_03	AC	14 ms; 5,376 KB
testcase_04	AC	10 ms; 5,376 KB
testcase_05	AC	13 ms; 5,376 KB
testcase_06	AC	16 ms; 5,376 KB
testcase_07	AC	7 ms; 5,376 KB
testcase_08	AC	11 ms; 5,376 KB
testcase_09	AC	13 ms; 5,376 KB
testcase_10	AC	19 ms; 5,376 KB
testcase_11	AC	6 ms; 5,376 KB
testcase_12	AC	19 ms; 5,376 KB
testcase_13	AC	7 ms; 5,376 KB
testcase_14	AC	16 ms; 5,376 KB
testcase_15	AC	18 ms; 5,376 KB
testcase_16	AC	11 ms; 5,376 KB
testcase_17	AC	16 ms; 5,376 KB
testcase_18	AC	19 ms; 5,376 KB
testcase_19	AC	20 ms; 5,376 KB
testcase_20	AC	10 ms; 5,376 KB
testcase_21	AC	5 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	4 ms; 5,376 KB
testcase_24	AC	7 ms; 5,376 KB
testcase_25	AC	6 ms; 5,376 KB
testcase_26	AC	6 ms; 5,376 KB
testcase_27	AC	5 ms; 5,376 KB
testcase_28	AC	3 ms; 5,376 KB
testcase_29	AC	3 ms; 5,376 KB
testcase_30	AC	21 ms; 5,376 KB
testcase_31	AC	20 ms; 5,376 KB
testcase_32	AC	19 ms; 5,376 KB
testcase_33	AC	19 ms; 5,376 KB
testcase_34	AC	20 ms; 5,376 KB
testcase_35	AC	20 ms; 5,376 KB
testcase_36	AC	20 ms; 5,376 KB
testcase_37	AC	20 ms; 5,376 KB
testcase_38	AC	21 ms; 5,376 KB
testcase_39	AC	20 ms; 5,376 KB

コンパイルメッセージ

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);}
      |                        ~~~~~^~~~~~~~~

ソースコード

#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 ll

void 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 1000000000

template<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;}

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;}

int N, M;
int dp[100001];
int ind[100001];
int cnt[100001], gain[100001];

void update(int g, int c, int st){
  int i;
  for(i=st;i>=g;i--) chmin(dp[i], dp[i-g]+c);
}

int qs, qcost[100001], qgain[100001];

int main(){
  int i, j, k, st;

  reader(&N,&M);
  unionInit(ind, N);
  while(M--){
    reader(&i,&j);
    unionConnect(ind, i-1, j-1);
  }
  rep(i,N) cnt[unionGet(ind,i)]++;
  rep(i,N) gain[cnt[i]]++;

  st = 0;
  REP(i,1,N+1) dp[i] = INF;
  rep(k,N) 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) update(qgain[i], qcost[i], st+=qgain[i]);

  REP(i,1,N+1){
    if(dp[i]==INF) dp[i] = 0;
    writerLn(dp[i]-1);
  }

  return 0;
}