제출 #959222

#제출 시각아이디문제언어결과실행 시간메모리
959222zeta7532순열 (APIO22_perm)C++17
10 / 100
1 ms348 KiB
#include "perm.h" #include <bits/stdc++.h> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; const ll mod = 998244353; #define fi first #define se second #define rep(i,n) for(ll i=0;i<n;i++) #define all(x) x.begin(),x.end() #define faster ios::sync_with_stdio(false);cin.tie(nullptr) std::vector<int> construct_permutation(long long k) { if(k<=90){ vector<int> ans(k-1); rep(i,k-1) ans[i]=k-2-i; return ans; } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...