oj.uz

답안 #567749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567749 2022-05-24T06:36:54 Z maomao90 Copy and Paste 3 (JOI22_copypaste3) C++17
0 / 100
 3000 ms 43508 KB 
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < k; i++)
#define RREP(i, j, k) for (int i = j; i >= k; i--)

template <class T>
bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;

#ifndef DEBUG
#define cerr if(0) cerr
#endif

const int MAXN = 2505;
const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MOD[2] = {1000000007, 998244353};
const int X[2] = {29, 31};

int n;
string s;
int a, b, c;
int hsh[2][MAXN][MAXN];
int nxt[MAXN][MAXN];
ll dp[MAXN][MAXN];
unordered_map<ll, int> mp;

int main() {
#ifndef DEBUG
	ios::sync_with_stdio(0), cin.tie(0);
#endif
	cin >> n;
	cin >> s;
	cin >> a >> b >> c;
	REP (z, 0, 2) {
		REP (i, 0, n) {
			hsh[z][i][0] = 0;
			REP (j, 1, n + 1 - i) {
				hsh[z][i][j] = (ll) hsh[z][i][j - 1] * X[z] % MOD[z] + 
					(s[i + j - 1] - 'a' + 1);
				if (hsh[z][i][j] >= MOD[z]) {
					hsh[z][i][j] -= MOD[z];
				}
			}
		}
	}
	REP (l, 1, n + 1) {
		mp.clear();
		RREP (i, n - l, 0) {
			if (i + l <= n - l) {
				ll x = (ll) hsh[0][i + l][l] * MOD[1] + hsh[1][i + l][l];
				mp[x] = i + l;
			}
			ll x = (ll) hsh[0][i][l] * MOD[1] + hsh[1][i][l];
			if (mp.find(x) == mp.end()) {
				nxt[l][i] = n;
			} else {
				nxt[l][i] = mp[x];
			}
		}
	}
	RREP (i, n - 1, 0) {
		REP (j, i, n) {
			dp[i][j] = dp[i + 1][j] + a;
			REP (k, i, j) {
				ll cost = dp[i][k] + b;
				int len = k - i + 1;
				bool gpos = 1;
				{
					int l = j - len + 1;
					REP (m, 0, len) {
						if (s[i + m] != s[l + m]) {
							gpos = 0;
							break;
						}
					}
				}
				if (!gpos) {
					continue;
				}
				REP (l, i, j + 1) {
					bool pos = 1;
					if (l + len - 1 <= j) {
						REP (m, 0, len) {
							if (s[i + m] != s[l + m]) {
								pos = 0;
								break;
							}
						}
					} else {
						pos = 0;
					}
					if (pos) {
						l += len - 1;
						cost += c;
					} else {
						cost += a;
					}
				}
				mnto(dp[i][j], cost);
			}
			cerr << i << ' ' << j << ": " << dp[i][j] << '\n';
		}
	}
	cout << dp[0][n - 1] << '\n';
	return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Execution timed out 3090 ms 43508 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -