Submission #5524177


Source Code Expand

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>

using ll = long long;
using namespace std;

int main() {
	int n;
	cin >> n;
	int a[n], b[n];
	int ans = 0;

	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
	}
	for (int i = n - 1; i >= 0; i--) {
		if(b[i] !=1){
			ans += b[i] - a[i] % b[i];
			for (int j = 0; j <= i; j++) {
				a[j] += b[i] - a[i] % b[i];
			}
		}
	}
	cout << ans;
}

Submission Info

Submission Time
Task A - Multiple Array
User umeboshi123
Language C++14 (GCC 5.4.1)
Score 0
Code Size 633 Byte
Status WA
Exec Time 2103 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 5
WA × 1
TLE × 12
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 TLE 2103 ms 1024 KB
02.txt TLE 2103 ms 1024 KB
03.txt TLE 2103 ms 1024 KB
04.txt TLE 2103 ms 1024 KB
05.txt TLE 2103 ms 1024 KB
06.txt TLE 2103 ms 1024 KB
07.txt AC 71 ms 1024 KB
08.txt TLE 2103 ms 1024 KB
09.txt TLE 2103 ms 1024 KB
10.txt TLE 2103 ms 1024 KB
11.txt TLE 2103 ms 1024 KB
12.txt AC 36 ms 1024 KB
13.txt TLE 2103 ms 1024 KB
14.txt TLE 2103 ms 1024 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