結果

問題 No.3271 PQ Dot Product
コンテスト
ユーザー noya2
提出日時 2025-09-12 22:32:55
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 84 ms / 1,000 ms
コード長 7,398 bytes
コンパイル時間 3,237 ms
コンパイル使用メモリ 298,396 KB
実行使用メモリ 26,752 KB
最終ジャッジ日時 2025-09-12 23:42:38
合計ジャッジ時間 9,624 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

void jikken1(){
    int n; in(n);
    vector<int> p(n); iota(all(p),0);
    map<int,vector<int>> mp;
    do {
        int s = 0;
        rep(i,n){
            s += (i+1) * (p[i]+1);
        }
        if (!mp.contains(s)){
            mp[s] = p;
        }
    }while(next_permutation(all(p)));
    // for (auto [s, q] : mp){
    //     out(s,":",q);
    // }
    int mi = mp.begin()->first;
    int ma = mp.rbegin()->first;
    assert((int)(mp.size()) == ma-mi+1);
}

deque<ll> ans;

pll getlr(ll n){
    ll le = n*(n+1)*(n+2)/6;
    ll ri = n*(n+1)*(2*n+1)/6;
    return {le,ri};
}
ll tri(ll n){
    return n*(n+1)/2;
}

bool valid(ll n, ll k){
    auto [le, ri] = getlr(n);
    if (!(le <= k && k <= ri)){
        return false;
    }
    if (n == 3){
        return k != 12;
    }
    return true;
}

void make(ll n, ll more){
    // out(n,more); cout << flush;
    auto [le, ri] = getlr(n);
    assert(0 <= more && more <= ri-le);
    if (n == 1){
        ans.emplace_back(1);
        return ;
    }
    if (n == 2){
        if (more == 0){
            ans.emplace_back(2);
            ans.emplace_back(1);
        }
        else if (more == 1){
            ans.emplace_back(1);
            ans.emplace_back(2);
        }
        else {
            abort();
        }
        return ;
    }
    if (n == 3){
        auto push = [&](ll a, ll b, ll c){
            ans.emplace_back(a);
            ans.emplace_back(b);
            ans.emplace_back(c);
        };
        if (more == 0){
            push(3,2,1);
        }
        else if (more == 1){
            push(2,3,1);
        }
        else if (more == 3){
            push(1,3,2);
        }
        else if (more == 4){
            push(1,2,3);
        }
        else {
            abort();
        }
        return ;
    }
    if (n == 4){
        auto push = [&](ll a, ll b, ll c, ll d){
            ans.emplace_back(a);
            ans.emplace_back(b);
            ans.emplace_back(c);
            ans.emplace_back(d);
        };
        if (more == 2){
            push(3,4,1,2);
            return ;
        }
        if (more == 5){
            push(2,4,1,3);
            return ;
        }
        if (more == tri(n-1)+2){
            push(2,1,4,3);
            return ;
        }
        if (more < tri(n-1)){
            make(n-1,more);
            ans.emplace_front(n);
        }
        else {
            make(n-1,more-tri(n-1));
            ans.emplace_back(n);
        }
        return ;
    }
    if (more < tri(n-1)){
        make(n-1,more);
        ans.emplace_front(n);
    }
    else {
        make(n-1,more-tri(n-1));
        ans.emplace_back(n);
    }
    return ;
}

void solve(){
    // jikken1();
    ll n, k; in(n,k);
    if (!valid(n,k)){
        no();
        return ;
    }
    auto [le, ri] = getlr(n);
    make(n,k-le);
    vector<ll> say(ans.begin(),ans.end());
    yes();
    ll sum = 0;
    rep(i,n){
        sum += (i+1)*say[i];
    }
    assert(sum == k);
    vector<ll> id(n); iota(all(id),1);
    out(id);
    out(say);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0