結果
問題 | No.2719 Equal Inner Products in Permutation |
ユーザー |
👑 ![]() |
提出日時 | 2024-04-05 22:16:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 2,835 bytes |
コンパイル時間 | 2,026 ms |
コンパイル使用メモリ | 205,904 KB |
最終ジャッジ日時 | 2025-02-20 21:31:14 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){vector<vector<int>> p={{1,2,4,11,7,9,10,12,8,5,6,3},{1,2,3,8,13,7,10,12,14,15,11,9,6,4,5},{1,4,3,6,5,2},{1,2,8,3,6,9,7,5,4}};int N;cin>>N;if(N==1){cout<<"-1\n";return;}vector<int> A,B,C;int R=N%4;int L=p[R].size()/3;int X=L*3+1;int Y=N-L;//cout<<R<<" "<<L<<" "<<X<<" "<<Y<<endl;rep(i,0,L) A.push_back(p[R][i]);rep(i,0,L) B.push_back(p[R][i+L]);rep(i,0,L) C.push_back(p[R][i+L+L]);rep(i,0,Y){if(i%4==0||i%4==3){A.push_back(X+i);B.push_back(X+i+Y);C.push_back(X+i+Y+Y);}else{A.push_back(X+i+Y+Y);B.push_back(X+i+Y);C.push_back(X+i);}}rep(i,0,N) A.push_back(B[i]);rep(i,0,N) A.push_back(C[i]);vec_out(A);}/*21 4 3 6 5 231 2 8 3 6 9 7 5 441 2 4 11 7 9 10 12 8 5 6 351 2 3 8 13 7 10 12 14 15 11 9 6 4 5*/