#317845 (C++14) No.317 辺の追加

• 問題: No.317 辺の追加
• ユーザー: char134217728
• 提出日時: 2019-02-21 16:16:15
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 314 ms / 2,000 ms
• コード長: 3,368 bytes
• コンパイル時間: 2,176 ms
• コンパイル使用メモリ: 187,368 KB
• 実行使用メモリ: 8,064 KB
• 最終ジャッジ日時: 2024-11-18 20:47:50
• 合計ジャッジ時間: 8,350 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	70 ms; 5,248 KB
testcase_03	AC	47 ms; 5,248 KB
testcase_04	AC	164 ms; 5,248 KB
testcase_05	AC	39 ms; 5,248 KB
testcase_06	AC	49 ms; 5,248 KB
testcase_07	AC	18 ms; 5,248 KB
testcase_08	AC	314 ms; 5,632 KB
testcase_09	AC	97 ms; 5,248 KB
testcase_10	AC	76 ms; 5,248 KB
testcase_11	AC	96 ms; 8,064 KB
testcase_12	AC	76 ms; 5,248 KB
testcase_13	AC	135 ms; 7,168 KB
testcase_14	AC	82 ms; 5,248 KB
testcase_15	AC	77 ms; 5,248 KB
testcase_16	AC	169 ms; 5,248 KB
testcase_17	AC	81 ms; 5,248 KB
testcase_18	AC	74 ms; 5,248 KB
testcase_19	AC	76 ms; 5,248 KB
testcase_20	AC	222 ms; 5,504 KB
testcase_21	AC	16 ms; 5,248 KB
testcase_22	AC	9 ms; 5,248 KB
testcase_23	AC	12 ms; 5,248 KB
testcase_24	AC	26 ms; 5,248 KB
testcase_25	AC	19 ms; 5,248 KB
testcase_26	AC	21 ms; 5,248 KB
testcase_27	AC	17 ms; 5,248 KB
testcase_28	AC	10 ms; 5,248 KB
testcase_29	AC	5 ms; 5,248 KB
testcase_30	AC	71 ms; 5,248 KB
testcase_31	AC	51 ms; 5,248 KB
testcase_32	AC	53 ms; 5,248 KB
testcase_33	AC	52 ms; 5,248 KB
testcase_34	AC	52 ms; 5,248 KB
testcase_35	AC	53 ms; 5,248 KB
testcase_36	AC	53 ms; 5,248 KB
testcase_37	AC	53 ms; 5,248 KB
testcase_38	AC	65 ms; 5,248 KB
testcase_39	AC	53 ms; 5,248 KB

コンパイルメッセージ

main.cpp:73:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   73 | main(){
      | ^~~~

ソースコード

#include <bits/stdc++.h>
#include "unistd.h"
using namespace std;
#define WA cout<<"char134217728";exit(0)
#define RE throw
#define TLE sleep(1000)
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());

const int N = 1e5;
struct UnionFind{
  vector<int> p;
  int g;
  void init(int n){
    p = vector<int>(n, -1);
    g = n;
  }
  int find(int a){
    return p[a] < 0 ? a : p[a] = find(p[a]);
  }
  bool merge(int a, int b){
    a = find(a);
    b = find(b);
    if(a == b) return 0;
    g--;
    if(p[a] > p[b]) swap(a, b);
    p[a] += p[b];
    p[b] = a;
    return 1;
  }
} uf;
int n, m, DP[N+1];
map<int, int> p;
set<pii> s;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  uf.init(n);
  FOR(i, 0, m){
    int a, b;
    cin >> a >> b;
    a--; b--;
    uf.merge(a, b);
  }
  FOR(i, 0, n) if(uf.find(i)==i) p[-uf.p[uf.find(i)]]++;
  Fill(DP, IINF);
  DP[0] = 0;
  each(itr, p){
    int a = itr->fi, b = itr->se;
    if(b < 5){
      FOR(i, 0, b) FORR(j, n, a) mins(DP[j], DP[j-a]+1);
    }else{
      FOR(i, 0, a){
        int e = n-i;
        FOR(j, 0, b+1){
          int k = e-j*a;
          if(k<0) break;
          s.insert(mp(DP[k]-k/a, k));
        }
        while(e >= 0){
          pii t = *s.begin();
          s.erase(mp(DP[e]-e/a, e));
          DP[e] = t.fi+e/a;
          e -= a;
          int k = e-b*a;
          if(k>=0) s.insert(mp(DP[k]-k/a, k));
        }
      }
    }
  }
  FOR(i, 1, n+1) printf("%d\n", DP[i]==IINF ? -1 : DP[i]-1);
}