codeforce错题————————————————————ok

题目如下 

 

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 4000100;
const int N = 1000000;

int n, a[maxn], pr[maxn], tot, stk[maxn], top;
bool vis[maxn];

//初始化素数筛
inline void init() {
	for (int i = 2; i <= N; ++i) {
		if (!vis[i]) {//开始都是false
			pr[++tot] = i;
		}
		// 欧拉筛
		for (int j = 1; j <= tot && i * pr[j] <= N; ++j) {
			vis[i * pr[j]] = 1;
			if (i % pr[j] == 0) {
				break;
			}
		}
	}
	mems(vis, 0);
	/*马上还要用vis数组的*/
}

inline bool check(int x) {
	if (x & 1) {//奇数
		return x + 1 + x * (x - 1) / 2 >= n;
	} else {//偶数
		return x * (x - 1) / 2 - x / 2 + 2 + x >= n;
	}
}

vector<pii> G[10000];

void dfs(int u) {//遍历图
	while (G[u].size()) {
		pii p = G[u].back();
		G[u].pop_back();
		if (vis[p.scd]) {
			continue;
		}
		vis[p.scd] = 1;
		dfs(p.fst);
	}
	stk[++top] = pr[u];
}

void solve() {
	scanf("%d", &n);//输入
	int l = 1, r = 10000, ans = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		// 寻找最小的m
		if (check(mid)) {//大或者正好
			ans = mid;
			r = mid - 1;
		} else {
			l = mid + 1;
		}
	}
	for (int i = 1; i <= ans; ++i) {
		vector<pii>().swap(G[i]);
	}
	int tot = 0;
	for (int i = 1; i <= ans; ++i) {
		for (int j = i; j <= ans; ++j) {
			if (ans % 2 == 0 && i % 2 == 0 && i + 1 == j) {
				continue;
			}
			G[i].pb(j, ++tot);
			G[j].pb(i, tot);
		}
	}
	for (int i = 1; i <= tot; ++i) {
		vis[i] = 0;
	}
	top = 0;
	dfs(1);
	reverse(stk + 1, stk + top + 1);
	for (int i = 1; i <= n; ++i) {
		printf("%d%c", stk[i], " \n"[i == n]);
	}
}

int main() {
	init();
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}

这是官方题解，下面是我的题解

 

#include<bits/stdc++.h>
using namespace std;

#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n'
#define pb emplace_back
#define pop pop_back
#define fst first
#define sec second
#define pii pair<int,int>
#define mem(a,x) memset(a,x,sizeof(a))

typedef  long long  ll;
typedef unsigned long long ull;
typedef double db;

int tot = 0;
int n;
const int maxn = 4e6 + 10, N = 1e6 + 10;
vector<pii> G[maxn];
bool vis[maxn];
vector<int> pr(N);
int top = 0;
int stk[maxn];

void solve();
void init();
bool check(int x);
void dfs(int x);


int main()
{
	//IOS;
	init();
	int T;
	cin >> T;
	while(  T--  )
	{
		solve();
	}
	return 0;
}



void solve()//总函数
{
	cin >> n;
	int l = 1, r = 10000, ans = -1;
	while ( l <= r){
		int mid = (l + r) >> 1;
		if(check(mid)){
			ans = mid;
			r = mid - 1;
		} else {
			l = mid + 1;
		}
	}
	
	for( int i = 1; i <= ans; ++ i) {
		vector<pii>().swap(G[i]);
	}
	
	tot = 0;
	for (int i = 1; i <= ans; ++ i) {
		// 奶奶的 这里抄错了，de了半天，啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊
		// 妈妈，救救孩子吧
		for ( int j = i; j <= ans; ++ j) {
			if ( ans % 2 == 0 && i % 2 == 0 && i + 1 == j) {
				continue;
			}
			G[i].pb(j, ++tot);
			G[j].pb(i, tot);
		}
	}
	
	for( int i = 1; i <= tot; ++ i) {
		vis[i] = false;
	}
	top = 0;
	dfs(1);
	reverse(stk+1 , stk + top + 1 );
	for ( int i = 1; i <= n; ++ i) {
		printf("%d%c",stk[i]," \n"[i==n]);
	}
}

void init()
{
	for( int i = 2; i <= N; ++ i){
		if(!vis[i]){
			pr[++tot] = i;
		}
		for (int j = 1; j <= tot && i * pr[j] <= N; ++ j){//mmp 这里写成 j * pr[j] <= N
			// 我真的服了我这个傻鸟错误
			vis[i * pr[j]] = true;
			if( i % pr[j] == 0) break;
		}
	}
	mem(vis,false);
	//memset(vis,false,sizeof(vis));
}
//************************************************************************/
// 不理解这里为什么不是二者减一之后的结果
bool check(int x)
{
	if( x & 1){
		//度数为偶数
		return x*(x-1)/2 + x + 1 >= n;
	} else {
		return x*(x-1)/2 - x/2 + 2 + x >= n;
	}
}

void dfs(int x){
	while( G[x].size() ){
		pii p = G[x].back();
		G[x].pop_back();
		if( vis[p.sec]){
			continue;
		}
		vis[p.sec] = 1;
		dfs(p.fst);
	}
	stk[++top] = pr[x];
}