Submission #1146522

#	Time	Username	Problem	Language	Result	Execution time	Memory
1146522		aliarapov	Permutation Recovery (info1cup17_permutation)	C++20	0 / 100	1095 ms	324 KiB

Main

#include <bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std; 
using namespace __gnu_pbds;

#define int long long
#define all(x) x.begin(),x.end() 
#define rall(x) x.rbegin(),x.rend()
           
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; } 

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;     

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int &i : a) cin >> i;
    vector<int> b(n);
    iota(all(b), 1);
    do {
        vector<int> q(n);
        for (int i = 0; i < n; i++) {
            q[i] = 1;
            for (int j = 0; j < i; j++) {
                if (b[j] < b[i]) q[i] += q[j];
            }
        }
        for (int i = 1; i < n; i++) q[i] += q[i - 1];
        if (q == a) {
            for (int i : b) cout << i << ' ';
            return;
        }
    } while (next_permutation(all(b)));
    cout << -1;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    int t = 1;
 //   cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 100