제출 #980303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980303		t9unkubj	순열 (APIO22_perm)	C++17	0 / 100	1 ms	348 KiB

perm

#pragma GCC optimize("O3")
#ifdef t9unkubj
#include "debug.cpp"
#else
#define dbg(...) 199958
#endif

using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll (i)=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll (i)=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll (i)=(n);i>=(m);i--)
#define drep(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcount(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
//#include"perm.h"
using int64=ll;
double pass_time=0;
vi construct_permutation(ll k){
    --k;
    stack<int>que;
    int off=0;
    while(k>0){
        REP(i,1,64){
            if((1ll<<i)-1<=k){
                for(ll j=i;j>0;j--){
                    que.push(j+off);
                }    
                off+=i;
            }
            k-=((1<<i)-1);
        }
    }
    vi ans;
    while(que.size()){
        ans.pb(que.top());que.pop();
    }
    return ans;
}
/*int main(){
    INT(q);
    while(q--){
        LL(k);
        dbg(construct_permutation(k));
    }
}*/

컴파일 시 표준 에러 (stderr) 메시지

perm.cpp: In function 'vvi readgraph(int, int, int)':
perm.cpp:27:25: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define rep(i,n) for(ll (i)=0;i<(ll)(n);i++)
      |                         ^
perm.cpp:121:5: note: in expansion of macro 'rep'
  121 |     rep(i, m){
      |     ^~~
perm.cpp: In function 'vc<T> presum(vc<T>&)':
perm.cpp:27:25: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define rep(i,n) for(ll (i)=0;i<(ll)(n);i++)
      |                         ^
perm.cpp:136:5: note: in expansion of macro 'rep'
  136 |     rep(i,a.size())ret[i+1]=ret[i]+a[i];
      |     ^~~
perm.cpp: In function 'vi construct_permutation(ll)':
perm.cpp:28:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   28 | #define REP(i,j,n) for(ll (i)=(j);i<(ll)(n);i++)
      |                           ^
perm.cpp:162:9: note: in expansion of macro 'REP'
  162 |         REP(i,1,64){
      |         ^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 90