제출 #1171034

#제출 시각아이디문제언어결과실행 시간메모리
1171034sasdeArt Collections (BOI22_art)C++20
0 / 100
0 ms428 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; const int N=1e6+5,lg=20,mod=1e9+7; mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); int Rand(int u,int v){ return u+rd()%(v-u+1); } int n,v=0; bool k[N]; vector<int>res; void cc(int i){ if(i>n){ int u=publish(res); if(u==v){ answer(res);exit(0); } v=u; return; } for(int j=1;j<=n;++j){ if(!k[j]){ res.emb(j);k[j]=true; cc(i+1);k[j]=false; res.pop_back(); } } } void solve(int N){ n=N; cc(1); }
#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...