Submission #2418191
Source Code Expand
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
using ll = long long;
using PL = P<ll, ll>;
using PS = P<string, ll>;
using VI = V<int>;
using VVI = V<VI>;
using VL = V<ll>;
using VVL = V<VL>;
using VS = V<string>;
using VB = V<bool>;
using VVB = V<VB>;
using VPL = V<PL>;
using VPS = V<PS>;
#define fst first
#define snd second
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
/* ---------- container ---------- */
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define GSORT(c) sort(ALL(c), greater<decltype((c).front())>())
#define SZ(x) (LL((x).size()))
/* ---------- repetition ---------- */
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// Usual REP runs from 0 to n-1 (R: n to 0)
// Natural REP runs from 1 to n (R: n to 1)
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = 3.14159265358979;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
/* ---------- Short Functions ---------- */
template <typename T>
T square(T a) {
return a * a;
}
/* ---------- Debug ---------- */
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
#define testP(p) cout << GET_VAR_NAME(p) << " = (" << (p).fst << ", " << (p).snd << ")" << endl;
/* ^^^^^^^^^^^^^^^ Settting Part ^^^^^^^^^^^^^^^ */
/* ---------- Variances ---------- */
/* ---------- Functions ---------- */
/* ---------- Main Function ---------- */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VL A(N), B(N);
REP(i, N) {
cin >> A[i] >> B[i];
}
ll ans = 0;
RREP(i, N - 1) {
A[i] += ans;
ll push_num = B[i] - ((A[i] - 1) % B[i] + 1);
ans += push_num;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3010 Byte |
Status |
WA |
Exec Time |
23 ms |
Memory |
1792 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
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 |
23 ms |
1792 KB |
02.txt |
AC |
23 ms |
1792 KB |
03.txt |
AC |
23 ms |
1792 KB |
04.txt |
AC |
23 ms |
1792 KB |
05.txt |
AC |
23 ms |
1792 KB |
06.txt |
AC |
23 ms |
1792 KB |
07.txt |
AC |
18 ms |
1792 KB |
08.txt |
AC |
23 ms |
1792 KB |
09.txt |
WA |
19 ms |
1792 KB |
10.txt |
AC |
23 ms |
1792 KB |
11.txt |
AC |
18 ms |
1792 KB |
12.txt |
AC |
15 ms |
1792 KB |
13.txt |
AC |
18 ms |
1792 KB |
14.txt |
AC |
23 ms |
1792 KB |
15.txt |
AC |
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 |