Submission #1080155
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
struct Initializer {
Initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
}
} initializer;
template<typename T> istream& operator>>(istream &s, vector<T> &v) {
for (T &t : v) s >> t;
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
for (const T &t : v) s << t << endl;
return s;
}
template<typename T> T min(vector<T>& v) {return *min_element(v.begin(), v.end());}
template<typename T> T max(vector<T>& v) {return *max_element(v.begin(), v.end());}
template<typename T> int min_element(vector<T>& v) {return min_element(v.begin(), v.end()) - v.begin();}
template<typename T> int max_element(vector<T>& v) {return max_element(v.begin(), v.end()) - v.begin();}
template<typename T> void sort(vector<T>& v) {sort(v.begin(), v.end());}
template<typename T, typename Function> void sort(vector<T>& v, Function func) {sort(v.begin(), v.end(), func);}
template<typename T> void rsort(vector<T>& v) {sort(v.rbegin(), v.rend());}
template<typename T> void reverse(vector<T>& v) {reverse(v.begin(), v.end());}
template<typename T> void unique(vector<T>& v) {v.erase(unique(v.begin(), v.end()), v.end());}
template<typename T> void nth_element(vector<T>& v, int n) {nth_element(v.begin(), v.begin() + n, v.end());}
template<typename T> bool next_permutation(vector<T>& v) {return next_permutation(v.begin(), v.end());}
template<typename T> int find(vector<T>& v, T t) {return find(v.begin(), v.end(), t) - v.begin();}
template<typename T> int in(vector<T> v, T t) {return find(v, t) != (int)v.size();}
template<typename T> int lower_bound(vector<T>& v, T t) {return lower_bound(v.begin(), v.end(), t) - v.begin();}
template<typename T> int upper_bound(vector<T>& v, T t) {return upper_bound(v.begin(), v.end(), t) - v.begin();}
template<typename T> T accumulate(const vector<T>& v, function<T(T, T)> func = plus<T>()) {return accumulate(v.begin(), v.end(), T(), func);}
template<typename T> void adjacent_difference(vector<T>& v) {adjacent_difference(v.begin(), v.end(), v.begin());}
template<typename T> void adjacent_difference(vector<T>& v, vector<T>& u) {adjacent_difference(v.begin(), v.end(), u.begin());}
template<typename T> void partial_sum(vector<T>& v, vector<T>& u) {partial_sum(v.begin(), v.end(), u.begin());}
template<typename T> T inner_product(vector<T>& v, vector<T>& u) {return inner_product(v.begin(), v.end(), u.begin(), T(0));}
template<typename T> int count(const vector<T>& v, T t) {return count(v.begin(), v.end(), t);}
template<typename T, typename Function> int count_if(const vector<T>& v, Function func) {return count_if(v.begin(), v.end(), func);}
template<typename T, typename Function> void remove_if(vector<T>& v, Function func) {v.erase(remove_if(v.begin(), v.end(), func), v.end());}
template<typename T, typename Function> bool any_of(vector<T> v, Function func) {return any_of(v.begin(), v.end(), func);}
template<typename T> vector<T> subvector(vector<T>& v, int a, int b) {return vector<T>(v.begin() + a, v.begin() + b);}
template<typename T> int kinds(const vector<T>& v) {return set<T>(v.begin(), v.end()).size();}
template<typename T> void iota(vector<T>& v) {iota(v.begin(), v.end(), T());}
template<typename T> bool is_sorted(const vector<T>& v) {return is_sorted(v.begin(), v.end());}
int main() {
int64_t n, r = 0;
cin >> n;
vector<int64_t> a(n), b(n);
for (int i = 0; i < n; ++i) cin >> a[i] >> b[i];
reverse(a);
reverse(b);
for (int i = 0; i < n; ++i) r += (a[i] + r) % b[i] ? b[i] - (a[i] + r) % b[i] : 0;
cout << r << endl;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
not |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
3657 Byte |
Status |
AC |
Exec Time |
28 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 |
27 ms |
1792 KB |
02.txt |
AC |
27 ms |
1792 KB |
03.txt |
AC |
27 ms |
1792 KB |
04.txt |
AC |
27 ms |
1792 KB |
05.txt |
AC |
27 ms |
1792 KB |
06.txt |
AC |
27 ms |
1792 KB |
07.txt |
AC |
21 ms |
1792 KB |
08.txt |
AC |
27 ms |
1792 KB |
09.txt |
AC |
22 ms |
1792 KB |
10.txt |
AC |
27 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 |
28 ms |
1792 KB |
15.txt |
AC |
3 ms |
256 KB |
16.txt |
AC |
3 ms |
256 KB |
s1.txt |
AC |
3 ms |
256 KB |
s2.txt |
AC |
3 ms |
256 KB |