답안 #223209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223209 2020-04-15T05:17:05 Z oolimry Trener (COCI20_trener) C++14
55 / 110
2000 ms 26568 KB
#include <bits/stdc++.h>

using namespace std;
long long mod = 1000000007;

unordered_map<string, long long> m;
unordered_map<string, long long> mm;

void prop(string s, long long x){
	//cout << s << " " << x << "\n";
	if(x == 0) return;
	for(char c = 'a';c <= 'z';c++){
		//cout << s+c << " " << c+s << "\n";
		mm[s+c] += x;
		if(s + c != c + s) mm[c+s] += x;
		while(mm[c+s] >= mod) mm[c+s] -= mod;
	}
}

int main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, k; cin >> n >> k;
	
	if(n == 1){
		cout << k;
		return 0;
	}
	
	for(int j = 0;j < k;j++){
		string s; cin >> s;
		prop(s, 1);
	}
	
	for(int i = 2;i <= n-1;i++){
		swap(m, mm);
		mm.clear();
		for(int j = 0;j < k;j++){
			string s; cin >> s;
			prop(s, m[s]);
		}
	}
	
	long long ans = 0;
	for(int j = 0;j < k;j++){
		string s; cin >> s;
		ans += mm[s];
	}
	
	ans %= mod;
	cout << ans;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 1792 KB Output is correct
2 Correct 75 ms 2168 KB Output is correct
3 Correct 75 ms 2040 KB Output is correct
4 Correct 81 ms 632 KB Output is correct
5 Correct 79 ms 1784 KB Output is correct
6 Correct 94 ms 1932 KB Output is correct
7 Correct 77 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 72 ms 1792 KB Output is correct
6 Correct 75 ms 2168 KB Output is correct
7 Correct 75 ms 2040 KB Output is correct
8 Correct 81 ms 632 KB Output is correct
9 Correct 79 ms 1784 KB Output is correct
10 Correct 94 ms 1932 KB Output is correct
11 Correct 77 ms 384 KB Output is correct
12 Execution timed out 2019 ms 26568 KB Time limit exceeded
13 Halted 0 ms 0 KB -