Submission #210961

#TimeUsernameProblemLanguageResultExecution timeMemory
210961ryanseeDEL13 (info1cup18_del13)C++14
6 / 100
33 ms768 KiB
#include "bits/stdc++.h" using namespace std; #define FAST ios_base::sync_with_stdio(false); cin.tie(0); #define pb push_back #define eb emplace_back #define ins insert #define ph push #define f first #define s second #define cbr cerr << "hi\n" #define mmst(x, v) memset((x), v, sizeof ((x))) #define siz(x) ll(x.size()) #define all(x) (x).begin(), (x).end() #define lbd(x, y) lower_bound(all(x), y) #define ubd(x, y) upper_bound(all(x), y) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng) inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); } typedef long long ll; typedef long double ld; #define FOR(i,s,e) for(ll i=s;i<=ll(e);++i) #define DEC(i,s,e) for(ll i=s;i>=ll(e);--i) typedef pair<ll,ll>pi; typedef pair<ll,pi>spi; typedef pair<pi,pi>dpi; #define LLINF ((long long)1e18) #define INF int(1e9+1e6) #define MAXN (300006) bool state[MAXN]; void solve(){ mmst(state,0); ll n,q;cin>>n>>q; FOR(i,0,q-1){ ll a; cin>>a; state[a]=1; } vector<ll> comp; vector<vector<bool>> dp(2,vector<bool>(n+4,0)); auto gogo=[&](){ if(comp.empty())return 1; FOR(i,0,siz(comp)-1){ FOR(j,0,comp[i]+2) dp[i&1][j]=0; if(i) for(ll j=0;j<=min(comp[i-1],comp[i]);++j) if(dp[(i-1)&1][j]) { dp[i&1][comp[i]-j]=1; } // if(comp[i]>2){ DEC(j,comp[i]-1,0){ dp[i&1][j]=dp[i&1][j]|dp[i&1][j+2]; } // } if(i==0){ dp[i&1][comp[i]]=1; DEC(j,comp[i]-1,1){ dp[i&1][j]=dp[i&1][j]|dp[i&1][j+2]; } } } if(dp[(siz(comp)-1)&1][0]) return 1; cout<<"-1\n"; return 0; }; FOR(i,1,n){ if(state[i]==0){ if(i>1&&state[i-1]==0) { ++ comp.back(); }else{ comp.pb(1); } }else{ if(i>1&&state[i-1]==1){ if(!gogo())return; comp.clear(); } } } if(!gogo())return; cout<<0<<'\n'<<'\n'; } int main(){ FAST ll t; cin>>t; while(t--)solve(); }
#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...