| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 721631 | OttincaM | 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 <iostream>
#include <chrono>
#include <random>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <fstream>
#include <numeric>
#include <sstream>
#include <functional>
#include <memory.h>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <string>
#include <queue>
#include <array>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <ctime>
#include <cmath>
#include <climits>
#include "stdio.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include "art.h"
using namespace std;
void solve(int N){
    int n = N;
    vector <int> fnd(1, 1);
    for(int i = 2; i <= n; i ++){
        vector <int> f, s = fnd;
        f.push_back(i);
        for(int &t: fnd) f.push_back(t);
        s.push_back(i);
        for(int j = i + 1; j <= n; j ++){
            f.push_back(j);
            s.push_back(j);
        }
        
        int x = publish(f);
        int y = publish(s);
        bool ch = 0;
        vector <int> nwf;
        for(int j = 1; j <= i - 1; j ++){
            int Y = j - 1, X = i - 1 - Y;
            if(X - Y == x - y){
                ch = 1;
                nwf.push_back(i);
            }
            nwf.push_back(fnd[j - 1]);
        }
        if(!ch) nwf.push_back(i);
        fnd = nwf;
    }
    for(int i: fnd) cout << i << " " << "\n";
}
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    return 0;   
}
