Submission #1351912

#TimeUsernameProblemLanguageResultExecution timeMemory
1351912khomeArt Collections (BOI22_art)C++20
70 / 100
490 ms520 KiB
#include <bits/stdc++.h>
#include "art.h"
// #define int long long
#define endl '\n'
using namespace std;

void solve(int n){
    vector<int> order(n);
    vector<int> ans(n);
    for (int i = 1; i <= n; i++) {
        vector<int> cur = {i};
        vector<int> cur2;
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            cur.push_back(j);
            cur2.push_back(j);
        }
        cur2.push_back(i);
        int xy = publish(cur2);
        int xz = publish(cur);
        int x = (xy+xz-n+1)/2;
        int z = xz-x;
        ans[z] = i;
    }
    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...