Submission #1073740


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>

using namespace std;

const int MAX = 100000;

int main()
{
	int n;
	int a[MAX] = {0}, b[MAX] = {0};

	cin >> n;

	for(int i = 0; i < n; i++)
	{
		cin >> a[i] >> b[i] ;
	}

	int cnt[MAX] = {0};

	for(int i = n-1; i >= 0; i--)
	{
		while(a[i] % b[i] != 0)
		{
			cnt[i]++;
			a[i]++;
		}

		for(int j = i-1; j >= 0; j--)
		{
			a[j] += cnt[i];
		}
	}

	int c = 0;

	for(int i = 0; i < n; i++)
	{
		c += cnt[i];
	}

	cout << c << endl;

	return 0;
}
	

Submission Info

Submission Time
Task A - Multiple Array
User ykmaku
Language C++14 (GCC 5.4.1)
Score 0
Code Size 575 Byte
Status TLE
Exec Time 2102 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 4
TLE × 14
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 2102 ms 1408 KB
02.txt TLE 2102 ms 1408 KB
03.txt TLE 2102 ms 1408 KB
04.txt TLE 2102 ms 1408 KB
05.txt TLE 2102 ms 1408 KB
06.txt TLE 2102 ms 1408 KB
07.txt TLE 2102 ms 1408 KB
08.txt TLE 2102 ms 1408 KB
09.txt TLE 2102 ms 1408 KB
10.txt TLE 2102 ms 1408 KB
11.txt TLE 2102 ms 1408 KB
12.txt TLE 2102 ms 1408 KB
13.txt TLE 2102 ms 1408 KB
14.txt TLE 2102 ms 1408 KB
15.txt AC 4 ms 1408 KB
16.txt AC 4 ms 1408 KB
s1.txt AC 4 ms 1408 KB
s2.txt AC 4 ms 1408 KB