제출 #1088292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1088292		vahagng	Permutation Recovery (info1cup17_permutation)	C++17	10 / 100	4042 ms	348 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
    ll n;
    cin >> n;
    vector<ll>q(n);
    for(auto& i : q) cin >> i;
    vector<int>p(n+1, 0);
    for(int i = 1; i <= n; i++){
        p[i] = i;
    }
    do{
        vector<ll>dp(n+1, 0);
        dp[0] = 1;
        for(int i = 1; i <= n; i++){
            for(int j = 0; j < i; j++){
                if(p[i] > p[j]){
                    dp[i] += dp[j];
                }
            }
        }
        dp[0] = 0;
        for(int i = 1; i <= n; i++){
            dp[i] += dp[i-1];
        }
        bool ok = 1;
        for(int i = 1; i <= n; i++){
            ok &= (dp[i] == q[i-1]);
        }
        if(ok){
            for(int i = 1; i <= n; i++){
                cout << p[i] << ' ';
            }
            cout << endl;
            return 0;
        }
    } while(next_permutation(p.begin() + 1, p.end()));
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 7
• Subtask 7: 0 / 16
• Subtask 8: 0 / 6