#755970 (C++14) No.1909 Detect from Substrings

• 問題: No.1909 Detect from Substrings
• ユーザー: t98slider
• 提出日時: 2022-04-24 13:37:40
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 34 ms / 2,000 ms
• コード長: 4,799 bytes
• コンパイル時間: 1,617 ms
• コンパイル使用メモリ: 169,940 KB
• 実行使用メモリ: 6,476 KB
• 最終ジャッジ日時: 2023-09-08 06:43:49
• 合計ジャッジ時間: 6,341 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,376 KB
testcase_03	AC	2 ms; 4,376 KB
testcase_04	AC	3 ms; 4,384 KB
testcase_05	AC	12 ms; 4,472 KB
testcase_06	AC	21 ms; 5,428 KB
testcase_07	AC	21 ms; 5,392 KB
testcase_08	AC	25 ms; 5,652 KB
testcase_09	AC	21 ms; 5,124 KB
testcase_10	AC	23 ms; 4,992 KB
testcase_11	AC	20 ms; 4,568 KB
testcase_12	AC	21 ms; 4,804 KB
testcase_13	AC	27 ms; 5,692 KB
testcase_14	AC	27 ms; 5,928 KB
testcase_15	AC	28 ms; 5,936 KB
testcase_16	AC	22 ms; 4,728 KB
testcase_17	AC	22 ms; 4,988 KB
testcase_18	AC	22 ms; 5,384 KB
testcase_19	AC	23 ms; 5,496 KB
testcase_20	AC	22 ms; 5,432 KB
testcase_21	AC	28 ms; 5,884 KB
testcase_22	AC	28 ms; 6,444 KB
testcase_23	AC	23 ms; 4,780 KB
testcase_24	AC	23 ms; 4,864 KB
testcase_25	AC	21 ms; 4,704 KB
testcase_26	AC	27 ms; 6,196 KB
testcase_27	AC	28 ms; 6,476 KB
testcase_28	AC	27 ms; 5,856 KB
testcase_29	AC	34 ms; 6,120 KB
testcase_30	AC	33 ms; 6,220 KB
testcase_31	AC	33 ms; 6,228 KB
testcase_32	AC	33 ms; 6,180 KB
testcase_33	AC	33 ms; 6,224 KB
testcase_34	AC	34 ms; 6,228 KB
testcase_35	AC	33 ms; 6,180 KB
testcase_36	AC	33 ms; 6,156 KB
testcase_37	AC	33 ms; 6,148 KB
testcase_38	AC	33 ms; 6,156 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<'\n';}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    INT(n,m);
    vector<string> A(n);
    in(A);
    vector<string> c(2);
    for(int i=0,j=0,cnt=0;i<m||j<m;){
        if(i<m&&j<m&&A[0][i]==A[1][j]){
            c[0]+=A[0][i];
            i++,j++;
        }else{
            if(i<m&&cnt==0){
                c[0]+=A[0][i];
                i++;
            }else if(j<m&&cnt==1){
                c[0]+=A[1][j];
                j++;
            }else{
                c[0].clear();
                break;
            }
            cnt++;
        }
    }
    for(int i=0,j=0,cnt=0;i<m||j<m;){
        if(i<m&&j<m&&A[1][i]==A[0][j]){
            c[1]+=A[1][i];
            i++,j++;
        }else{
            if(i<m&&cnt==0){
                c[1]+=A[1][i];
                i++;
            }else if(j<m&&cnt==1){
                c[1]+=A[0][j];
                j++;
            }else{
                c[1].clear();
                break;
            }
            cnt++;
        }
    }
    //debug(c[0]);
    //debug(c[1]);
    auto f=[&](string s,string t){
        int j=0;
        for(int i=0;i<s.size();i++){
            if(j<m&&s[i]==t[j])j++;
        }
        return (j==m);
    };
    bool a=true,b=true;
    for(int i=0;i<n;i++){
        if(a&&!f(c[0],A[i]))a=false;
        if(b&&!f(c[1],A[i]))b=false;
    }
    out(int(a)+b);
}