# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1023270 | 2024-07-14T14:37:09 Z | MrAndria | DEL13 (info1cup18_del13) | C++14 | 12 ms | 1692 KB |
#include <bits/stdc++.h> using namespace std; #define ff first; #define ss second #define pb push_back //#define int long long int t,n,q,b1,l; int a[200005]; vector <int> v,v2,v3,v1; int main(){ cin>>t; while(t--){ cin>>n>>q; for(int i=1;i<=q;i++){ cin>>a[i]; } v2.clear(); v1.clear(); v3.clear(); v.clear(); a[q+1]=n+1; b1=0; for(int i=1;i<=q+1;i++){ v.pb(a[i]-a[i-1]-1); // cout<<a[i]-a[i-1]-1<<" "; } // cout<<endl; l=0; v2.pb(l); for(int i=0;i<v.size();i++){ v[i]-=l; if(v[i]<0){ b1=1; break; } if(v[i]==0){ l=0; v1.pb(v[i]); }else{ if(v[i]%2==1){ l=1; v1.pb(v[i]-1); }else{ if(l==2 or l==1){ l=0; v1.pb(v[i]); }else{ l=2; v1.pb(v[i]-2); } } } v2.pb(l); } if(l!=0 or b1){ cout<<-1<<endl; continue; } if(v.size()!=q+1)assert(0); for(int i=0;i<v2.size();i++){ for(int j=0;j<(v1[i])/2;j++){ v3.pb((a[i]+a[i+1])/2); } if(i!=v2.size()-1){ for(int j=0;j<(v2[i+1]);j++){ v3.pb(a[i+1]); } } } cout<<v3.size()<<endl; for(int i=0;i<v3.size();i++){ cout<<v3[i]<<" "; } cout<<endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output isn't correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output isn't correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Incorrect | 8 ms | 348 KB | Output isn't correct |
4 | Incorrect | 9 ms | 348 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 600 KB | Integer 22 violates the range [1, 13] |
2 | Incorrect | 2 ms | 460 KB | Integer 6 violates the range [1, 5] |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output isn't correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Incorrect | 8 ms | 348 KB | Output isn't correct |
4 | Incorrect | 9 ms | 348 KB | Output isn't correct |
5 | Incorrect | 1 ms | 348 KB | Output isn't correct |
6 | Incorrect | 1 ms | 456 KB | Output isn't correct |
7 | Incorrect | 1 ms | 344 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output isn't correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Incorrect | 8 ms | 348 KB | Output isn't correct |
4 | Incorrect | 9 ms | 348 KB | Output isn't correct |
5 | Incorrect | 1 ms | 348 KB | Output isn't correct |
6 | Incorrect | 1 ms | 456 KB | Output isn't correct |
7 | Incorrect | 1 ms | 344 KB | Output isn't correct |
8 | Incorrect | 8 ms | 708 KB | Output isn't correct |
9 | Incorrect | 10 ms | 1116 KB | Output isn't correct |
10 | Incorrect | 8 ms | 972 KB | Output isn't correct |
11 | Incorrect | 12 ms | 1692 KB | Output isn't correct |