oj.uz

답안 #528817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528817 2022-02-21T13:54:52 Z NhatMinh0208 DEL13 (info1cup18_del13) C++14
100 / 100
 18 ms 6032 KB 
#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];
vector<int> res;
vector<int> endp;
void solve(int l, int m, int r) {
	
	if (m==l+1) {
		for (int i=r-1;i>=l+1;i-=2) {
			// cout<<"solve "<<l<<' '<<m<<' '<<r<<endl;
			// cout<<"push1 "<<i<<endl; 
			res.push_back(i);
		}
	}
	else if (m==r-1)
	{
		for (int i=l+1;i<=r-1;i+=2) {
			// cout<<"solve "<<l<<' '<<m<<' '<<r<<endl;
			// cout<<"push3 "<<i<<endl; 
			res.push_back(i);
		}
	}
	else {
		solve(l+1,m,r-1);
		// cout<<"solve "<<l<<' '<<m<<' '<<r<<endl;
		// cout<<"push2 "<<m<<endl; 
		res.push_back(m);
	}
}
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<<-1<<endl;
		else {
			res.clear();
			endp.clear();
			j=0;
			k=0;
			for (i=0;i<n;i++) {
				u=dp[i][j][k];
				switch (u) {
					case 1:
					break;
					case 2:
						k^=1;
					break;
					case 3:
						k^=1;
					break;
					case 4:
						endp.push_back(i+1);
						endp.push_back(i+2);
						j=2;
						k=0;
						i+=2;
					break;
					case 5:
						endp.push_back(i+1);
						j=1;
						k=1;
					break;
					case 6:
						endp.push_back(i);
						endp.push_back(i+1);
						endp.push_back(i+2);
						j=2;
						k=0;
						i+=2;
					break;
					case 7:
						endp.push_back(i);
						j=0;
						k=0;
					break;
					case 8:
						endp.push_back(i+2);
						j=2;
						i+=2;
					break;
					case 9:
						endp.push_back(i);
						endp.push_back(i+1);
						j=1;
						k=1;
					break;
					default:
						assert(0);
					break;
				}
			}
			if (j==2) endp.push_back(n);
			for (i=0;i<endp.size();i+=3) solve(endp[i],endp[i+1],endp[i+2]);
			// for (auto g : endp) cout<<g<<' '; cout<<endl;
			cout<<res.size()<<endl;
			for (auto g : res) cout<<g<<' ';
			cout<<endl;
		}
	}
}
// a;

Compilation message

del13.cpp: In function 'int main()':
del13.cpp:240:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |    for (i=0;i<endp.size();i+=3) solve(endp[i],endp[i+1],endp[i+2]);
      |             ~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 712 KB Output is correct
2 Correct 7 ms 2508 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 12 ms 3252 KB Output is correct
9 Correct 12 ms 3268 KB Output is correct
10 Correct 12 ms 3408 KB Output is correct
11 Correct 18 ms 6032 KB Output is correct