Submission #3691032

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 long double Double;
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;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#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))
#define cons make_pair


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

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void solve(int N,int M,vi& A,vi& B,vi& T) {
    vector<ii> ab(N);
    rep(i,N){
        ab[i] = ii(A[i], B[i]);
    }
    sort(ALL(ab));
    ab.pb(ii(INT_MAX, INT_MAX));

    rep(i,M){
        ll cheapest = LLONG_MAX;

        auto it = lower_bound(ALL(ab), ii(T[i], INT_MAX));
        if (it == ab.begin()) {
            cheapest = (ll)ab[0].second;
        } else if (it == ab.end()) {
            ii last = ab.back();
            cheapest = (ll)last.second + (T[i] - last.first);
        } else {
            int ix = (int)(it - ab.begin());
            assert(IN(ix, 1, ab.size()-1));
            cheapest = min(
                (ll)ab[ix-1].second + (T[i] - ab[ix-1].first),
                (ll)ab[ix].second
            );
        }
        printf("%lld\n", cheapest);
    }
}

int main() {
    int N; scanf("%d", &N);
    vi A(N), B(N);
    rep(i,N){
        scanf("%d%d", &A[i], &B[i]);
    }
    int M; scanf("%d", &M);
    vi T(M);
    rep(i,M){
        scanf("%d", &T[i]);
    }
    solve(N,M,A,B,T);
    return 0;
}

Submission Info

Submission Time
Task C - Telephone Charge
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 3615 Byte
Status
Exec Time 59 ms
Memory 3184 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:91:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:124:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N; scanf("%d", &N);
                           ^
./Main.cpp:127:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]);
                                    ^
./Main.cpp:129:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int M; scanf("%d", &M);
                           ^
./Main.cpp:132:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribut...

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt 59 ms 3184 KB
02.txt 59 ms 3184 KB
03.txt 46 ms 2420 KB
04.txt 37 ms 2432 KB
05.txt 57 ms 3092 KB
06.txt 52 ms 2760 KB
07.txt 59 ms 3184 KB
08.txt 15 ms 896 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB