#51597 (C++11（廃止可能性あり）) No.270 next_permutation (1)

• 問題: No.270 next_permutation (1)
• ユーザー: ctyl_0
• 提出日時: 2015-10-01 00:30:18
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 71 ms / 2,000 ms
• コード長: 2,379 bytes
• コンパイル時間: 939 ms
• コンパイル使用メモリ: 91,244 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-21 07:31:43
• 合計ジャッジ時間: 2,173 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 15

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
using namespace std;
int inputValue(){
    int a;
    cin >> a;
    return a;
};
template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}
void my_next_permutation(vector<int> &p, vector<pair<int, int>> &swp){
    swp.clear();
    if (p.size() == 1) {
        return;
    }
    int s = (int)p.size();
    int k = s - 2;
    int l = s - 1;
    for (; k >= 0; k--) {
        if (p[k + 1] > p[k]) {
            break;
        }
        if (k == 0) {
            for (; k < l; k++, s--) {
                //swap(p[k], p[l]);
                swp.push_back(mp(k, l));
            }
            return;
        }
    }
    
    
    for (; l > k; l--) {
        if (p[l] > p[k]) {
            break;
        }
    }
    
    //swap(p[k], p[l]);
    swp.push_back(mp(k, l));
    
    for (; k + 1 < s - 1; k++, s--) {
        //swap(p[k + 1], p[s - 1]);
        swp.push_back(mp(k + 1, s - 1));
    }
    
}
int main() {
    
    // source code
    int N = inputValue();
    int K = inputValue();
    vector<int> P(N);
    vector<int> B(N);
    
    rep(i, N){
        P[i] = inputValue();
    }
    
    rep(i, N){
        B[i] = inputValue();
    }
    
    // K == 0
    if (K == 0) {
        output(0, 0);
        return 0;
    }
    
    ll ret = 0;
    rep(i, N){
        ret += abs(P[i] - B[i]);
    }
    
    ll dist = ret;
    
    vector<pair<int, int>> swp;
        rep(k, K - 1){
            my_next_permutation(P, swp);
            
            rep(i, swp.size()){
                dist -= abs(P[swp[i].first] - B[swp[i].first]);
                dist -= abs(P[swp[i].second] - B[swp[i].second]);
                swap(P[swp[i].first], P[swp[i].second]);
                dist += abs(P[swp[i].first] - B[swp[i].first]);
                dist += abs(P[swp[i].second] - B[swp[i].second]);
            }
            ret += dist;
        }
    
    output(ret, 0);
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX