Submission #1333055
Source Code Expand
#include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumplll(x1, x2, x3) fprintf(stderr, "#%s.%d (%s, %s, %s) = (%ld, %ld, %ld)\n", __func__, __LINE__, #x1, #x2, #x3, x1, x2, x3);
#define dumpd(x1) fprintf(stderr, "#%s.%d (%s) = (%lf)\n", __func__, __LINE__, #x1, x1);
#define dumpdd(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%lf, %lf)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define loop for(;;)
typedef std::vector<long> LI;
template<typename T> void scan1(T& x) { fprintf(stderr, "unknown type\n"); }
template<> void scan1(long& x) { if( scanf("%ld", &x) < 0 ) exit(0); }
template<> void scan1(std::string& x) { if( not ( std::cin >> x ) ) exit(0); }
void scan() {}
template<typename Head, typename... Tail>
void scan(Head& x, Tail&... xs) {
scan1(x); scan(xs...);
}
struct Solver {
Solver() { fprintf(stderr, "--------Solver begin--------\n"); }
~Solver() { fprintf(stderr, "--------Solver end--------\n"); }
double winProb(long x, long y) {
return 1.0 / (1.0 + pow(10, (y - x) / 400.0));
}
void solve() {
long n; scan(n);
LI xs(n), ys(n);
for(long i = 0; i < n; ++i) scan(xs[i], ys[i]);
long shift = 0;
for(long i = n - 1; i >= 0; --i) {
long t = (xs[i] + shift + ys[i] - 1) / ys[i] * ys[i];
long s = t - xs[i] - shift;
shift += s;
}
printf("%ld\n", shift);
}
};
int main() {
loop std::unique_ptr<Solver>(new Solver())->solve();
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
spica314 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1806 Byte |
Status |
AC |
Exec Time |
26 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 |
26 ms |
1792 KB |
02.txt |
AC |
26 ms |
1792 KB |
03.txt |
AC |
25 ms |
1792 KB |
04.txt |
AC |
26 ms |
1792 KB |
05.txt |
AC |
25 ms |
1792 KB |
06.txt |
AC |
25 ms |
1792 KB |
07.txt |
AC |
21 ms |
1792 KB |
08.txt |
AC |
26 ms |
1792 KB |
09.txt |
AC |
21 ms |
1792 KB |
10.txt |
AC |
26 ms |
1792 KB |
11.txt |
AC |
21 ms |
1792 KB |
12.txt |
AC |
17 ms |
1792 KB |
13.txt |
AC |
21 ms |
1792 KB |
14.txt |
AC |
26 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 |