Submission #2413138


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const long long inf = pow(2, 51);

long long cost[51][51];
int route[51][51];

long long dfs(int a, const int b) {
  if (a == b) return cost[a][b] = 0;
  if (a < b) return cost[a][b] = inf;
  if (cost[a][b] != -1) return cost[a][b];
  long long ret = inf;
  for (int k = 1; k < a; k++) {
    long long c = dfs(a % k, b) + (1LL << k);
    if (ret > c) {
      ret = c;
      route[a][b] = k;
    }
  }
  return cost[a][b] = ret;
}

bool canMakeB(int maxk, vector<int> a, const vector<int>& b) {
  cerr << " ---------- " << maxk << " ---------- " << endl;
  while (true) {
    vector<int> orga = a;
    for (int k = maxk; k >= 1; k--) {
      for (int i = 0; i < a.size(); i++) {
        if (cost[a[i] % k][b[i]] < cost[a[i]][b[i]]) {
          a[i] %= k;
        }
      }
    }
    if (equal(a.begin(), a.end(), orga.begin())) return false;
    if (equal(a.begin(), a.end(), b.begin())) return true;
  }
  return false;
}
long long calcCost(const vector<int>& s) {
  long long ret = 0;
  for (auto ss : s) {
    ret += (1LL << ss);
  }
  return ret;
}

int main(void) {
  memset(cost, -1, sizeof(cost));
  memset(route, -1, sizeof(route));

  int N;
  cin >> N;
  vector<int> a(N), b(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < N; i++) {
    cin >> b[i];
  }
  for (int i = 0; i <= 50; i++) {
    for (int j = 0; j <= 50; j++) {
      dfs(i, j);
    }
  }
  if (equal(a.begin(), a.end(), b.begin())) {
    cout << 0 << endl;
    return 0;
  }

  long long ret = 0;
  int previ = -1;
  vector<int> s;
  for (int i = 49; i >= 0; i--) {
    if (!canMakeB(i, a, b)) {
      if (previ == i) {
        cout << -1 << endl;
        return 0;
      }
      previ = i;
      i++;
      int k = i;
      s.push_back(k);
      for (int j = 0; j < N; j++) {
        // cerr << cost[a[j]][b[j]] << " " << cost[a[j] % k][b[j]] << endl;
        // cerr << a[j] << " -> ";
        if (cost[a[j]][b[j]] >= cost[a[j] % k][b[j]]) a[j] %= k;
        // cerr << a[j] << endl;
      }
      if (equal(a.begin(), a.end(), b.begin())) {
        cout << calcCost(s) << endl;
        return 0;
      }
    }
  }
  if (equal(a.begin(), a.end(), b.begin())) cout << calcCost(s) << endl;
  else cout << -1 << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Remainder Game
User tkzw_21
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2376 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 5
AC × 37
WA × 21
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
Case Name Status Exec Time Memory
01.txt AC 2 ms 256 KB
02.txt AC 2 ms 256 KB
03.txt AC 2 ms 256 KB
04.txt AC 2 ms 256 KB
05.txt AC 2 ms 256 KB
06.txt AC 2 ms 256 KB
07.txt AC 2 ms 256 KB
08.txt AC 2 ms 256 KB
09.txt AC 2 ms 256 KB
10.txt AC 2 ms 256 KB
11.txt AC 2 ms 256 KB
12.txt AC 2 ms 256 KB
13.txt AC 2 ms 256 KB
14.txt WA 2 ms 256 KB
15.txt WA 2 ms 256 KB
16.txt WA 2 ms 256 KB
17.txt WA 2 ms 256 KB
18.txt AC 2 ms 256 KB
19.txt WA 2 ms 256 KB
20.txt WA 2 ms 256 KB
21.txt WA 2 ms 256 KB
22.txt WA 2 ms 256 KB
23.txt WA 2 ms 256 KB
24.txt AC 2 ms 256 KB
25.txt AC 2 ms 256 KB
26.txt AC 2 ms 256 KB
27.txt AC 2 ms 256 KB
28.txt AC 2 ms 256 KB
29.txt AC 2 ms 256 KB
30.txt AC 2 ms 256 KB
31.txt AC 2 ms 256 KB
32.txt AC 2 ms 256 KB
33.txt AC 2 ms 256 KB
34.txt AC 2 ms 256 KB
35.txt AC 2 ms 256 KB
36.txt AC 2 ms 256 KB
37.txt WA 2 ms 256 KB
38.txt AC 2 ms 256 KB
39.txt WA 2 ms 256 KB
40.txt WA 2 ms 256 KB
41.txt WA 2 ms 256 KB
42.txt AC 2 ms 256 KB
43.txt AC 2 ms 256 KB
44.txt WA 2 ms 256 KB
45.txt WA 2 ms 256 KB
46.txt WA 2 ms 256 KB
47.txt WA 2 ms 256 KB
48.txt WA 2 ms 256 KB
49.txt AC 2 ms 256 KB
50.txt WA 2 ms 256 KB
51.txt AC 2 ms 256 KB
52.txt WA 2 ms 256 KB
53.txt WA 2 ms 256 KB
s1.txt AC 2 ms 256 KB
s2.txt AC 2 ms 256 KB
s3.txt AC 2 ms 256 KB
s4.txt AC 2 ms 256 KB
s5.txt AC 2 ms 256 KB