oj.uz

답안 #546643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546643 2022-04-07T23:02:24 Z inksamurai Misspelling (JOI22_misspelling) C++17
100 / 100
 1809 ms 415852 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3x2WzQf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
 
 
//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};
 
using mint=modint<1000'000'007>;
 
mint dp[30][2];
 
signed main(){
_3x2WzQf;
	int n,m;
	cin>>n>>m;
 
	vec(vi) qry(n,vi(2,-1));
	rep(i,m){
		int l,r;
		cin>>l>>r;
		l-=1,r-=1;
		bool type=0;
		if(l>r){
			swap(l,r);
			type=1;
		}
		qry[l][type]=max(qry[l][type],r);
	}
 
	using tup=tuple<int,int,ll>;
	deque<tup> dq0,dq1;
 
	per(ch,26){
		dp[ch][0]=1;
	}
	per(i,n-1){
		int r0=qry[i][0];
		int r1=qry[i][1];
		vec(vec(mint)) fdp(26,vec(mint)(2));
		rep(x,26){
			rep(y,26){
				if(x==y) continue;
				if(r0!=-1 and y>x) continue;
				if(r1!=-1 and y<x) continue;
				rep(t,2){
					int nt=(y>x?1:0);
					fdp[y][nt]+=dp[x][t];
				}
			}
		}
		rep(y,26){
			rep(nt,2){
				if(nt) dq1.pb({i,y,fdp[y][nt].x});
				else dq0.pb({i,y,fdp[y][nt].x});
				dp[y][nt]+=fdp[y][nt];
			}
		}
		while(sz(dq1)){
			auto &[j,ch,val]=dq1.back();
			if(j<r0){
				dp[ch][1]-=mint(val);
				dq1.pop_back();
			}else{
				break;
			}
		}
		while(sz(dq0)){
			auto &[j,ch,val]=dq0.back();
			if(j<r1){
				dp[ch][0]-=mint(val);
				dq0.pop_back();
			}else{
				break;
			}
		}
	}
 
	mint ans=0;
	rep(x,26){
		rep(t,2){
			ans+=dp[x][t];
		}
	}
 
	print(ans.x);
//	
	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 420 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1614 ms 27732 KB Output is correct
6 Correct 1629 ms 27732 KB Output is correct
7 Correct 1607 ms 27708 KB Output is correct
8 Correct 1602 ms 27724 KB Output is correct
9 Correct 1604 ms 27756 KB Output is correct
10 Correct 64 ms 1364 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1698 ms 28992 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 420 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 66 ms 1364 KB Output is correct
27 Correct 70 ms 9828 KB Output is correct
28 Correct 71 ms 9860 KB Output is correct
29 Correct 68 ms 2260 KB Output is correct
30 Correct 70 ms 2260 KB Output is correct
31 Correct 133 ms 2180 KB Output is correct
32 Correct 66 ms 1428 KB Output is correct
33 Correct 66 ms 1440 KB Output is correct
34 Correct 72 ms 1492 KB Output is correct
35 Correct 130 ms 1420 KB Output is correct
36 Correct 73 ms 17656 KB Output is correct
37 Correct 70 ms 1620 KB Output is correct
38 Correct 71 ms 1492 KB Output is correct
39 Correct 74 ms 1924 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 420 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1614 ms 27732 KB Output is correct
31 Correct 1629 ms 27732 KB Output is correct
32 Correct 1607 ms 27708 KB Output is correct
33 Correct 1602 ms 27724 KB Output is correct
34 Correct 1604 ms 27756 KB Output is correct
35 Correct 64 ms 1364 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1698 ms 28992 KB Output is correct
39 Correct 66 ms 1364 KB Output is correct
40 Correct 70 ms 9828 KB Output is correct
41 Correct 71 ms 9860 KB Output is correct
42 Correct 68 ms 2260 KB Output is correct
43 Correct 70 ms 2260 KB Output is correct
44 Correct 133 ms 2180 KB Output is correct
45 Correct 66 ms 1428 KB Output is correct
46 Correct 66 ms 1440 KB Output is correct
47 Correct 72 ms 1492 KB Output is correct
48 Correct 130 ms 1420 KB Output is correct
49 Correct 73 ms 17656 KB Output is correct
50 Correct 70 ms 1620 KB Output is correct
51 Correct 71 ms 1492 KB Output is correct
52 Correct 74 ms 1924 KB Output is correct
53 Correct 1700 ms 49168 KB Output is correct
54 Correct 1688 ms 240732 KB Output is correct
55 Correct 1689 ms 49024 KB Output is correct
56 Correct 1683 ms 49012 KB Output is correct
57 Correct 1589 ms 27728 KB Output is correct
58 Correct 1610 ms 27720 KB Output is correct
59 Correct 1595 ms 27720 KB Output is correct
60 Correct 1787 ms 28984 KB Output is correct
61 Correct 1809 ms 415852 KB Output is correct
62 Correct 1760 ms 29120 KB Output is correct
63 Correct 1784 ms 29248 KB Output is correct
64 Correct 1796 ms 29508 KB Output is correct