Submission #1172226

#TimeUsernameProblemLanguageResultExecution timeMemory
1172226sasdeArt Collections (BOI22_art)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h>
#include "art.h"
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
vector<int>ans,res;
int n,tong;
bool k[10];
void cc(int i){
	if(i>n){
		int u=publish(res);
		if(u==tong){
			ans=res;
		}
		tong=u;
		return;
	}
	for(int j=1;j<=n;++j){
		if(!k[j]){

			k[j]=true;
			res.emb(j);
			cc(i+1);
			res.pop_back();
			k[j]=false;
		}
	}
}
void solve(int N){
n=N;
	cc(1);
	answer(ans);
    
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...