이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
vector<int> v;
vector<int> link;
void swap_pos(int lh, int rh){
int vlh = v[lh];
int vrh = v[rh];
link[vlh] = rh;
link[vrh] = lh;
swap(v[lh], v[rh]);
}
int move(int id, int pos){
//cout<<"move "<<id<<" "<<pos<<endl;
int cpos= link[id];
int res = 0;
if(cpos!=pos){
for(; cpos<pos; cpos++){
swap_pos(cpos,cpos+1);
res++;
}
for(; pos<cpos; cpos--){
swap_pos(cpos, cpos-1);
res++;
}
}
return res;
}
int dp(int val, int end){
//cout<<val<<" "<<end<<endl;
for(auto e: v){
//cout<<e<<" ";
}
//cout<<endl;
if(val==0|| end == -1){
return 0;
}
int res= 1e18;
for(int i = 0; i<val; i++){
//cout<<"i is "<<i<<endl;
int c= 0;
vector<int> begins;
for(int j = val-i; j<=val; j++){
begins.push_back(link[j]);
c+=move(j, end+val-i-j);
}
res=min(dp(val-i-1, end-i-1)+c, res);
for(int j = val; j>=val-i; j--){
move(j, begins.back());
begins.pop_back();
}
}
return res;
}
signed main(){
int n;
cin>>n;
v.resize(n);
link.resize(n+1);
int res= 0;
for(int i = 0; i<n; i++){
cin>>v[i];
link[v[i]] = i;
}
cout<<dp(n,n-1)<<endl;
}
컴파일 시 표준 에러 (stderr) 메시지
Main.cpp: In function 'long long int dp(long long int, long long int)':
Main.cpp:37:14: warning: unused variable 'e' [-Wunused-variable]
37 | for(auto e: v){
| ^
Main.cpp: In function 'int main()':
Main.cpp:68:9: warning: unused variable 'res' [-Wunused-variable]
68 | int res= 0;
| ^~~
# | 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... |