Submission #1572695
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<30)
#define INFLL (1LL<<62LL)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int N;
cin >> N;
vector<ll> A(N), B(N);
rep(i, N) cin >> A[i] >> B[i];
ll ans = 0;
for (int i = N - 1; i >= 0; i--) {
ll now = ans + A[i];
ll target_val = ceil(1.0 * now / B[i]) * B[i];
ans += target_val - now;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
d2verb |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
726 Byte |
Status |
AC |
Exec Time |
23 ms |
Memory |
1792 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 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 |
22 ms |
1792 KB |
02.txt |
AC |
22 ms |
1792 KB |
03.txt |
AC |
22 ms |
1792 KB |
04.txt |
AC |
22 ms |
1792 KB |
05.txt |
AC |
22 ms |
1792 KB |
06.txt |
AC |
22 ms |
1792 KB |
07.txt |
AC |
17 ms |
1792 KB |
08.txt |
AC |
22 ms |
1792 KB |
09.txt |
AC |
18 ms |
1792 KB |
10.txt |
AC |
22 ms |
1792 KB |
11.txt |
AC |
18 ms |
1792 KB |
12.txt |
AC |
14 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 |
AC |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |