Submission #1074361


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define int long long
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define FI first
#define SE second
typedef pair< int,pair<int,pair<int, int> > > P3;
typedef pair<int, pair<int, int> > P2;
typedef pair<int, int> P1;
typedef tuple<int,int,int,int> T3;
typedef tuple<int,int,int> T2;
typedef tuple<int,int> T1;
static const int INF = 1ll<<60;
static const int dx[] = { 1, -1, 0, 0, };
static const int dy[] = { 0, 0, 1, -1 };

int N;
int A[100005],B[100005];
int ans=0;

int func(int a,int b){
    if(a==0)return b;
    if(b==1)return a;
    return b+(a/b)*b;
}

signed main(){
    cin>>N;
    int t=0;
    for(int i=0;i<N;++i)cin>>A[i]>>B[i];
    for(int i=N-1;i>=0;--i){
        A[i]+=t;
        int cost=func(A[i],B[i])-A[i];
        //cout<<cost<<endl;
        ans+=cost;
        t+=cost;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Submission Time
Task A - Multiple Array
User koutarou
Language C++14 (GCC 5.4.1)
Score 0
Code Size 946 Byte
Status WA
Exec Time 147 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 7
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 AC 133 ms 1792 KB
02.txt AC 133 ms 1792 KB
03.txt AC 128 ms 1792 KB
04.txt AC 134 ms 1792 KB
05.txt AC 108 ms 1792 KB
06.txt AC 133 ms 1792 KB
07.txt AC 86 ms 1792 KB
08.txt AC 141 ms 1792 KB
09.txt WA 85 ms 1792 KB
10.txt AC 141 ms 1792 KB
11.txt WA 70 ms 1792 KB
12.txt WA 38 ms 1792 KB
13.txt WA 88 ms 1792 KB
14.txt WA 147 ms 1792 KB
15.txt WA 3 ms 256 KB
16.txt WA 2 ms 256 KB
s1.txt AC 2 ms 256 KB
s2.txt AC 3 ms 256 KB