Submission #936563

#	Time	Username	Problem	Language	Result	Execution time	Memory
936563		TAhmed33	Misspelling (JOI22_misspelling)	C++98	28 / 100	4066 ms	57144 KiB

misspelling

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
const int MAXN = 5e5 + 25;
int dp[MAXN][27];
int n, m;
int type1[MAXN];
int type2[MAXN];
int ans (int pos, int c) {
	int &ret = dp[pos][c];
	if (ret != -1) return ret;
	if (pos == 1) return ret = 1;
	ret = 0;
	for (int j = 0; j < c; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			flag &= pos > type2[i];
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	for (int j = c + 1; j < 26; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			flag &= pos > type1[i];
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	return ret;
}
int main () {
	memset(dp, -1, sizeof(dp));
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		int l = min(a, b), r = max(a, b);
		if (a > b) {
			type1[l] = max(type1[l], r);
		} else {
			type2[l] = max(type2[l], r);
		}
	}
	int sum = 0;
	for (int i = 0; i < 26; i++) {
		for (int j = 1; j <= n; j++) {
			sum = add(sum, ans(j, i));
		}
	}
	cout << sum << '\n';
}

• Subtask 1: 8 / 8
• Subtask 2: 20 / 20
• Subtask 3: 0 / 29
• Subtask 4: 0 / 32
• Subtask 5: 0 / 11