結果
| 問題 | No.1632 Sorting Integers (GCD of M) |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2021-07-30 21:26:08 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,408 bytes |
| コンパイル時間 | 2,634 ms |
| コンパイル使用メモリ | 214,436 KB |
| 実行使用メモリ | 813,656 KB |
| 最終ジャッジ日時 | 2024-09-15 22:56:12 |
| 合計ジャッジ時間 | 5,197 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | RE | - |
| testcase_03 | MLE | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
| testcase_48 | -- | - |
| testcase_49 | -- | - |
| testcase_50 | -- | - |
| testcase_51 | -- | - |
| testcase_52 | -- | - |
| testcase_53 | -- | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
| testcase_61 | -- | - |
| testcase_62 | -- | - |
ソースコード
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
auto tmp = v;
for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
rearrange(ord, head);
rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
int to;
T cost;
int id;
edge():id(-1){};
edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
operator int() const { return to; }
};
template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
Graph<T>ret(g.size());
for(int i=0;i<g.size();i++){
for(auto e:g[i]){
int to = e.to;
e.to = i;
ret[to].push_back(e);
}
}
return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
Graph<T> ret(n);
for(int es = 0; es < m; es++){
int u,v;
T w=1;
cin>>u>>v;u-=indexed,v-=indexed;
if(weighted)cin>>w;
ret[u].emplace_back(v,w,es);
if(!directed)ret[v].emplace_back(u,w,es);
}
return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
Graph<T>ret(n);
for(int i=1;i<n;i++){
int p;cin>>p;
p-=indexed;
ret[p].emplace_back(i);
if(!directed)ret[i].emplace_back(p);
}
return ret;
}
template<class Key, class Value, class Hash>
struct hash_map {
using size_type = std::size_t;
using key_type = Key;
using value_type = Value;
using pair_type = std::pair<key_type, value_type>;
enum class State: std::uint8_t {
INACTIVE,
ACTIVE,
FILLED
};
Hash hashf;
std::vector<State> st;
std::vector<pair_type> bck;
size_type mask;
size_type prode;
size_type sz;
size_type min_elem;
hash_map():
mask(0), prode(-1), sz(0), min_elem(0) {
}
size_type find_empty(const key_type& key) {
size_type h = hashf(key);
for(size_type delta = 0;;delta++) {
size_type i = (h + delta) & mask;
if(st[i] != State::FILLED) {
if(prode < delta) prode = delta;
return i;
}
}
}
size_type find_filled(const key_type& key) {
if(sz == 0) return size_type(-1);
size_type h = hashf(key);
for(size_type delta = 0; delta <= prode; delta++) {
size_type i = (h + delta) & mask;
if(st[i] == State::FILLED) {
if(bck[i].first == key) {
return i;
}
}
else if(st[i] == State::INACTIVE) {
return size_type(-1);
}
}
return size_type(-1);
}
size_type find_or_allocate(const key_type& key) {
size_type h = hashf(key);
size_type hole = size_type(-1);
size_type delta = 0;
for(; delta <= prode; delta++) {
size_type i = (h + delta) & mask;
if(st[i] == State::FILLED) {
if(bck[i].first == key) return i;
}
else if(st[i] == State::INACTIVE) return i;
else {
if(hole == size_type(-1)) {
hole = i;
}
}
}
if(hole != size_type(-1)) return hole;
for(; ; delta++) {
size_type i = (h + delta) & mask;
if(st[i] != State::FILLED) {
prode = delta;
return i;
}
}
}
void reserve(int next_cnt) {
size_type required_cnt = next_cnt + (next_cnt >> 1) + 1;
if(required_cnt > bck.size()) {
next_cnt = 4;
while(next_cnt < required_cnt) next_cnt <<= 1;
}
else if(next_cnt <= bck.size() / 4) {
next_cnt = std::max(4, (int)bck.size() / 2);
}
else {
return;
}
std::vector<State> old_st(next_cnt, State::INACTIVE);
std::vector<pair_type> old_bck(next_cnt);
std::swap(old_st, st);
std::swap(old_bck, bck);
mask = next_cnt - 1;
sz = 0;
prode = 0;
min_elem = next_cnt - 1;
for(size_type pos = 0; pos < old_bck.size(); pos++) {
if(old_st[pos] == State::FILLED) {
size_type i = find_empty(old_bck[pos].first);
st[i] = State::FILLED;
bck[i] = std::move(old_bck[pos]);
min_elem = std::min(min_elem, i);
sz += 1;
}
}
}
void insert(const key_type& key, const value_type& val) {
reserve(sz + 1);
size_type i = find_or_allocate(key);
if(st[i] != State::FILLED) {
st[i] = State::FILLED;
bck[i] = pair_type(key, val);
min_elem = std::min(min_elem, i);
sz++;
}
else {
bck[i] = pair_type(key, val);
}
}
bool erase(const key_type& key) {
size_type i = find_filled(key);
if(i == size_type(-1)) {
return false;
}
else {
st[i] = State::ACTIVE;
bck[i].~pair_type();
sz--;
return true;
}
}
pair_type* get(const key_type& key) {
size_type i = find_filled(key);
if(i == size_type(-1)) {
return nullptr;
}
else {
return &bck[i];
}
}
pair_type* get_or_insert(const key_type& key, const value_type val) {
reserve(sz + 1);
size_type i = find_or_allocate(key);
if(st[i] != State::FILLED) {
st[i] = State::FILLED;
bck[i] = pair_type(key, val);
min_elem = std::min(min_elem, i);
sz++;
}
return &bck[i];
}
pair_type get_and_erase(const key_type& key) {
size_type i = find_filled(key);
st[i] = State::ACTIVE;
pair_type p = std::move(bck[i]);
sz--;
return p;
}
template<class Func>
void search_all(Func func) {
for(size_type i = min_elem; i < bck.size(); i++) {
if(st[i] == State::FILLED) {
min_elem = i;
size_type res = func(bck[i]);
if(res & 0b10) {
st[i] = State::ACTIVE;
bck[i].~pair_type();
sz--;
}
if(res & 0b01) {
return;
}
}
}
}
size_type size() const { return sz; }
};
struct Hashu32 {
std::uint32_t operator()(std::uint32_t key) {
int c2=0x27d4eb2d; // a prime or an odd constant
key = (key ^ 61) ^ (key >> 16);
key = key + (key << 3);
key = key ^ (key >> 4);
key = key * c2;
key = key ^ (key >> 15);
return key;
}
};
struct Hashu64 {
std::size_t operator()(std::uint64_t key) {
key = (~key) + (key << 18); // key = (key << 18) - key - 1;
key = key ^ (key >> 31);
key = key * 21; // key = (key + (key << 2)) + (key << 4);
key = key ^ (key >> 11);
key = key + (key << 6);
key = key ^ (key >> 22);
return (int) key;
}
};
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
ll res=0,buf=0;
bool judge = true;
int n,k;cin>>n>>k;
vector<int>v;
rep(i,1,10){
int c;cin>>c;
rep(_,0,c)v.PB(i);
}
vector<hash_map<int,int,Hashu32>>mp(1<<n);
int h=n/2;
{
auto dfs=[&](auto &&f,int num,int rem,int bit)->void{
if(num==0){
auto p=mp[bit].get_or_insert(rem%k,0);
p->se++;
return;
}
rep(i,0,n){
if(i>0&&v[i]==v[i-1]&&(~bit>>i-1&1))continue;
f(f,num-1,rem*10+v[i],bit|1<<i);
}
};
dfs(dfs,h,0,0);
}
//rep(i,0,1<<n){cout<<i<<":";debug(mp[i]);}
{
int mask=(1<<n)-1;
ll mult=1;
rep(_,0,h)mult*=10;
auto dfs=[&](auto &&f,int num,int rem,int bit)->void{
if(num==0){
auto p=mp[bit^mask].get((k-rem*mult%k)%k);
if(p!=nullptr)res+=p->se;
return;
}
rrep(i,0,n){
if(i<n-1&&v[i]==v[i+1]&&(~bit>>i+1&1))continue;
f(f,num-1,rem*10+v[i],bit|1<<i);
}
};
dfs(dfs,n-h,0,0);
}
cout<<res<<endl;
return 0;
}