Submission #3808954
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <map> #include <set> #include <string> #include <cmath> #include <iomanip> #include <queue> #include <unordered_map> #include <unordered_set> #include <bitset> #include <cassert> #include <cstring> #include <climits> using namespace std; #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define REP(i, n) FOR(i, 0, n) #define SORT(c) sort((c).begin(), (c).end()) typedef long long ll; typedef pair<int, int> P; typedef vector<int> V; typedef map<int, int> M; constexpr ll INF = 1e18; constexpr ll MOD = 1e9 + 7; constexpr double PI = 3.14159265358979323846; constexpr int dx[] = {0, 0, 1, -1}; constexpr int dy[] = {1, -1, 0, 0}; int main() { ios::sync_with_stdio(false); cin.tie(0); int k; ll a[112345]; cin >> k; a[0] = 1; REP(i, k) cin >> a[i + 1]; if (a[k] != 2) { cout << -1 << endl; return 0; } ll l = 2, r = 2; for (int i = k; i > 0; i--) { if (l % a[i] && r % a[i] && (l / a[i] - r / a[i]) == 0) { cout << -1 << endl; return 0; } l = ((l / a[i - 1]) * a[i - 1] + (l % a[i - 1] > 0) * a[i - 1]); r = (((r + a[i] - 1) / a[i - 1]) * a[i - 1]); if (l > r) { cout << -1 << endl; return 0; } } cout << l << " " << r << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Ice Rink Game |
User | Kats |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1495 Byte |
Status | AC |
Exec Time | 14 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 | 10 ms | 1024 KB |
subtask_1_07.txt | AC | 12 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 | 2 ms | 256 KB |
subtask_1_11.txt | AC | 14 ms | 1024 KB |
subtask_1_12.txt | AC | 14 ms | 1024 KB |
subtask_1_13.txt | AC | 12 ms | 1024 KB |
subtask_1_14.txt | AC | 12 ms | 1024 KB |
subtask_1_15.txt | AC | 14 ms | 1024 KB |
subtask_1_16.txt | AC | 3 ms | 384 KB |
subtask_1_17.txt | AC | 13 ms | 1024 KB |
subtask_1_18.txt | AC | 13 ms | 1024 KB |
subtask_1_19.txt | AC | 12 ms | 896 KB |
subtask_1_20.txt | AC | 10 ms | 1024 KB |
subtask_1_21.txt | AC | 10 ms | 1024 KB |
subtask_1_22.txt | AC | 10 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 | 14 ms | 1024 KB |
subtask_1_26.txt | AC | 2 ms | 256 KB |
subtask_1_27.txt | AC | 14 ms | 1024 KB |