Submission #12895517


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














string S;
//---------------------------------------------------------------------------------------------------
bool check(string s, string t) {
	int ns = s.length();
	int nt = t.length();

	rep(i, 0, ns - nt + 1) {
		bool ok = true;
		rep(j, 0, nt) {
			if (t[j] == '.') continue;
			if (s[i + j] != t[j]) ok = false;
		}
		if (ok) return true;
	}

	return false;
}
//---------------------------------------------------------------------------------------------------
vector<string> Ts;
void dfs(int cu, string s) {
	if (0 < cu) Ts.push_back(s);
	if (cu == 3) return;

	rep(i, 0, 26) dfs(cu + 1, s + char('a' + i));
	dfs(cu + 1, s + ".");
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> S;

	dfs(0, "");

	int ans = 0;
	fore(T, Ts) if (check(S, T)) ans++;
	cout << ans << endl;
}





Submission Info

Submission Time
Task D - String Match
User hamayanhamayan
Language C++ (GCC 9.2.1)
Score 7
Code Size 2183 Byte
Status AC
Exec Time 17 ms
Memory 4284 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 7 / 7
Status
AC × 3
AC × 36
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 7 ms 4116 KB
02.txt AC 9 ms 4272 KB
03.txt AC 5 ms 4180 KB
04.txt AC 6 ms 4108 KB
05.txt AC 3 ms 4124 KB
06.txt AC 6 ms 4208 KB
07.txt AC 6 ms 4116 KB
08.txt AC 6 ms 4056 KB
09.txt AC 5 ms 4056 KB
10.txt AC 6 ms 4132 KB
11.txt AC 9 ms 4136 KB
12.txt AC 6 ms 4116 KB
13.txt AC 15 ms 4116 KB
14.txt AC 14 ms 4136 KB
15.txt AC 16 ms 4060 KB
16.txt AC 14 ms 4184 KB
17.txt AC 15 ms 4060 KB
18.txt AC 16 ms 4156 KB
19.txt AC 15 ms 4132 KB
20.txt AC 16 ms 4156 KB
21.txt AC 14 ms 4156 KB
22.txt AC 15 ms 4116 KB
23.txt AC 17 ms 4132 KB
24.txt AC 15 ms 4284 KB
25.txt AC 15 ms 4268 KB
26.txt AC 16 ms 4212 KB
27.txt AC 14 ms 4100 KB
28.txt AC 15 ms 4212 KB
29.txt AC 17 ms 4212 KB
30.txt AC 14 ms 4276 KB
31.txt AC 14 ms 4104 KB
32.txt AC 16 ms 4208 KB
33.txt AC 16 ms 4148 KB
s1.txt AC 7 ms 4180 KB
s2.txt AC 7 ms 4060 KB
s3.txt AC 5 ms 4136 KB