Submission #781328

# Submission time Handle Problem Language Result Execution time Memory
781328 2023-07-13T03:28:41 Z gg123_pe Cheerleaders (info1cup20_cheerleaders) C++14
26 / 100
2000 ms 33544 KB
#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; 
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct!
2 Correct 1 ms 212 KB Correct!
3 Correct 1 ms 212 KB Correct!
4 Correct 1 ms 212 KB Correct!
# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Correct!
2 Correct 15 ms 1700 KB Correct!
3 Correct 22 ms 1620 KB Correct!
4 Correct 22 ms 1604 KB Correct!
# Verdict Execution time Memory Grader output
1 Execution timed out 2072 ms 33544 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 3248 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 2116 KB Time limit exceeded
2 Halted 0 ms 0 KB -