Submission #1445299
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int maxn = 1e5+10; int a[maxn]; int g[maxn]; int main() { int n,k; cin>>n>>k; int flag = 0; for(int i=0;i<n;i++) { cin>>a[i]; if(a[i]==k) { flag = 1; } } if(flag) { puts("POSSIBLE"); } else { long long sum = 0; for(int i=1;i<n;i++) { g[i]=abs(a[i]-a[i-1]); sum+=g[i]; } if(sum==k) puts("POSSIBLE"); else puts("IMPOSSIBLE"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | laomi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 638 Byte |
Status | WA |
Exec Time | 54 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 | 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 | WA | 54 ms | 1024 KB |
subtask_1_04.txt | AC | 53 ms | 640 KB |
subtask_1_05.txt | AC | 30 ms | 640 KB |
subtask_1_06.txt | WA | 9 ms | 384 KB |
subtask_1_07.txt | AC | 33 ms | 768 KB |
subtask_1_08.txt | AC | 46 ms | 896 KB |
subtask_1_09.txt | WA | 23 ms | 512 KB |
subtask_1_10.txt | AC | 39 ms | 768 KB |
subtask_1_11.txt | AC | 43 ms | 896 KB |