Submission #2660788

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 solve(int N, vi& a,vi& b) {
    // 0-1e9, 1-1e9
    ll ofs = 0;
    for(int i=N-1; i>=0; --i) {
        ll ai = a[i] + ofs;
        ll r = ai % b[i];
        if (r == 0) continue;
        ll push = b[i] - r;
        ofs += push;
    }
    return ofs;
}

int main() {
    int N;cin>>N; //1-1e5
    vi a(N),b(N);
    rep(i,N) cin>>a[i]>>b[i];
    cout << solve(N,a,b) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Multiple Array
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1542 Byte
Status
Exec Time 87 ms
Memory 1024 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 300 / 300 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 80 ms 1024 KB
02.txt 81 ms 1024 KB
03.txt 80 ms 1024 KB
04.txt 80 ms 1024 KB
05.txt 80 ms 1024 KB
06.txt 81 ms 1024 KB
07.txt 57 ms 1024 KB
08.txt 84 ms 1024 KB
09.txt 58 ms 1024 KB
10.txt 84 ms 1024 KB
11.txt 57 ms 1024 KB
12.txt 34 ms 1024 KB
13.txt 60 ms 1024 KB
14.txt 87 ms 1024 KB
15.txt 1 ms 256 KB
16.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB