Submission #1445290
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define MOD 1e9 + 7 int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n,k,mx = 0; bool pos = false; cin >> n >> k; vector<int> a(n); map<int,bool> m; for(int i = 0;i < n;i++){ cin >> a[i]; mx = max(mx,a[i]); if(a[i]==k) pos = true; m[a[i]] = true; } if(pos){ cout << "POSSIBLE"; return 0; } if(mx<k){ cout << "IMPOSSIBLE"; return 0; } for(int i = 0;i < n-1;i++) { int d = abs(a[i]-a[i+1]); if(!m[d]){ cout << "POSSIBLE"; return 0; } } cout << "IMPOSSIBLE"; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | Autoratch |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 638 Byte |
Status | WA |
Exec Time | 46 ms |
Memory | 5376 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 | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.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 | 46 ms | 5376 KB |
subtask_1_04.txt | AC | 11 ms | 640 KB |
subtask_1_05.txt | AC | 7 ms | 512 KB |
subtask_1_06.txt | AC | 6 ms | 1024 KB |
subtask_1_07.txt | WA | 25 ms | 3200 KB |
subtask_1_08.txt | AC | 31 ms | 2432 KB |
subtask_1_09.txt | AC | 16 ms | 2048 KB |
subtask_1_10.txt | WA | 27 ms | 3072 KB |
subtask_1_11.txt | AC | 30 ms | 2944 KB |