oj.uz

Submission #1116466

# Submission time Handle Problem Language Result Execution time Memory
1116466 2024-11-21T16:53:23 Z Nipphitch Pancake (NOI12_pancake) C++14
25 / 25
 467 ms 27212 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
const int N=1e5+5;
const int INF=1e9+7;

int n;
vector <int> a,b;
map <vector <int>,int> dp[10];

int rec(int d,vector <int> v){
    if(v==b) return d;
    if(d>n) return INF;
    if(dp[d].find(v)!=dp[d].end()) return dp[d][v];
    int res=INF;
    for(int i=0;i<n-1;i++){
        reverse(v.begin()+i,v.end());
        res=min(res,rec(d+1,v));
        reverse(v.begin()+i,v.end());
    }
    return dp[d][v]=res;
}

void slove(){
    a.clear();
    b.clear();
    //for(int i=0;i<10;i++) dp[i].clear();
    cin >> n;
    for(int i=1;i<=n;i++){
        int x;
        cin >> x;
        a.push_back(x);
        b.push_back(x);
    }
    sort(b.begin(),b.end(),greater <int>());
    cout << rec(0,a) << "\n";
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tc;
    cin >> tc;
    while(tc--) slove();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 13384 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 15440 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 27212 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 13640 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 19272 KB Output is correct