# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653557 | erto | Art Collections (BOI22_art) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "art.h"
typedef long long int ll;
typedef long double ld;
#define INF (int)(1e9 + 7)
#define INF2 998244353
#define N (ll)(2e5 + 5)
//#define f first
//#define s second
//#define int ll
#define lsb(x) (x & (-x))
using namespace std;
void solve(int N){
vector<int> v;
for(int i=1; i<=N; i++)v.push_back(i);
v.resize(N);
do{
int t = publish(v);
if(t)break;
}
while(next_permutation(v.begin(), v.end()));
answer(v);
}