oj.uz

답안 #971383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971383 2024-04-28T12:35:52 Z happy_node Misspelling (JOI22_misspelling) C++17
29 / 100
 802 ms 266700 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX=5e5+5, mod=1e9+7;
int N,M;

vector<pair<int,int>> open[MX], close[MX];

ll dp[MX][26], sdp[MX][26];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin>>N>>M;

	for(int i=0;i<M;i++) {
		int a,b;
		cin>>a>>b;

		if(a<b) {
			open[a].push_back({b,0}); // s_{i-1} > s{i}
			close[b].push_back({a,0});
		} else {
			// a > b
			open[b].push_back({a,1}); // s_{i-1} < s{i}
			close[a].push_back({b,1});
		}
	}

	for(int c=0;c<26;c++) dp[1][c]=1, sdp[1][c]=1;

	multiset<int> st[2];
	st[0].insert(0);
	st[1].insert(0);
	for(auto [j,t]:open[1]) st[t].insert(1);

	for(int i=2;i<=N;i++) {
		int p=*st[0].rbegin();
		int q=*st[1].rbegin();
		
		if(p<=q) {
			ll cur=0;
			for(int c=0;c<26;c++) {
				dp[i][c]+=cur;
				dp[i][c]%=mod;
				cur+=sdp[i-1][c];
				cur-=sdp[min(p,q)][c];
				cur+=mod;
				cur%=mod;
			}
		}

		if(p>=q) {
			ll cur=0;
			for(int c=25;c>=0;c--) {
				dp[i][c]+=cur;
				dp[i][c]%=mod;
				cur+=sdp[i-1][c];
				cur-=sdp[min(p,q)][c];
				cur+=mod;
				cur%=mod;
			}
		}

		for(int c=0;c<26;c++) {
			sdp[i][c]=sdp[i-1][c]+dp[i][c];
			sdp[i][c]%=mod;
		}
		
		for(auto [j,t]:open[i]) st[t].insert(i);
		for(auto [j,t]:close[i]) {
			st[t].erase(st[t].find(j));
		}
	}

	ll ans=0;
	for(int c=0;c<26;c++) {
		ans+=sdp[N][c];
		ans%=mod;
	}

	cout<<ans<<'\n';
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 20.0

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

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 26204 KB Output is correct
2 Correct 6 ms 25948 KB Output is correct
3 Correct 6 ms 25944 KB Output is correct
4 Correct 6 ms 25944 KB Output is correct
5 Correct 287 ms 265552 KB Output is correct
6 Correct 268 ms 265240 KB Output is correct
7 Correct 269 ms 265316 KB Output is correct
8 Correct 273 ms 265296 KB Output is correct
9 Correct 271 ms 265328 KB Output is correct
10 Correct 16 ms 35104 KB Output is correct
11 Correct 6 ms 26204 KB Output is correct
12 Correct 6 ms 25944 KB Output is correct
13 Correct 802 ms 266700 KB Output is correct

Subtask #4
0 / 32.0

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

Subtask #5
0 / 11.0

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