Submission #1818245


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>

#define	MOD 1000000007;
#define PI 3.14159265358979323846;
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int main()
{
	ll N;
	cin >> N;
	ll T[1000], A[1000], P[1000];

	for (ll i = 0; i < N; i++)
	{
		cin >> T[i] >> A[i];

		if (i == 0) {
			P[i] = T[i] + A[i];
		}
		else {
			ll CurrentT = P[i - 1] * T[i - 1] / (T[i - 1] + A[i - 1]);
			ll CurrentA = P[i - 1] * A[i - 1] / (T[i - 1] + A[i - 1]);

			ll b = CurrentT / T[i] + (CurrentT % T[i] == 0 ? 0 : 1);
			ll c = CurrentA / A[i] + (CurrentA % A[i] == 0 ? 0 : 1);

			ll k = max(b, c);

			CurrentT = k * T[i];
			CurrentA = k * A[i];

			P[i] = CurrentT + CurrentA;
		}
	}

	cout << P[N - 1] << endl;
	//printf("%lld\n", P[N - 1]);

	return 0;
}

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User butanokakuni
Language C++14 (GCC 5.4.1)
Score 0
Code Size 911 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 13
WA × 2
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 2 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt WA 1 ms 256 KB
1_010.txt WA 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 2 ms 256 KB
1_014.txt AC 2 ms 256 KB