結果

問題 No.2178 Payable Magic Items
ユーザー noya2noya2
提出日時 2023-01-06 22:31:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 43 ms / 4,000 ms
コード長 10,910 bytes
コンパイル時間 5,519 ms
コンパイル使用メモリ 301,088 KB
実行使用メモリ 18,800 KB
最終ジャッジ日時 2023-08-21 08:20:24
合計ジャッジ時間 7,129 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 5 ms
5,088 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 5 ms
5,216 KB
testcase_06 AC 5 ms
5,152 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 6 ms
5,200 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 43 ms
18,672 KB
testcase_12 AC 43 ms
18,604 KB
testcase_13 AC 42 ms
18,768 KB
testcase_14 AC 43 ms
18,684 KB
testcase_15 AC 43 ms
18,616 KB
testcase_16 AC 42 ms
18,800 KB
testcase_17 AC 17 ms
9,236 KB
testcase_18 AC 2 ms
4,376 KB
testcase_19 AC 10 ms
6,800 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 2 ms
4,376 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 32 ms
14,452 KB
testcase_25 AC 10 ms
6,540 KB
testcase_26 AC 13 ms
8,188 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// tasukete ><

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

//using mint = modint998244353;
//using mint = modint1000000007;
using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}
istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}


void solve(){
    int n, k; cin >> n >> k;
    vector<vector<int>> a(n,vector<int>(k));
    rep(i,n){
        string s; cin >> s;
        rep(j,k) a[i][j] = s[j] - '0';
    }
    if (k == 1){
        int rui[5];
        rep(i1,5) rui[i1] = 0;
        rep(i,n) rui[a[i][0]]++;
        reb(i1,4) rui[i1] += rui[i1+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]] > 1) ans++;
        out(ans);
    }
    if (k == 2){
        int rui[5][5];
        rep(i1,5) rep(i2,5) rui[i1][i2] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]]++;
        reb(i1,4) reb(i2,5) rui[i1][i2] += rui[i1+1][i2];
        reb(i1,5) reb(i2,4) rui[i1][i2] += rui[i1][i2+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]] > 1) ans++;
        out(ans);
    }
    if (k == 3){
        int rui[5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rui[i1][i2][i3] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) rui[i1][i2][i3] += rui[i1+1][i2][i3];
        reb(i1,5) reb(i2,4) reb(i3,5) rui[i1][i2][i3] += rui[i1][i2+1][i3];
        reb(i1,5) reb(i2,5) reb(i3,4) rui[i1][i2][i3] += rui[i1][i2][i3+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]] > 1) ans++;
        out(ans);
    }
    if (k == 4){
        int rui[5][5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rep(i4,5) rui[i1][i2][i3][i4] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) reb(i4,5) rui[i1][i2][i3][i4] += rui[i1+1][i2][i3][i4];
        reb(i1,5) reb(i2,4) reb(i3,5) reb(i4,5) rui[i1][i2][i3][i4] += rui[i1][i2+1][i3][i4];
        reb(i1,5) reb(i2,5) reb(i3,4) reb(i4,5) rui[i1][i2][i3][i4] += rui[i1][i2][i3+1][i4];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,4) rui[i1][i2][i3][i4] += rui[i1][i2][i3][i4+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]] > 1) ans++;
        out(ans);
    }
    if (k == 5){
        int rui[5][5][5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rep(i4,5) rep(i5,5) rui[i1][i2][i3][i4][i5] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) rui[i1][i2][i3][i4][i5] += rui[i1+1][i2][i3][i4][i5];
        reb(i1,5) reb(i2,4) reb(i3,5) reb(i4,5) reb(i5,5) rui[i1][i2][i3][i4][i5] += rui[i1][i2+1][i3][i4][i5];
        reb(i1,5) reb(i2,5) reb(i3,4) reb(i4,5) reb(i5,5) rui[i1][i2][i3][i4][i5] += rui[i1][i2][i3+1][i4][i5];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,4) reb(i5,5) rui[i1][i2][i3][i4][i5] += rui[i1][i2][i3][i4+1][i5];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,4) rui[i1][i2][i3][i4][i5] += rui[i1][i2][i3][i4][i5+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]] > 1) ans++;
        out(ans);
    }
    if (k == 6){
        int rui[5][5][5][5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rep(i4,5) rep(i5,5) rep(i6,5) rui[i1][i2][i3][i4][i5][i6] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) rui[i1][i2][i3][i4][i5][i6] += rui[i1+1][i2][i3][i4][i5][i6];
        reb(i1,5) reb(i2,4) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) rui[i1][i2][i3][i4][i5][i6] += rui[i1][i2+1][i3][i4][i5][i6];
        reb(i1,5) reb(i2,5) reb(i3,4) reb(i4,5) reb(i5,5) reb(i6,5) rui[i1][i2][i3][i4][i5][i6] += rui[i1][i2][i3+1][i4][i5][i6];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,4) reb(i5,5) reb(i6,5) rui[i1][i2][i3][i4][i5][i6] += rui[i1][i2][i3][i4+1][i5][i6];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,4) reb(i6,5) rui[i1][i2][i3][i4][i5][i6] += rui[i1][i2][i3][i4][i5+1][i6];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,4) rui[i1][i2][i3][i4][i5][i6] += rui[i1][i2][i3][i4][i5][i6+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]] > 1) ans++;
        out(ans);
    }
    if (k == 7){
        int rui[5][5][5][5][5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rep(i4,5) rep(i5,5) rep(i6,5) rep(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]][a[i][6]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1+1][i2][i3][i4][i5][i6][i7];
        reb(i1,5) reb(i2,4) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2+1][i3][i4][i5][i6][i7];
        reb(i1,5) reb(i2,5) reb(i3,4) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2][i3+1][i4][i5][i6][i7];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,4) reb(i5,5) reb(i6,5) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2][i3][i4+1][i5][i6][i7];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,4) reb(i6,5) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2][i3][i4][i5+1][i6][i7];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,4) reb(i7,5) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2][i3][i4][i5][i6+1][i7];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,4) rui[i1][i2][i3][i4][i5][i6][i7] += rui[i1][i2][i3][i4][i5][i6][i7+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]][a[i][6]] > 1) ans++;
        out(ans);
    }
    if (k == 8){
        int rui[5][5][5][5][5][5][5][5];
        rep(i1,5) rep(i2,5) rep(i3,5) rep(i4,5) rep(i5,5) rep(i6,5) rep(i7,5) rep(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] = 0;
        rep(i,n) rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]][a[i][6]][a[i][7]]++;
        reb(i1,4) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1+1][i2][i3][i4][i5][i6][i7][i8];
        reb(i1,5) reb(i2,4) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2+1][i3][i4][i5][i6][i7][i8];
        reb(i1,5) reb(i2,5) reb(i3,4) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3+1][i4][i5][i6][i7][i8];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,4) reb(i5,5) reb(i6,5) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3][i4+1][i5][i6][i7][i8];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,4) reb(i6,5) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3][i4][i5+1][i6][i7][i8];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,4) reb(i7,5) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3][i4][i5][i6+1][i7][i8];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,4) reb(i8,5) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3][i4][i5][i6][i7+1][i8];
        reb(i1,5) reb(i2,5) reb(i3,5) reb(i4,5) reb(i5,5) reb(i6,5) reb(i7,5) reb(i8,4) rui[i1][i2][i3][i4][i5][i6][i7][i8] += rui[i1][i2][i3][i4][i5][i6][i7][i8+1];
        int ans = 0;
        rep(i,n) if (rui[a[i][0]][a[i][1]][a[i][2]][a[i][3]][a[i][4]][a[i][5]][a[i][6]][a[i][7]] > 1) ans++;
        out(ans);
    }
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0