oj.uz

답안 #845364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845364 2023-09-06T13:19:48 Z vjudge1 Trener (COCI20_trener) C++17
110 / 110
 115 ms 6480 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll LOGN = 20;
const ll MAXN = 3e5 + 5;

vector<vector<string>> play;
map<string,int> dp;

int main() {
	fast
	int N, K;
	cin >> N >> K;

	play = vector<vector<string>>(N+1, vector<string>());
	for (int i = 1; i <= N; i++) {
		for (int j = 0; j < K; j++) {
			string s;
			cin >> s;
			play[i].push_back(s);
		}
	}

	for (int i = 0; i < play[N].size(); i++) {
		string s1 = play[N][i];
		s1[0] = 'A';
		s1 = s1 + 'A';
		string s2 = play[N][i];
		s2[play[N][i].length() - 1] = 'A';
		s2 = 'A' + s2;
		dp[s1]++;
		if (s1 != s2)
			dp[s2]++;
	}

	for (int i = N-1; i >= 1; i--) {
		map<string,int> new_dp;
		for (int s1 = 0; s1 < play[i].size(); s1++) {
			string str1 = play[i][s1];
			str1 = 'A' + str1 + 'A';


			string ns1 = play[i][s1];
			string ns2 = play[i][s1];
			ns1[0] = 'A';
			ns1 = ns1 + 'A';
			ns2[i - 1] = 'A';
			ns2 = 'A' + ns2;
			new_dp[ns1] = (new_dp[ns1] + dp[str1]) % MOD;
			if (ns1 != ns2)
				new_dp[ns2] = (new_dp[ns2] + dp[str1]) % MOD;
		}
		dp = new_dp;
	}

	int ans = 0;
	for (auto u : dp)
		ans = (ans + u.s) % MOD;
	cout << ans << "\n";
}

Compilation message

trener.cpp: In function 'int main()':
trener.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i = 0; i < play[N].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~
trener.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for (int s1 = 0; s1 < play[i].size(); s1++) {
      |                    ~~~^~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 856 KB Output is correct
2 Correct 6 ms 856 KB Output is correct
3 Correct 6 ms 856 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 2 ms 600 KB Output is correct

Subtask #3
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 6 ms 856 KB Output is correct
7 Correct 6 ms 856 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 5 ms 856 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 115 ms 6480 KB Output is correct
13 Correct 111 ms 6356 KB Output is correct
14 Correct 109 ms 6352 KB Output is correct
15 Correct 114 ms 6356 KB Output is correct
16 Correct 26 ms 5464 KB Output is correct
17 Correct 94 ms 6160 KB Output is correct
18 Correct 92 ms 6224 KB Output is correct
19 Correct 93 ms 5976 KB Output is correct
20 Correct 93 ms 6220 KB Output is correct
21 Correct 98 ms 6224 KB Output is correct
22 Correct 27 ms 5464 KB Output is correct