Submission #2740487


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

#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 == -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 K, vi& a) {
    ll lo = 2, hi = 2;
    for (int i=K-1; i>=0; --i) {
        ll mod = a[i];
        // [lo, hi]
        if (hi < mod) goto impossible;
        ll nlo = lo - (lo % mod);
        if (nlo < lo) nlo += mod;
        if (nlo > hi) goto impossible;

        ll nhi = hi - (hi % mod);
        if (nhi < lo) goto impossible;

        lo = nlo; hi = nhi + (mod-1);
    }
    cout << lo << " " << hi << endl;
    return;
impossible:
    cout << -1 << endl;
}

int main() {
    vi a;
    int K = loadvec(a);
    solve(K,a);
    return 0;
}

Submission Info

Submission Time
Task B - Ice Rink Game
User naoya_t
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2568 Byte
Status
Exec Time 8 ms
Memory 1664 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:74:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 500 / 500 sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
subtask_1_01.txt 1 ms 256 KB
subtask_1_02.txt 1 ms 256 KB
subtask_1_03.txt 1 ms 256 KB
subtask_1_04.txt 1 ms 256 KB
subtask_1_05.txt 1 ms 256 KB
subtask_1_06.txt 5 ms 768 KB
subtask_1_07.txt 6 ms 1664 KB
subtask_1_08.txt 1 ms 256 KB
subtask_1_09.txt 1 ms 256 KB
subtask_1_10.txt 2 ms 256 KB
subtask_1_11.txt 8 ms 1536 KB
subtask_1_12.txt 8 ms 1536 KB
subtask_1_13.txt 6 ms 1152 KB
subtask_1_14.txt 6 ms 1536 KB
subtask_1_15.txt 7 ms 1664 KB
subtask_1_16.txt 2 ms 384 KB
subtask_1_17.txt 7 ms 1280 KB
subtask_1_18.txt 7 ms 1280 KB
subtask_1_19.txt 6 ms 1152 KB
subtask_1_20.txt 5 ms 1280 KB
subtask_1_21.txt 5 ms 1280 KB
subtask_1_22.txt 5 ms 1280 KB
subtask_1_23.txt 1 ms 256 KB
subtask_1_24.txt 1 ms 256 KB
subtask_1_25.txt 8 ms 1664 KB
subtask_1_26.txt 1 ms 256 KB
subtask_1_27.txt 8 ms 1664 KB