Submission #1974104


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
	ll k;
	ll a[100010];
	cin >> k;
	rep(i,k){
		scanf("%lld",&a[i]);
	}
	
	if(a[k-1] != 2){
		puts("-1");
		return 0;
	}
	ll ret_min = 2, ret_max = 3;
	rrep(i,k-1){
		ret_min += a[i]-1;
		ret_min -= ret_min%a[i];
		ret_max -= ret_max%a[i];
		ret_max += a[i]-1;
		if(ret_min > ret_max){
			puts("-1");
			return 0;
		}
	}
	
	cout << ret_min << " " << ret_max << endl;
}

Submission Info

Submission Time
Task B - Ice Rink Game
User yokozuna57
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1414 Byte
Status
Exec Time 15 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

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 11 ms 1024 KB
subtask_1_07.txt 13 ms 1024 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 15 ms 1024 KB
subtask_1_12.txt 15 ms 1024 KB
subtask_1_13.txt 12 ms 1024 KB
subtask_1_14.txt 13 ms 1024 KB
subtask_1_15.txt 14 ms 1024 KB
subtask_1_16.txt 2 ms 384 KB
subtask_1_17.txt 13 ms 1024 KB
subtask_1_18.txt 13 ms 1024 KB
subtask_1_19.txt 12 ms 896 KB
subtask_1_20.txt 11 ms 1024 KB
subtask_1_21.txt 11 ms 1024 KB
subtask_1_22.txt 11 ms 1024 KB
subtask_1_23.txt 1 ms 256 KB
subtask_1_24.txt 1 ms 256 KB
subtask_1_25.txt 15 ms 1024 KB
subtask_1_26.txt 1 ms 256 KB
subtask_1_27.txt 15 ms 1024 KB