#391879 (C++14) No.261 ぐるぐるぐるぐる！あみだくじ！

提出ソース

結果

問題	No.261 ぐるぐるぐるぐる！あみだくじ！
ユーザー	fumiphys
提出日時	2019-10-19 19:32:56
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,932 bytes
コンパイル時間	2,002 ms
コンパイル使用メモリ	183,140 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-27 15:34:32
合計ジャッジ時間	3,420 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	9 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
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	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-

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

ソースコード

raw source code

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template<typename T>
T extgcd(T a, T b, T &x, T &y){ 
  T d = a;
  if(b != 0){
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  }else{
    x = 1, y = 0;
  }
  return d;
}

template <typename T>
T modinv(T a, T m){
  long long x = 0, y = 0;
  extgcd<long long>(a, m, x, y);
  x %= m;
  if(x < 0)x += m;
  return x;
}

template <typename T>
long long garner(vector<T> b, vector<T> m, T MOD){
  m.emplace_back(MOD);
  vector<long long> coef(m.size(), 1);
  vector<long long> consts(m.size(), 0);
  for(int i = 0; i < b.size(); i++){
    long long t = ((b[i] - consts[i]) % m[i]) * modinv<long long>(coef[i], m[i]) % m[i];
    if(t < 0)t += m[i];
    for(int j = i + 1; j < m.size(); j++){
      consts[j] = (consts[j] + t * coef[j] % m[j]) % m[j];
      coef[j] = coef[j] * m[i] % m[j];
    }
  }
  return consts.back();
}

template<typename T>
T gcd(T a, T b) {
  if(a > b)return gcd(b, a);
  if(a == 0)return b;
  return gcd(b % a, a);
}

template <typename T>
long long arbitrary_garner(vector<T> &b, vector<T> &m, T MOD){
  for(int i = 0; i < b.size(); i++){
    for(int j = 0; j < i; j++){
      T g = gcd(m[i], m[j]);
      if((b[i] - b[j]) % g != 0)return -1;

      m[i] /= g, m[j] /= g;

      T gi = gcd(m[i], g), gj = g / gi;

      do{
        g = gcd(gi, gj);
        gi *= g, gj /= g;
      }while(g != 1);

      m[i] *= gi, m[j] *= gj;
      b[i] %= m[i], b[j] %= m[j];
    }
  }
  return garner<T>(b, m, MOD);
}

int main(int argc, char const* argv[])
{
  int n, k; cin >> n >> k;
  vector<int> v(n); rep(i, n)v[i] = i;
  rep(i, k){
    int x, y; cin >> x >> y; x--; y--;
    swap(v[x], v[y]);
  }
  vector<int> idx(n, -1);
  vector<vector<int>> ids;
  int curr = 0;
  rep(i, n){
    if(idx[i] >= 0)continue;
    int j = i;
    do{
      idx[j] = curr;
      j = v[j];
    }while(j != i);
    curr++;
  }
  rep(i, curr){
    vector<int> vec;
    rep(j, n){
      if(idx[j] == i){
        vec.pb(v[j]);
      }
    }
    ids.pb(vec);
  }
  int q; cin >> q;
  rep(i_, q){
    vector<int> s(n); cin >> s;
    rep(i, n)s[i]--;
    vector<vector<int>> qi;
    rep(j, curr){
      vector<int> vec;
      rep(k, n){
        if(idx[k] == j){
          vec.pb(s[k]);
        }
      }
      qi.pb(vec);
    }
    vector<ll> b, m;
    bool ng = false;
    rep(i, sz(ids)){
      //cerr << ids[i] << endl;
      //cerr << qi[i] << endl;
      //cerr << "-------------" << endl;
      int B = -1;
      rep(j, sz(ids[i])){
        bool flg = true;
        rep(k, sz(ids[i])){
          if(ids[i][k] != qi[i][(k+j)%sz(ids[i])])flg = false;
        }
        if(flg){
          B = j;
          break;
        }
      }
      if(B >= 0){
        b.pb((B+1+sz(ids[i])) % sz(ids[i]));
        m.pb(sz(ids[i]));
      }else{
        ng = true;
        break;
      }
    }
    if(!ng){
      ll res = arbitrary_garner<ll>(b, m, mod);
      if(res == 0){
        res = m[0];
        FOR(i, 1, sz(m)){
          res = res / gcd<ll>(res, m[i]) * m[i];
        }
      }
      cout << res << endl;
    }else{
      cout << -1 << endl;
    }
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード