結果
問題 | No.2178 Payable Magic Items |
ユーザー |
|
提出日時 | 2023-01-06 22:10:34 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 147 ms / 4,000 ms |
コード長 | 3,623 bytes |
コンパイル時間 | 17,554 ms |
コンパイル使用メモリ | 256,752 KB |
最終ジャッジ日時 | 2025-02-10 00:00:36 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 23 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <atcoder/all>#include <iostream> // cout, endl, cin#include <string> // string, to_string, stoi#include <vector> // vector#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound#include <utility> // pair, make_pair#include <tuple> // tuple, make_tuple#include <cstdint> // int64_t, int*_t#include <cstdio> // printf#include <map> // map#include <queue> // queue, priority_queue#include <set> // set#include <stack> // stack#include <deque> // deque#include <unordered_map> // unordered_map#include <unordered_set> // unordered_set#include <bitset> // bitset#include <cctype> // isupper, islower, isdigit, toupper, tolower#include <math.h>#include <iomanip>#include <functional>using namespace std;using namespace atcoder;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)typedef long long ll;typedef unsigned long long ull;const ll inf=8e18;using graph = vector<vector<int> > ;using P= pair<ll,ll>;using vi=vector<int>;using vvi=vector<vi>;using vll=vector<ll>;using vvll=vector<vll>;using vp=vector<P>;using vpp=vector<vp>;using vd=vector<double>;using vvd =vector<vd>;//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";//string S="abcdefghijklmnopqrstuvwxyz";//g++ main.cpp -std=c++17 -I .//cout <<setprecision(20);//cout << fixed << setprecision(10);//cin.tie(0); ios::sync_with_stdio(false);const double PI = acos(-1);int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};void putsYes(bool f){cout << (f?"Yes":"No") << endl;}void putsYES(bool f){cout << (f?"YES":"NO") << endl;}void putsFirst(bool f){cout << (f?"First":"Second") << endl;}template<class T> void debug(T s){cout << "test" << " " << s << endl;}ll pow_pow(ll x,ll n,ll mod){if(n==0) return 1;x%=mod;ll res=pow_pow(x*x%mod,n/2,mod);if(n&1)res=res*x%mod;return res;}ll gcd(ll x,ll y){if(y==0)return x;return gcd(y,x%y);}ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}template<class T> bool chmin(T& a, T b) {if (a > b) {a = b;return true;}else return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b;return true;}else return false;}ll sqrt_(ll x) {ll l = 0, r = ll(3e9)+1;while (l+1<r) {ll c = (l+r)/2;if (c*c <= x) l = c; else r = c;}return l;}int valid(int x,int y,int h,int w){if(x>=0 && y>=0 && x<h && y<w)return 1;else return 0;}struct edge{int to; int id;edge(int to,int id) : to(to),id(id){}};vi vs;int k;void dfs(int v,int i=0){if(i==k){vs.push_back(v);return;}rep(j,5){int now=v*10+j;dfs(now,i+1);}}using ve=vector<edge>;using vve=vector<ve>;void solve(int test){int n; cin >> n >> k;vector<string> s(n);vi a(n);rep(i,n)cin >> s[i];int m=0;rep(i,k)m=m*10+4;vi rui(m+1);vi ten;rep(j,k)ten.push_back(pow_pow(10,j,1e9+7));reverse(ten.begin(),ten.end());rep(i,n){int now=0;for(int j=0; j<k; j++){now=now*10+(s[i][j]-'0');}a[i]=now;rui[now]++;}dfs(0);sort(vs.rbegin(),vs.rend());rep(j,k){for(auto i:vs){int now=i;int f=(now/ten[j])%10;if(f!=4){if(i+ten[j]<=m)rui[i]+=rui[i+ten[j]];}}}int ans=0;rep(i,n)if(rui[a[i]]>1)ans++;cout<< ans << endl;}//g++ main.cpp -std=c++17 -I .int main(){cin.tie(0);ios::sync_with_stdio(false);int t=1;//cin >> t;rep(test,t)solve(test);}