题解 | GCPC总决赛

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
//暴力解法
int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    
    // 直接计算所有排列
    vector<int> indices(n);
    for (int i = 0; i < n; i++) indices[i] = i;
    
    ll win = 0, lose = 0, draw = 0;
    
    do {
        int score_a = 0, score_b = 0;
        for (int i = 0; i < n; i++) {
            if (a[i] > b[indices[i]]) score_a++;
            else if (a[i] < b[indices[i]]) score_b++;
        }
        if (score_a > score_b) win++;
        else if (score_a < score_b) lose++;
        else draw++;
    } while (next_permutation(indices.begin(), indices.end()));
    
    cout << win << " " << lose << " " << draw << endl;
    return 0;
}