제출 #781328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781328		gg123_pe	Cheerleaders (info1cup20_cheerleaders)	C++14	26 / 100	2072 ms	33544 KiB

cheerleaders

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

#define f(i,a,b) for(int i = a; i < b; i++)
const int inf = 2e9; 

int n; 
int ans = inf; 
vector <int> res; 
map <vector <int>, bool> on; 

void go(vector <int> v, vector <int> &curr){
    int inver = 0; 
    f(i,0,n) f(j,i+1,n) if(v[i] > v[j]) inver++; 
    on[v] = 1; 

    if(inver < ans){
        ans = inver;  
        res = curr; 
    } 
    f(i,1,3){
        curr.push_back(i); 
        vector <int> aux; 

        if(i == 1){
            f(j,n/2,n) aux.push_back(v[j]); 
            f(j,0,n/2) aux.push_back(v[j]); 
        }
        else{
            f(j,0,n) if(j%2 == 0) aux.push_back(v[j]); 
            f(j,0,n) if(j%2 != 0) aux.push_back(v[j]); 
        }
        if(!on[aux]) go(aux, curr); 
        curr.pop_back(); 
    }
}
int main(){
    vector <int> v, curr; 
    cin >> n; 
    n = (1<<n); 

    f(i,0,n){
        int x; 
        cin >> x; 
        v.push_back(x); 
    }
    
    go(v, curr); 

    cout << ans << "\n"; 
    for(int x: res) cout << x; 
    if(res.size()) cout << "\n"; 

    return 0; 
}

• Subtask 1: 16 / 16
• Subtask 2: 10 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28