#935272 (C++23) No.2567 A_1 > A_2 > ... > A_N

• 問題: No.2567 A_1 > A_2 > ... > A_N
• ユーザー: NATTO
• 提出日時: 2023-12-02 16:45:05
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 125 ms / 2,000 ms
• コード長: 2,423 bytes
• コンパイル時間: 5,315 ms
• コンパイル使用メモリ: 307,312 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 20:40:14
• 合計ジャッジ時間: 7,849 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 1
other	AC * 16

ソースコード

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
#pragma region header
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// clang-format off
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
inline void IN(void)
{
    return;
}
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest)
{
    cin >> first;
    IN(rest...);
    return;
}
template <typename T>
istream &operator>>(istream &is, pair<T, T> &p)
{
    is >> p.first >> p.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (auto &x : v)
        is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v)
{
    for (auto &x : v)
        os << x << " ";
    os << endl;
    return os;
}
// templetes
//alias
 
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
using pll = pair<ll, ll>;
 
//define short
#define vec vector
#define all(obs) (obs).begin(), (obs).end()
#define YESNO(cond) (cond) ? cout << "YES" << endl : cout << "NO" << endl;
#define YesNo(cond) (cond) ? cout << "Yes" << endl : cout << "No" << endl;
#define yesno(cond) (cond) ? cout << "yes" << endl : cout << "no" << endl;
#define sortv(obs) sort(all(obs))
#define rsortv(obs) reverse(sort(all(obs)))
#define bitu(n,i) (((n)>>(i))&1)
#define dig10(n) to_string(n).size()
#define bcnt(n) __builtin_popcount(n)
#define bcntll(n) __builtin_popcountll(n)
#define F first
#define S second
#define pb push_back
#define pq priority_queue
//define loop
#define rep(i, a,b) for(ll i = a; i < (b); i++)
#define rrep(i, a,b) for(ll i = a; i >= (b); i--)
//define INF
const ll INF = 1e18;
template <typename T1,typename T2>
inline void chmin(T1 &a,T2 b){
    if(a>b) a = b;
}
template <typename T1,typename T2>
inline void chmax(T1 &a,T2 b){
    if(a<b) a = b;
}
#pragma endregion header
// clang-format on
int main(){
    ll T;
    cin>>T;
    rep(i,0,T){
        ll n,x;
        cin>>n>>x;
        if((n+1)*n/2<=x){
            ll dif=x-(n+1)*n/2;
            ll q=dif/n,r=dif%n;
            rep(j,0,n){
                if(j<r) cout<<n-j+q+1<<" ";
                else cout<<n-j+q<<" ";
            }
            cout<<endl;
        }else{
            cout<<-1<<endl;
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX