Submission #3811025
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; const ull mod = 1e9 + 7; #define REP(i,n) for(int i=0;i<(int)n;++i) //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; template < typename T > void vprint(T &v){ REP(i, v.size()){ cout << v[i] << " "; } cout << endl; } int main(){ ll K; cin >> K; vector<ll> A(K); REP(i, K) cin >> A[i]; ll ma = 2; ll mi = 2; REP(i, K){ ll D = A[K-1-i]; ll maD = (ma/D)*D; ll miD = (mi%D==0?mi:((mi/D)+1)*D); if(miD>maD){ cout << -1 << endl; return 0; } ma = maD + D - 1; mi = miD; } cout << mi << " " << ma << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Ice Rink Game |
User | theory_and_me |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 896 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 18 ms | 1024 KB |
subtask_1_07.txt | AC | 44 ms | 1024 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 4 ms | 256 KB |
subtask_1_11.txt | AC | 43 ms | 1024 KB |
subtask_1_12.txt | AC | 43 ms | 1024 KB |
subtask_1_13.txt | AC | 31 ms | 1024 KB |
subtask_1_14.txt | AC | 41 ms | 1024 KB |
subtask_1_15.txt | AC | 42 ms | 1024 KB |
subtask_1_16.txt | AC | 5 ms | 384 KB |
subtask_1_17.txt | AC | 31 ms | 1024 KB |
subtask_1_18.txt | AC | 31 ms | 1024 KB |
subtask_1_19.txt | AC | 28 ms | 896 KB |
subtask_1_20.txt | AC | 29 ms | 1024 KB |
subtask_1_21.txt | AC | 29 ms | 1024 KB |
subtask_1_22.txt | AC | 29 ms | 1024 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 2 ms | 256 KB |
subtask_1_25.txt | AC | 42 ms | 1024 KB |
subtask_1_26.txt | AC | 2 ms | 256 KB |
subtask_1_27.txt | AC | 42 ms | 1024 KB |