oj.uz

답안 #966634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966634 2024-04-20T07:18:24 Z angella Misspelling (JOI22_misspelling) C++17
100 / 100
 392 ms 324396 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 5e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll n, m, a[N], rmn[N], rmx[N], dp[27][N], pr[27][N], pr2[27][N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>m;
    for(ll v,u,i=1; i<=m; i++) {
        cin>>v>>u;
        if(v<u) rmx[v] = max(rmx[v], u);
        else rmn[u] = max(rmn[u], v);
    }

    vector<int> smn={1}, smx={1};
    for(int i=1; i<=26; i++) dp[i][1]=pr2[i][1]=1, pr[i][1]=i;
    

    for(int i=2; i<=n; i++) {
        while(size(smx)>0&&rmx[smx.back()]<i) smx.pop_back();
        while(size(smn)>0&&rmn[smn.back()]<i) smn.pop_back();
        int mx=(size(smx)==0?0:smx.back());
        int mn=(size(smn)==0?0:smn.back());
        if(mn >= mx) {
            for(int j=1; j<=26; j++) {
dp[j][i] = MOD(pr[26][i-1]-pr[26][mn]-(pr2[j][i-1]-pr2[j][mn])+
pr[26][mn]-pr[26][mx]-(pr[j][mn]-pr[j][mx]));
            }
        } else {
            for(int j=1; j<=26; j++) {
dp[j][i] = MOD(pr[26][i-1]-pr[26][mx]-(pr2[j][i-1]-pr2[j][mx])+
(pr[j-1][mx]-pr[j-1][mn]));
            }
        }
        for(int j=1; j<=26; j++) {
            pr2[j][i] = MOD(pr2[j][i-1] + dp[j][i]);
            pr[j][i] = MOD(pr2[j][i] + pr[j-1][i]);
        }
        while(size(smx)>0&&rmx[smx.back()]<=rmx[i]) smx.pop_back();
        smx.pb(i);
        while(size(smn)>0&&rmn[smn.back()]<=rmn[i]) smn.pop_back();
        smn.pb(i);
    }

    cout<<pr[26][n]<<endl;

	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 64348 KB Output is correct
2 Correct 7 ms 64348 KB Output is correct
3 Correct 8 ms 66296 KB Output is correct
4 Correct 7 ms 64344 KB Output is correct
5 Correct 8 ms 64344 KB Output is correct
6 Correct 7 ms 66396 KB Output is correct
7 Correct 7 ms 64344 KB Output is correct
8 Correct 7 ms 66396 KB Output is correct
9 Correct 7 ms 66396 KB Output is correct
10 Correct 7 ms 64348 KB Output is correct
11 Correct 7 ms 66288 KB Output is correct
12 Correct 7 ms 64460 KB Output is correct
13 Correct 7 ms 64348 KB Output is correct
14 Correct 8 ms 66396 KB Output is correct
15 Correct 8 ms 64348 KB Output is correct
16 Correct 8 ms 64492 KB Output is correct
17 Correct 7 ms 66396 KB Output is correct
18 Correct 8 ms 64348 KB Output is correct
19 Correct 7 ms 66396 KB Output is correct
20 Correct 8 ms 66540 KB Output is correct
21 Correct 8 ms 66364 KB Output is correct
22 Correct 9 ms 64604 KB Output is correct
23 Correct 7 ms 66396 KB Output is correct
24 Correct 7 ms 64348 KB Output is correct
25 Correct 7 ms 64348 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 64348 KB Output is correct
2 Correct 7 ms 64348 KB Output is correct
3 Correct 7 ms 64464 KB Output is correct
4 Correct 8 ms 64600 KB Output is correct
5 Correct 384 ms 324056 KB Output is correct
6 Correct 392 ms 324176 KB Output is correct
7 Correct 331 ms 324176 KB Output is correct
8 Correct 327 ms 324180 KB Output is correct
9 Correct 326 ms 324180 KB Output is correct
10 Correct 22 ms 95312 KB Output is correct
11 Correct 10 ms 90972 KB Output is correct
12 Correct 10 ms 90972 KB Output is correct
13 Correct 336 ms 324396 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 64348 KB Output is correct
2 Correct 7 ms 64348 KB Output is correct
3 Correct 8 ms 66296 KB Output is correct
4 Correct 7 ms 64344 KB Output is correct
5 Correct 8 ms 64344 KB Output is correct
6 Correct 7 ms 66396 KB Output is correct
7 Correct 7 ms 64344 KB Output is correct
8 Correct 7 ms 66396 KB Output is correct
9 Correct 7 ms 66396 KB Output is correct
10 Correct 7 ms 64348 KB Output is correct
11 Correct 7 ms 66288 KB Output is correct
12 Correct 7 ms 64460 KB Output is correct
13 Correct 7 ms 64348 KB Output is correct
14 Correct 8 ms 66396 KB Output is correct
15 Correct 8 ms 64348 KB Output is correct
16 Correct 8 ms 64492 KB Output is correct
17 Correct 7 ms 66396 KB Output is correct
18 Correct 8 ms 64348 KB Output is correct
19 Correct 7 ms 66396 KB Output is correct
20 Correct 8 ms 66540 KB Output is correct
21 Correct 8 ms 66364 KB Output is correct
22 Correct 9 ms 64604 KB Output is correct
23 Correct 7 ms 66396 KB Output is correct
24 Correct 7 ms 64348 KB Output is correct
25 Correct 7 ms 64348 KB Output is correct
26 Correct 22 ms 97108 KB Output is correct
27 Correct 20 ms 95056 KB Output is correct
28 Correct 21 ms 96900 KB Output is correct
29 Correct 24 ms 97116 KB Output is correct
30 Correct 24 ms 97104 KB Output is correct
31 Correct 75 ms 102344 KB Output is correct
32 Correct 21 ms 95324 KB Output is correct
33 Correct 22 ms 97040 KB Output is correct
34 Correct 21 ms 97104 KB Output is correct
35 Correct 89 ms 102224 KB Output is correct
36 Correct 20 ms 94560 KB Output is correct
37 Correct 21 ms 95060 KB Output is correct
38 Correct 20 ms 96848 KB Output is correct
39 Correct 20 ms 96848 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 64348 KB Output is correct
2 Correct 7 ms 64348 KB Output is correct
3 Correct 8 ms 66296 KB Output is correct
4 Correct 7 ms 64344 KB Output is correct
5 Correct 8 ms 64344 KB Output is correct
6 Correct 7 ms 66396 KB Output is correct
7 Correct 7 ms 64344 KB Output is correct
8 Correct 7 ms 66396 KB Output is correct
9 Correct 7 ms 66396 KB Output is correct
10 Correct 7 ms 64348 KB Output is correct
11 Correct 7 ms 66288 KB Output is correct
12 Correct 7 ms 64460 KB Output is correct
13 Correct 7 ms 64348 KB Output is correct
14 Correct 8 ms 66396 KB Output is correct
15 Correct 8 ms 64348 KB Output is correct
16 Correct 8 ms 64492 KB Output is correct
17 Correct 7 ms 66396 KB Output is correct
18 Correct 8 ms 64348 KB Output is correct
19 Correct 7 ms 66396 KB Output is correct
20 Correct 8 ms 66540 KB Output is correct
21 Correct 8 ms 66364 KB Output is correct
22 Correct 9 ms 64604 KB Output is correct
23 Correct 7 ms 66396 KB Output is correct
24 Correct 7 ms 64348 KB Output is correct
25 Correct 7 ms 64348 KB Output is correct
26 Correct 7 ms 64348 KB Output is correct
27 Correct 7 ms 64348 KB Output is correct
28 Correct 7 ms 64464 KB Output is correct
29 Correct 8 ms 64600 KB Output is correct
30 Correct 384 ms 324056 KB Output is correct
31 Correct 392 ms 324176 KB Output is correct
32 Correct 331 ms 324176 KB Output is correct
33 Correct 327 ms 324180 KB Output is correct
34 Correct 326 ms 324180 KB Output is correct
35 Correct 22 ms 95312 KB Output is correct
36 Correct 10 ms 90972 KB Output is correct
37 Correct 10 ms 90972 KB Output is correct
38 Correct 336 ms 324396 KB Output is correct
39 Correct 22 ms 97108 KB Output is correct
40 Correct 20 ms 95056 KB Output is correct
41 Correct 21 ms 96900 KB Output is correct
42 Correct 24 ms 97116 KB Output is correct
43 Correct 24 ms 97104 KB Output is correct
44 Correct 75 ms 102344 KB Output is correct
45 Correct 21 ms 95324 KB Output is correct
46 Correct 22 ms 97040 KB Output is correct
47 Correct 21 ms 97104 KB Output is correct
48 Correct 89 ms 102224 KB Output is correct
49 Correct 20 ms 94560 KB Output is correct
50 Correct 21 ms 95060 KB Output is correct
51 Correct 20 ms 96848 KB Output is correct
52 Correct 20 ms 96848 KB Output is correct
53 Correct 290 ms 318088 KB Output is correct
54 Correct 295 ms 316880 KB Output is correct
55 Correct 322 ms 323668 KB Output is correct
56 Correct 318 ms 323664 KB Output is correct
57 Correct 335 ms 324072 KB Output is correct
58 Correct 331 ms 324176 KB Output is correct
59 Correct 320 ms 324232 KB Output is correct
60 Correct 344 ms 324048 KB Output is correct
61 Correct 263 ms 309808 KB Output is correct
62 Correct 326 ms 322500 KB Output is correct
63 Correct 298 ms 320916 KB Output is correct
64 Correct 286 ms 319284 KB Output is correct