Submission #525099

---

Source Code Expand

/*
 * b.cc: B: 
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<bitset>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>

using namespace std;

/* constant */

const int MAX_N = 200;
const int MAX_L = 100000;

/* typedef */

typedef bitset<MAX_N> bs;

/* global variables */

bs as[26][MAX_L];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  bs gl;
  int maxl = 0;

  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;

    int l = s.size();
    for (int j = 0; j < l; j++) as[s[j] - 'a'][j].set(i);

    if (maxl < l) maxl = l;

    gl.set(i);
  }

  if (maxl < n) {
    puts("NO");
    return 0;
  }
  
  for (int i = 0; i < 26; i++) {
    for (int j = 0; j <= maxl - n; j++) {
      bs b;
      int k;
      for (k = j; k < j + n && (~b & as[i][k]).any(); k++)
	b |= as[i][k];

      //printf("%c,j=%d: ", 'a' + i, j); cout << b << endl;

      if (k == j + n && b == gl) {
	puts("YES");
	return 0;
      }
    }
  }
  
  puts("NO");
  return 0;
}

Submission Info

Judge Result