Submission #1445300
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <cstdio> #include <vector> #include <queue> #include <set> #include <numeric> #include <cmath> using namespace std; typedef long long int lld; const lld mod = 1e9+7; const lld INF = 1e9; const lld MAXN = 1e5; int main() { lld n,a[MAXN] = {0},k; cin >> n >> k; for(int i = 0; i < n; i++) { cin >> a[i]; } lld min = INF; lld max = 0; for(int i = 0; i < n; i++) { if (min > a[i]) { min = a[i]; } if (max < a[i]) { max = a[i]; } } if (min == max && k == min) { cout << "POSSIBLE" << endl; return 0; } for(int i = 0; i < n; i++) { a[i] %= min; } lld sum = accumulate(a,a+n,0); if (sum == 0) { cout << "IMPOSSIBLE" << endl; }else { if (k <= max) { cout << "POSSIBLE" << endl; }else { cout << "IMPOSSIBLE" << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | ykmaku |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 941 Byte |
Status | WA |
Exec Time | 41 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 1024 KB |
sample_02.txt | AC | 1 ms | 1024 KB |
sample_03.txt | AC | 1 ms | 1024 KB |
sample_04.txt | AC | 1 ms | 1024 KB |
subtask_1_01.txt | AC | 1 ms | 1024 KB |
subtask_1_02.txt | AC | 1 ms | 1024 KB |
subtask_1_03.txt | AC | 41 ms | 1024 KB |
subtask_1_04.txt | AC | 40 ms | 1024 KB |
subtask_1_05.txt | AC | 22 ms | 1024 KB |
subtask_1_06.txt | AC | 7 ms | 1024 KB |
subtask_1_07.txt | WA | 25 ms | 1024 KB |
subtask_1_08.txt | AC | 36 ms | 1024 KB |
subtask_1_09.txt | AC | 17 ms | 1024 KB |
subtask_1_10.txt | WA | 30 ms | 1024 KB |
subtask_1_11.txt | AC | 33 ms | 1024 KB |