Submission #2177857


Source Code Expand

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

using ll = long long;
using P = pair<int, int>;

const int INF = 1e9;
const int MOD = 1e9 + 7;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main() {
  // 入力
  int N;
  cin >> N;
  ll a[N], b[N];
  for (int i = 0; i < N; i++) cin >> a[i] >> b[i];

  // N項目から決めていく
  ll ans = 0;
  for (int i = N - 1; i >= 0; i--) {
    if (a[i] + ans < b[i]) {
      ans += b[i] - (a[i] + ans);
    } else if (a[i] + ans > b[i]) {
      if ((a[i] + ans) % b[i] != 0) {
        ll s = (a[i] + ans) / b[i];
        ans += (s + 1) * b[i] - (a[i] + ans);
      }
    }
  }

  // 解答
  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task A - Multiple Array
User university
Language C++14 (GCC 5.4.1)
Score 0
Code Size 771 Byte
Status WA
Exec Time 90 ms
Memory 2300 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 14
WA × 4
Set Name Test Cases
Sample s1.txt, s2.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, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 89 ms 2300 KB
02.txt AC 80 ms 1792 KB
03.txt AC 80 ms 1792 KB
04.txt AC 80 ms 1792 KB
05.txt AC 80 ms 1792 KB
06.txt AC 80 ms 1792 KB
07.txt AC 57 ms 1792 KB
08.txt AC 90 ms 1792 KB
09.txt WA 58 ms 1792 KB
10.txt AC 84 ms 1792 KB
11.txt AC 56 ms 1792 KB
12.txt WA 34 ms 1792 KB
13.txt AC 58 ms 1792 KB
14.txt AC 86 ms 1792 KB
15.txt WA 1 ms 256 KB
16.txt WA 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB