Submission #2416873


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <tuple>
#include <iterator>

using ll = long long;
using namespace std;
#define modmod 1000000007

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,k,n) for(int i=k;i<n;i++)


int main(){
    int N;
    cin >> N;
    ll T[N]={0};
    ll A[N]={0};
    for(int i = 0; i < N; i++){
        cin >> T[i] >> A[i];
    }
    ll nt = T[0];
    ll na = A[0];
    if(N==1){
        cout << nt+na << endl;
        return 0;
    }

    for(int i = 1; i < N; i++){
        //printf("%lld,%lld\n",nt,na);
        if(T[i] > A[i]){
            if(A[i] >= na){
                nt = T[i];
                na = A[i];
                continue;
            }else{
                if(nt >= T[i] * ceil((double)na/A[i])){
                    nt = T[i] * ceil((double)nt/T[i]);
                    //printf("ceil : %d\n",(int)ceil((double)na/A[i]));
                    na = A[i] * ceil((double)nt/T[i]);
                    continue;
                }else{
                    nt = T[i] * ceil((double)na/A[i]);
                    //printf("ceil : %d\n",(int)ceil((double)na/A[i]));
                    na = A[i] * ceil((double)na/A[i]);
                    continue;
                }
            }
        }else if(T[i] == A[i]){
            if(nt >= na){
                na = nt;
                continue;
            }else{
                nt = na;
                continue;
            }
        }else{
            if(T[i] >= nt){
                nt = T[i];
                na = A[i];
                continue;
            }else{
                if(na >= A[i] * ceil((double)nt/T[i])){
                    nt = T[i] * ceil((double)na/A[i]);
                    //printf("ceil : %d\n",(int)ceil((double)na/A[i]));
                    na = A[i] * ceil((double)na/A[i]);
                    continue;
                }else{
                    nt = T[i] * ceil((double)nt/T[i]);
                    na = A[i] * ceil((double)nt/T[i]);
                    continue;
                }
            }
        }
    }

    cout << nt + na << endl;

    return 0;
}

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User solveric
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2248 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 × 10
WA × 5
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 1 ms 256 KB
1_005.txt WA 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 WA 1 ms 256 KB
1_013.txt WA 2 ms 256 KB
1_014.txt AC 2 ms 256 KB