제출 #518519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
518519		sudheerays123	팬케이크 정렬 (NOI12_pancake)	C++98	8 / 25	1088 ms	7712 KiB

pancake

#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define tc ll test;cin >> test;while(test--)
#define vi vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
#define ff first
#define ss second
#define in >>
#define out <<
#define space << " " <<
#define spacef << " "
#define fo(i,a,b) for(ll i = a; i <= b; i++)
#define rfo(i,a,b) for(ll i = a; i >= b; i--)
#define nextline out "\n"
#define print(x) for(auto i : x ) cout out i spacef
#define mmax(x,i) x = max(x,i)
#define mmin(x,i) x = min(x,i)
#define N 105

int main() {
    
    fast;

	tc{
		ll n;
		cin in n;

		vi a;
		fo(i,1,n){
			ll x;
			cin in x;

			a.pb(x);
		}
		reverse(a.begin(),a.end());

		map<vi,ll> dist;
		queue<vi> q;

		q.push(a);
		dist[a] = 0;

		while(!q.empty()){
			vi s = q.front();
			q.pop();

			fo(i,1,n){
				vi s1 = s;
				reverse(s1.begin(),s1.begin()+i);

				if(dist.find(s1) != dist.end()){
					if(dist[s1] > dist[s]+1){
						dist[s1] = dist[s]+1;
						q.push(s1);
					}
				}
				else{
					dist[s1] = dist[s]+1;
					q.push(s1);
				}
			}
		}

		vi order;
		fo(i,1,n) order.pb(i);

		cout out dist[order] nextline;
	}

    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 8
• Subtask 5: 0 / 5