Submission #528802

#TimeUsernameProblemLanguageResultExecution timeMemory
528802NhatMinh0208DEL13 (info1cup18_del13)C++14
40 / 100
11 ms2936 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; // #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) // #pragma comment(linker, "/stack:200000000") // #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. // template<typename T> // __attribute__((always_inline)) void chkmin(T& a, const T& b) { // a=(a<b)?a:b; // } // template<typename T> // __attribute__((always_inline)) void chkmax(T& a, const T& b) { // a=(a>b)?a:b; // } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif vector<string> vec; int n,m,i,j,k,t,t1,u,v,a,b; int dp[100011][3][2]; int arr[100011]; int main() { fio; cin>>t; for (t1=0;t1<t;t1++) { cin>>n>>m; for (i=1;i<=n;i++) { arr[i]=1; } arr[n+1]=arr[n+2]=arr[n+3]=-1; for (i=1;i<=m;i++) { cin>>u; arr[u]=0; } // for (i=1;i<=n;i++) cout<<arr[i]; cout<<endl; for (i=0;i<=n+3;i++) for (j=0;j<3;j++) for (k=0;k<2;k++) { dp[i][j][k]=0; } for (i=n;i>=0;i--) for (j=0;j<3;j++) for (k=0;k<2;k++) { dp[i][j][k]=0; if (i==n) { if ((j==0||j==2)&&(k==0)) dp[i][j][k]=1; } else { if (j==0) { if (arr[i+1]==0 && dp[i+1][0][k]) dp[i][j][k]=1; if (arr[i+1]==1 && dp[i+1][1][1]) dp[i][j][k]=5; if (arr[i+1]==1 && arr[i+2]==0 && arr[i+3]==1 && dp[i+3][2][0]) dp[i][j][k]=4; } if (j==1) { if (arr[i+1]==1 && dp[i+1][1][k^1]) dp[i][j][k]=2; if (arr[i+1]==1 && arr[i+2]==0 && arr[i+3]==1 && dp[i+3][2][k]) dp[i][j][k]=8; } if (j==2) { if (arr[i+1]==1 && dp[i+1][2][k^1]) dp[i][j][k]=3; if (arr[i+1]==1 && dp[i+1][1][1] && k==0) dp[i][j][k]=9; if (arr[i+1]==1 && arr[i+2]==0 && arr[i+3]==1 && dp[i+3][2][0] && k==0) dp[i][j][k]=6; if (arr[i+1]==0 && dp[i+1][0][0] && k==0) dp[i][j][k]=7; } } // cout<<i<<' '<<j<<' '<<k<<' '<<dp[i][j][k]<<endl; } if (dp[0][0][0]) cout<<0<<endl<<endl; else cout<<-1<<endl; } } // a;
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...