Submission #2637174

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }


int main() {
    int N; cin >> N;

    ll tmin=0, amin=0;
    rep(i,N){
        ll Ti, Ai; cin >> Ti >> Ai;
        ll g = gcd(Ti, Ai);
        Ti /= g; Ai /= g;
        // printf(" %lld %lld [%lld %lld]", tmin, amin, Ti, Ai);

        ll tmag=1, amag=1;
        if (Ti < tmin) tmag = (tmin+Ti-1)/Ti;
        if (Ai < amin) amag = (amin+Ai-1)/Ai;
        ll mag = max(tmag, amag);
        Ti *= mag; Ai *= mag;
        tmin = Ti; amin = Ai;
        // printf(" Tx%lld, Ax%lld, x=%lld -> %lld %lld\n", tmag,amag,mag, tmin,amin);
    }
    ll ans = tmin + amin;
    cout << ans << endl;

    return 0;
}

Submission Info

Submission Time
Task C - AtCoDeerくんと選挙速報 / AtCoDeer and Election Report
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1762 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt, 0_002.txt
All 300 / 300 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 1 ms 256 KB
0_001.txt 1 ms 256 KB
0_002.txt 1 ms 256 KB
1_003.txt 1 ms 256 KB
1_004.txt 1 ms 256 KB
1_005.txt 1 ms 256 KB
1_006.txt 1 ms 256 KB
1_007.txt 1 ms 256 KB
1_008.txt 1 ms 256 KB
1_009.txt 1 ms 256 KB
1_010.txt 1 ms 256 KB
1_011.txt 1 ms 256 KB
1_012.txt 1 ms 256 KB
1_013.txt 2 ms 256 KB
1_014.txt 2 ms 256 KB