제출 #1121818

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121818		vjudge1	Calvinball championship (CEOI15_teams)	C++14	10 / 100	1072 ms	1608 KiB

teams

//#pragma GCC optimize ("O1")
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define pb push_back
#define F first
#define S second
#define ll long long
#define int ll
#define pii pair<int, int>
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define M_PI 3.14159265358979323846
#define all(v) v.begin(), v.end()
#define pss pair<string, string>
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define imp cout<<-1<<endl;
#define flu cout.flush();
#define Endl endl

const int N = 300009;
const int mod = 1e6+7;

vector<vector<int>>v;

vector<int>ans;

void f(int n, int q){
    if(q==n+1){
        int yx=0;
        for(int i=1; i<n; i++){
            if(ans[i]>ans[i-1]+1){
                yx++;
                break;
            }
        }
        if(yx==0){
            v.pb(ans);
        }
        return;
    }
    for(int i=1; i<=q; i++){
        ans.pb(i);
        f(n, q+1);
        ans.pop_back();
    }
}

void solve(){
    int n;
    cin>>n;
    vector<int>a;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        a.pb(x);
    }
    f(n, 1);
    int sz=v.size();
    for(int i=0; i<sz; i++){
        if(a==v[i]){
            cout<<i+1;
            return;
        }
    }
}

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

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10