제출 #389562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
389562		wiwiho	Permutation Recovery (info1cup17_permutation)	C++14	10 / 100	4059 ms	208 KiB

Main

#include <bits/stdc++.h>

#define mp make_pair
#define F first
#define S second
#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;

using pii = pair<int, int>;

const ll MOD = 1000000007;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<ll> q(n);
    for(int i = 0; i < n; i++){
        cin >> q[i];
    }

    vector<int> p(n);
    for(int i = 0; i < n; i++) p[i] = i + 1;

    do{
        vector<int> dp(n + 1);
        ll ans = 0;
        bool ok = true;
        for(int i = 0; i < n; i++){
            dp[p[i]] = 1;
            for(int j = 1; j < p[i]; j++){
                dp[p[i]] += dp[j];
            }
            ans += dp[p[i]];
            if(ans != q[i]) ok = false;
        }
        if(ok) break;
    }
    while(next_permutation(p.begin(), p.end()));
    
    printv(p, cout);
    
    return 0;
}

• 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