# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710176 | nicky4321 | 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>
#define ll long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ALL(x) x.begin(), x.end()
#define vi vector<int>
#define vl vector<ll>
#define SZ(x) (int)x.size()
#define CASE int t;cin>>t;for(int ca=1;ca<=t;ca++)
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int MAX = 1 << 20, MOD = 1e9 + 7;
void solve(int n){
int lt = 0;
vi v;
for(int i = 1;i <= n;i++){
v.PB(i);
}
do{
int tmp = publish(v);
if(tmp == lt){
answer(v);
return;
}
lt = tmp;
}while(next_permutation(ALL(v)));
}
// int main(){
// IOS
// // CASE
// int n;
// cin >> n;
// solve(n);
// return 0;
// }