Submission

Score: 0

User: exoworldgd

Problemset: สร้างคู่ผกผัน (Inversion)

Language: cpp

Time: 0.000 second

Submitted On: 2025-10-15 23:25:42

#pragma GCC optimize("O5,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#include "inversion.h"
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
#define int long long
using namespace std;
const int inf = LLONG_MAX, mod = 1e9+7, maxn = 1e6+1;
vector<int> inversion(int n, int k) {
    vector<int> ans;
    for (int i = 1; i <= n; i++) ans.push_back(i);
    int pos = 0;
    while (k > 0) {
        int len = min(s+1,n-pos);
        reverse(ans.begin()+pos,ans.begin()+pos+len), k -= len-1, pos++;
    }
    return ans;
}