#410255 (C++11) No.950 行列累乗

提出ソース

結果

問題	No.950 行列累乗
ユーザー	koba-e964
提出日時	2019-12-19 02:33:08
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	5,342 bytes
コンパイル時間	1,299 ms
コンパイル使用メモリ	128,984 KB
実行使用メモリ	13,696 KB
最終ジャッジ日時	2024-07-06 23:20:58
合計ジャッジ時間	4,949 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	65 ms 6,940 KB
testcase_02	AC	14 ms 6,944 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	50 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	25 ms 6,940 KB
testcase_08	AC	25 ms 6,944 KB
testcase_09	AC	1 ms 6,944 KB
testcase_10	AC	22 ms 6,940 KB
testcase_11	AC	20 ms 6,940 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	30 ms 6,944 KB
testcase_14	WA	-
testcase_15	AC	2 ms 6,940 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	1 ms 6,944 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	1 ms 6,944 KB
testcase_22	AC	93 ms 13,568 KB
testcase_23	AC	56 ms 6,940 KB
testcase_24	AC	2 ms 6,944 KB
testcase_25	AC	51 ms 6,940 KB
testcase_26	AC	56 ms 6,940 KB
testcase_27	AC	1 ms 6,940 KB
testcase_28	AC	103 ms 13,568 KB
testcase_29	AC	118 ms 13,568 KB
testcase_30	AC	1 ms 6,944 KB
testcase_31	AC	85 ms 13,568 KB
testcase_32	AC	86 ms 13,568 KB
testcase_33	AC	1 ms 6,940 KB
testcase_34	AC	105 ms 13,568 KB
testcase_35	AC	99 ms 13,440 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	52 ms 6,940 KB
testcase_41	AC	51 ms 6,940 KB
testcase_42	AC	1 ms 6,940 KB
testcase_43	AC	99 ms 13,568 KB
testcase_44	AC	88 ms 13,696 KB
testcase_45	AC	2 ms 6,944 KB
testcase_46	AC	143 ms 13,696 KB
testcase_47	WA	-
testcase_48	AC	100 ms 13,568 KB
testcase_49	AC	94 ms 13,568 KB
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	1 ms 6,940 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	AC	51 ms 6,944 KB
testcase_58	AC	11 ms 6,940 KB
testcase_59	AC	1 ms 6,940 KB
testcase_60	AC	1 ms 6,944 KB

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

ソースコード

raw source code

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define DEBUGP(val) cerr << #val << "=" << val << "\n"

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;

const int DEBUG = 1;

ll p;

ll powmod(ll a, ll e) {
  ll prod = 1;
  ll cur = a % p;
  while (e > 0) {
    if (e % 2) prod = prod * cur % p;
    cur = cur * cur % p;
    e /= 2;
  }
  return prod;
}

typedef vector<VL> mat;

// Find min {x | a^x = 1 (mod p) }.
ll period(ll a) {
  assert (a >= 1);
  assert (a < p);
  ll v = p - 1;
  ll i = 2;
  while (i * i <= v) {
    while (v % i == 0) {
      if (powmod(a, v / i) == 1) {
        v /= i;
      } else {
        break;
      }
    }
    i++;
  }
  return v;
}

const ll N = 50000;

ll det(const mat &a) {
  ll tmp = a[0][0] * a[1][1] % p;
  tmp -= a[0][1] * a[1][0] % p;
  return (tmp + p) % p;
}

mat mul(const mat &a, const mat &b) {
  mat c(2, VL(2));
  REP(i, 0, 2) REP(j, 0, 2) REP(k, 0, 2)
    c[i][k] = (c[i][k] + a[i][j] * b[j][k]) % p;
  return c;
}
mat powmat(const mat &a, ll e) {
  mat prod(2, VL(2));
  mat cur(a);
  REP(i, 0, 2) prod[i][i] = 1;
  while (e > 0) {
    if (e % 2) prod = mul(prod, cur);
    cur = mul(cur, cur);
    e /= 2;
  }
  return prod;
}

mat inv(const mat &a) {
  ll d = det(a);
  assert (d != 0);
  d = powmod(d, p - 2);
  mat b(2, VL(2));
  b[0][0] = a[1][1] * d % p;
  b[0][1] = a[0][1] * (p - d) % p;
  b[1][0] = a[1][0] * (p - d) % p;
  b[1][1] = a[0][0] * d % p;
  return b;
}

// Find min {x > 0 | a^x = b (mod p)}.
ll disc_log(ll a, ll b) {
  if (a <= 1) {
    return a == b ? 1 : -1;
  }
  ll per = period(a);
  map<ll, ll> big;
  REP(i, 0, N) {
    big[powmod(a, p - 1 - (N * (ll)i) % (p - 1)) * b % p] = N * (ll)i;
  }
  ll nxt = -1;
  REP(i, 0, N) {
    ll v = powmod(a, i);
    if (big.count(v)) {
      nxt = big[v] + i;
      break;
    }
  }
  return nxt < 0 ? -1 : (nxt + per - 1) % per + 1;
}

VL factors(ll v) {
  VL a;
  ll i = 2;
  while (i * i <= v) {
    int e = 0;
    while (v % i == 0) {
      e++;
      v /= i;
    }
    if (e) a.push_back(i);
    i++;
  }
  if (v > 1) a.push_back(v);
  return a;
}

ll mat_period(mat a) {
  assert (det(a) == 1);
  mat unit(2, VL(2));
  REP(i, 0, 2) unit[i][i] = 1;
  if (a == unit) return 1;
  if (powmat(a, p) == unit) return p;
  ll v = p * p - 1;
  VL f1 = factors(p - 1), f2 = factors(p + 1);
  for (int f: f2) f1.push_back(f);
  for (int f: f1) {
    while (v % f == 0) {
      if (powmat(a, v / f) == unit) {
        v /= f;
      } else {
        break;
      }
    }
  }
  return v;
}

ll disc_log_mat(mat a, mat b) {
  assert (det(a) == 1);
  ll per = mat_period(a);
  map<mat, ll> big;
  mat step = powmat(inv(a), N);
  mat cur(b);
  REP(i, 0, N) {
    big[cur] = N * i;
    cur = mul(cur, step);
  }
  cur = mat(2, VL(2));
  REP(i, 0, 2) cur[i][i] = 1;
  ll nxt = -1;
  REP(i, 0, N) {
    if (big.count(cur)) {
      nxt = big[cur] + i;
      nxt %= per;
      break;
    }
    cur = mul(cur, a);
  }
  return nxt < 0 ? -1 : nxt;
}

int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  mat a(2, VL(2)), b(2, VL(2));
  cin >> p;
  REP(i, 0, 2) {
    REP(j, 0, 2) {
      cin >> a[i][j];
    }
  }
  REP(i, 0, 2) {
    REP(j, 0, 2) {
      cin >> b[i][j];
    }
  }
  // A = kI?
  if (a[0][1] == 0 && a[1][0] == 0 && a[0][0] == a[1][1]) {
    if (b[0][1] == 0 && b[1][0] == 0 && b[0][0] == b[1][1]) {
      cout << disc_log(a[0][0], b[0][0]) << endl;
    } else {
      cout << -1 << endl;
    }
    return 0;
  }
  if (DEBUG) {
    cerr << det(a) << endl;
    cerr << det(b) << endl;
  }
  // B = xA + yI
  VL cons;
  if (a[0][1] != 0) {
    cons.push_back(b[0][1] * powmod(a[0][1], p - 2) % p);
  }
  if (a[1][0] != 0) {
    cons.push_back(b[1][0] * powmod(a[1][0], p - 2) % p);
  }
  if (a[0][0] != a[1][1]) {
    ll diff = (a[0][0] - a[1][1] + p) % p;
    cons.push_back((b[0][0] - b[1][1] + p) % p * powmod(diff, p - 2) % p);
  }
  assert (cons.size() > 0);
  cons.erase(unique(cons.begin(), cons.end()), cons.end());
  if (cons.size() != 1) {
    cout << -1 << endl;
    return 0;
  }
  ll x = cons[0];
  ll y = (b[0][0] - x * a[0][0] % p + p) % p;
  if (DEBUG) {
    cerr << "B = " << x << " A + " << y << " I" << endl;
  }
  ll e = disc_log(det(a), det(b));
  if (e < 0) {
    cout << -1 << endl;
    return 0;
  }
  if (DEBUG) {
    cerr << "|A|^" << e << " = |B|" << endl;
  }
  if (det(a) == 0) {
    // A^2 = z A. Find z = tr(A).
    ll z = (a[0][0] + a[1][1]) % p;
    if (y != 0) {
      cout << -1 << endl;
      return 0;
    }
    if (z == 0) {
      ll ans = x == 1 ? 0 : x == 0 ? 2 : -1;
      cout << ans << endl;
      return 0;
    }
    cout << disc_log(z, x) << endl;
    return 0;
  }
  assert (det(a) != 0);
  ll per = period(det(a));
  mat ap = powmat(a, per);
  b = mul(b, powmat(inv(a), e));
  ll tmp = disc_log_mat(ap, b);
  if (tmp >= 0) {
    cout << tmp * per + e << endl;
  } else {
    cout << -1 << endl;
  }
}

yukicoder

結果

テストケース

ソースコード