#851605 (C++17) No.101 ぐるぐる！あみだくじ！

提出ソース

結果

問題	No.101 ぐるぐる！あみだくじ！
ユーザー	jabee
提出日時	2023-03-22 12:04:12
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,026 bytes
コンパイル時間	5,156 ms
コンパイル使用メモリ	275,892 KB
実行使用メモリ	24,320 KB
最終ジャッジ日時	2024-09-18 14:51:26
合計ジャッジ時間	29,549 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	33 ms 19,072 KB
testcase_01	AC	32 ms 18,944 KB
testcase_02	AC	32 ms 18,944 KB
testcase_03	AC	33 ms 18,944 KB
testcase_04	WA	-
testcase_05	AC	33 ms 18,944 KB
testcase_06	WA	-
testcase_07	AC	33 ms 18,944 KB
testcase_08	AC	33 ms 18,944 KB
testcase_09	AC	33 ms 18,944 KB
testcase_10	AC	32 ms 18,816 KB
testcase_11	AC	1,273 ms 18,944 KB
testcase_12	AC	1,697 ms 18,944 KB
testcase_13	AC	1,946 ms 18,944 KB
testcase_14	WA	-
testcase_15	AC	188 ms 18,944 KB
testcase_16	AC	232 ms 18,944 KB
testcase_17	AC	241 ms 18,944 KB
testcase_18	AC	256 ms 18,944 KB
testcase_19	AC	331 ms 18,944 KB
testcase_20	WA	-
testcase_21	AC	41 ms 18,944 KB
testcase_22	AC	446 ms 19,072 KB
testcase_23	AC	327 ms 18,944 KB
testcase_24	AC	3,682 ms 18,944 KB
testcase_25	AC	3,541 ms 18,944 KB
testcase_26	AC	2,681 ms 18,944 KB
testcase_27	TLE	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: In function 'll dfs(std::vector<long long int>, ll, ll)':
main.cpp:124:1: warning: control reaches end of non-void function [-Wreturn-type]
  124 | }
      | ^

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
ll dp[2][14][14][14][14][60];
ll seen[2][14][14][14][14][60];
ll tot;
ll dfs(vector<ll>v,ll now, ll turn){
   if(seen[turn][v[0]][v[1]][v[2]][v[3]][now]){
   return dp[turn][v[0]][v[1]][v[2]][v[3]][now];
   }
  seen[turn][v[0]][v[1]][v[2]][v[3]][now] = 1;
  
  
   ll res;
  ll nxtturn = turn ^1;
  ll nowtot = 0;
  rep(k,0,4)nowtot += v[k];

  if(turn == 0){
    res = 0;  
   rep(i,0,4)rep(j,1,4){
     if(v[i] - j < 0)continue;
     v[i]-=j;
     ll nxtnow = now + j;    
     ll jiro = tot - nowtot - now;
     if(v[i] == 0)nxtnow += (jiro + 1) / 2;
     chmax(res,dfs(v,nxtnow,nxtturn) + j);
     v[i]+=j;
   }
    return dp[turn][v[0]][v[1]][v[2]][v[3]][now] = res;
  }
  
  if(turn == 1){
    res = infl;  
   rep(i,0,4)rep(j,1,4){
     if(v[i] - j < 0)continue;
     v[i]-=j;
     ll nxtnow = now;
     if(v[i] == 0)nxtnow = now - (now + 1) / 2;
     chmin(res,dfs(v,nxtnow,nxtturn));
     v[i]+=j;
   }
    return dp[turn][v[0]][v[1]][v[2]][v[3]][now] = res;
  }  
  
}
void _main() {
  ll n,k;
  cin >> n >> k;
  dsu d(n);
  vector<ll>x(k),y(k);
  rep(i,0,k){
    cin >> x[i] >> y[i];
    x[i]--; y[i]--;
    d.merge(x[i],y[i]);
  }
  vector<ll>now(n);
  rep(i,0,n)now[i] = i;
  
  vector<vector<int>> groups = d.groups();
  
  rep(i,0,groups.size())sort(all(groups[i]));
  
  vector<ll>cycle(groups.size(),-1);
  ll time = 0;
  while(1){
  time++;
  rep(i,0,k)swap(now[x[i]],now[y[i]]);
  vector<vector<int>>check(groups.size());
  ll idx = -1;
  ll before_leader = -1;
  rep(i,0,n){
  ll l = d.leader(now[i]);
  if(l == before_leader)check[idx].push_back(now[i]);
  else{
  before_leader = l;
  idx++;  
  check[idx].push_back(now[i]);
  } 
  }

  rep(i,0,groups.size()){
    if(check[i] == groups[i] && cycle[i] == -1)cycle[i] = time;
  }
  bool complete_flag = true;
  rep(i,0,groups.size())if(cycle[i] == -1)complete_flag = false;
  if(complete_flag)break;
  }
  
  ll ans = 1;
  rep(i,0,groups.size())ans *= cycle[i];
  
  cout << ans << endl;
  
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード