# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1116466 | Nipphitch | Pancake (NOI12_pancake) | C++14 | 467 ms | 27212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |