Submission #1230344
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; int main() { int n; cin >> n; int t[n], a[n]; for (int i = 0; i < n; i++) { cin >> t[i] >> a[i]; } ll totalT = t[0]; ll totalA = a[0]; for (int i = 1; i < n; i++) { if (t[i] > a[i]) { while (totalA % a[i] != 0) { totalA++; } if (totalT > totalA / a[i] * t[i]) { while (totalT % t[i] != 0) { totalT++; } totalA = totalT / t[i] * a[i]; } else { totalT = totalA / a[i] * t[i]; } } else if (t[i] < a[i]) { while (totalT % t[i] != 0) { totalT++; } if (totalA > totalT / t[i] * a[i]) { while (totalA % a[i] != 0) { totalA++; } totalT = totalA / a[i] * t[i]; } else { totalA = totalT / t[i] * a[i]; } } else { ll mx = max(totalA, totalT); totalA = mx; totalT = mx; } } cout << (ll)(totalA + totalT) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | aiyo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1328 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | AC | 1 ms | 256 KB |
1_010.txt | AC | 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 | 7 ms | 256 KB |