結果

問題 No.1635 Let’s Sort Integers!!
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-07-30 21:57:53
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 126 ms / 2,000 ms
コード長 6,799 bytes
コンパイル時間 7,818 ms
コンパイル使用メモリ 319,544 KB
実行使用メモリ 31,028 KB
最終ジャッジ日時 2023-10-14 04:39:53
合計ジャッジ時間 25,930 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 1 ms
4,352 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 1 ms
4,352 KB
testcase_05 AC 2 ms
4,352 KB
testcase_06 AC 2 ms
4,352 KB
testcase_07 AC 2 ms
4,352 KB
testcase_08 AC 2 ms
4,352 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,356 KB
testcase_11 AC 2 ms
4,352 KB
testcase_12 AC 2 ms
4,352 KB
testcase_13 AC 2 ms
4,352 KB
testcase_14 AC 1 ms
4,376 KB
testcase_15 AC 2 ms
4,352 KB
testcase_16 AC 1 ms
4,352 KB
testcase_17 AC 2 ms
4,352 KB
testcase_18 AC 2 ms
4,352 KB
testcase_19 AC 2 ms
4,352 KB
testcase_20 AC 2 ms
4,348 KB
testcase_21 AC 2 ms
4,352 KB
testcase_22 AC 2 ms
4,348 KB
testcase_23 AC 1 ms
4,348 KB
testcase_24 AC 2 ms
4,348 KB
testcase_25 AC 1 ms
4,352 KB
testcase_26 AC 1 ms
4,356 KB
testcase_27 AC 1 ms
4,352 KB
testcase_28 AC 1 ms
4,352 KB
testcase_29 AC 2 ms
4,352 KB
testcase_30 AC 2 ms
4,352 KB
testcase_31 AC 1 ms
4,348 KB
testcase_32 AC 2 ms
4,348 KB
testcase_33 AC 1 ms
4,372 KB
testcase_34 AC 2 ms
4,356 KB
testcase_35 AC 2 ms
4,348 KB
testcase_36 AC 1 ms
4,352 KB
testcase_37 AC 2 ms
4,348 KB
testcase_38 AC 2 ms
4,356 KB
testcase_39 AC 2 ms
4,348 KB
testcase_40 AC 2 ms
4,352 KB
testcase_41 AC 1 ms
4,348 KB
testcase_42 AC 1 ms
4,352 KB
testcase_43 AC 2 ms
4,352 KB
testcase_44 AC 1 ms
4,352 KB
testcase_45 AC 2 ms
4,356 KB
testcase_46 AC 1 ms
4,352 KB
testcase_47 AC 2 ms
4,352 KB
testcase_48 AC 2 ms
4,352 KB
testcase_49 AC 2 ms
4,352 KB
testcase_50 AC 2 ms
4,352 KB
testcase_51 AC 2 ms
4,352 KB
testcase_52 AC 1 ms
4,352 KB
testcase_53 AC 2 ms
4,348 KB
testcase_54 AC 1 ms
4,352 KB
testcase_55 AC 2 ms
4,348 KB
testcase_56 AC 1 ms
4,352 KB
testcase_57 AC 2 ms
4,352 KB
testcase_58 AC 2 ms
4,348 KB
testcase_59 AC 34 ms
30,576 KB
testcase_60 AC 119 ms
30,592 KB
testcase_61 AC 122 ms
30,624 KB
testcase_62 AC 120 ms
30,848 KB
testcase_63 AC 123 ms
30,776 KB
testcase_64 AC 122 ms
30,612 KB
testcase_65 AC 122 ms
30,528 KB
testcase_66 AC 125 ms
30,700 KB
testcase_67 AC 126 ms
30,788 KB
testcase_68 AC 38 ms
30,776 KB
testcase_69 AC 38 ms
30,660 KB
testcase_70 AC 121 ms
30,756 KB
testcase_71 AC 121 ms
30,736 KB
testcase_72 AC 121 ms
31,028 KB
testcase_73 AC 120 ms
30,468 KB
testcase_74 AC 121 ms
30,492 KB
testcase_75 AC 124 ms
30,640 KB
testcase_76 AC 124 ms
31,012 KB
testcase_77 AC 123 ms
31,024 KB
testcase_78 AC 38 ms
30,764 KB
testcase_79 AC 2 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 9100000000000000000ll;
const ld eps = ld(0.0000000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll a){ll res=0;while(a){res+=a%2;a/=2;}return res;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
ll solv2e(ll n,vector<ll> a){
  sor(a);
  rever(a);
  vector<ll> b,c;
  ll x=0,y=0;
  for(int i=0;i<n/2;i++){
    b.push_back(a[i]);
    x+=a[i];
  }
  for(int i=n/2;i<n;i++){
    c.push_back(a[i]);
    y+=a[i];
  }
  ll ans=(x-y)*2;
  if(n%2==0){
    return ans-b[int(b.size())-1]+c[0];
  }
  else{
    ll ans1=ans+c[0]+c[1];
    ll ans2=(x-y+2*c[0])*2-c[0]-b[int(b.size())-1];
    return max(ans1,ans2);
  }
}
vector<ll> solve(ll n,ll k){
  vector<ll> X;
  for(int i=0;i<n;i++) X.pb(i);
  ll Y=solv2e(n,X);
  ll now=n-1;
  ll u=n-3;
  if(k>Y){
    return {};
  }
  if(k<now){
    return {};
  }
  if(k==now){
    vector<ll> x;
    for(int i=1;i<=n;i++){
      x.pb(i);
    }
    return x;
  }
  now++;
  for(int i=1;u>0;i++){
    if(k<=now+u){
      ll x=1,y=n;
      vector<ll> ans;
      for(int j=0;j<i;j++){
        if(j%2==0){
          ans.pb(x);
          x++;
        }
        else{
          ans.pb(y);
          y--;
        }
      }
      if(i%2){
        for(int j=0;j<u-(k-now);j++){
          if(x==y+1) break;
          ans.pb(x);
          x++;
        }
        while(ans.size()<n){
          ans.pb(y);
          y--;
        }
      }
      else{
        for(int j=0;j<u-(k-now);j++){
          if(x==y+1) break;
          ans.pb(y);
          y--;
        }
        while(ans.size()<n){
          ans.pb(x);
          x++;
        }
      }
      return ans;
    }
    now+=u+1;
    u--;
  }
  vector<ll> x;
  if(n%2==0){
    ll p=1,q=n;
    for(int i=0;i<n/2;i++){
      x.pb(p);
      x.pb(q);
      p++;
      q--;
    }
    ll s=0;
    for(int i=0;i<x.size()-1;i++) s+=abs(x[i]-x[i+1]);
    ll u=2;
    for(int i=0;i<k-s;i++){
      swap(x[0],x[u]);
      u+=2;
    }
    return x;
  }
  else{
    ll p=1,q=n/2+2;
    for(int i=0;i<n/2;i++){
      x.pb(p);
      x.pb(q);
      p++;
      q++;
    }
    x.pb(p);
    ll s=0;
    for(int i=0;i<x.size()-1;i++) s+=abs(x[i]-x[i+1]);
    if(s>k){
      vector<ll> p=solve(n,k-1);
      swap(p[2],p[n-1]);
      return p;
    }
    else{
      ll u=2;
      for(int i=0;i<k-s;i++){
        swap(x[u],x[0]);
        u+=2;
      }
      return x;
    }
  }
}
int main() {
  cincout();
  ll n,k;
  cin>>n>>k;
  if(n<=5){
    vector<ll> a;
  for(int i=0;i<n;i++) a.pb(i);
  map<ll,ll> m;
  map<ll,vector<ll>> kk;
  do{
    ll s=0;
    for(int i=0;i<n-1;i++) s+=abs(a[i]-a[i+1]);
    if(m[s]==0) kk[s]=a;
    m[s]++;
  }while(NP(all(a)));
    if(m[k]==0){
      cout<<-1<<endl;
      return 0;
    }
    for(auto e:kk[k]){
      cout<<e+1<<" ";
    }
    cout<<endl;
    return 0;
  }
  auto u=solve(n,k);
  if(u.size()==0){
    cout<<-1<<endl;
    return 0;
  }
  else{
    for(auto e:u){
      cout<<e<<" ";
    }
    cout<<endl;
  }
}
0