oj.uz

Submission #927715

# Submission time Handle Problem Language Result Execution time Memory
927715 2024-02-15T09:17:04 Z andrei_boaca Misspelling (JOI22_misspelling) C++17
28 / 100
 4000 ms 305988 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int mod=1e9+7;
int n,m;
int lastmare[500005],lastmic[500005];
ll dp[3][27][500005]; /// 0 -> egal, 1 -> mai mic, 2 -> mai mare
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        if(a<b)
            lastmic[a]=max(lastmic[a],b);
        if(a>b)
            lastmare[b]=max(lastmare[b],a);
    }
    for(int i=1;i<=26;i++)
        dp[2][i][1]=1;
    for(int i=2;i<=n;i++)
    {
        int pmare=i,pmic=i;
        /// mai mare
        for(int j=i-1;j>=1;j--)
        {
            if(lastmic[j]>=i)
                break;
            pmare=j;
        }
        /// mai mic
        for(int j=i-1;j>=1;j--)
        {
            if(lastmare[j]>=i)
                break;
            pmic=j;
        }
        for(int c=1;c<=26;c++)
        {
            dp[0][c][i]=(1LL*(dp[0][c][i-1]+dp[1][c][i-1]+dp[2][c][i-1]))%mod;
            for(int j=i-1;j>=pmic;j--)
                for(int prv=1;prv<c;prv++)
                {
                    int val=(dp[1][prv][j]+dp[2][prv][j])%mod;
                    dp[1][c][i]=(dp[1][c][i]+val)%mod;
                }
            for(int j=i-1;j>=pmare;j--)
                for(int prv=c+1;prv<=26;prv++)
                {
                    int val=(dp[1][prv][j]+dp[2][prv][j])%mod;
                    dp[2][c][i]=(dp[2][c][i]+val)%mod;
                }
        }
    }
    int ans=0;
    for(int c=1;c<=26;c++)
    {
        ans=(ans+dp[0][c][n])%mod;
        ans=(ans+dp[1][c][n])%mod;
        ans=(ans+dp[2][c][n])%mod;
    }
    cout<<ans;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 54108 KB Output is correct
2 Correct 7 ms 54044 KB Output is correct
3 Correct 6 ms 54108 KB Output is correct
4 Correct 6 ms 54108 KB Output is correct
5 Correct 6 ms 54108 KB Output is correct
6 Correct 6 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 6 ms 54108 KB Output is correct
10 Correct 6 ms 54108 KB Output is correct
11 Correct 6 ms 54108 KB Output is correct
12 Correct 6 ms 54108 KB Output is correct
13 Correct 6 ms 54108 KB Output is correct
14 Correct 6 ms 54108 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 54108 KB Output is correct
2 Correct 7 ms 54044 KB Output is correct
3 Correct 6 ms 54108 KB Output is correct
4 Correct 6 ms 54108 KB Output is correct
5 Correct 6 ms 54108 KB Output is correct
6 Correct 6 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 6 ms 54108 KB Output is correct
10 Correct 6 ms 54108 KB Output is correct
11 Correct 6 ms 54108 KB Output is correct
12 Correct 6 ms 54108 KB Output is correct
13 Correct 6 ms 54108 KB Output is correct
14 Correct 6 ms 54108 KB Output is correct
15 Correct 33 ms 54108 KB Output is correct
16 Correct 17 ms 54108 KB Output is correct
17 Correct 11 ms 54108 KB Output is correct
18 Correct 7 ms 54108 KB Output is correct
19 Correct 10 ms 54260 KB Output is correct
20 Correct 9 ms 54364 KB Output is correct
21 Correct 9 ms 54104 KB Output is correct
22 Correct 7 ms 54364 KB Output is correct
23 Correct 58 ms 54108 KB Output is correct
24 Correct 12 ms 54108 KB Output is correct
25 Correct 7 ms 54108 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 54104 KB Output is correct
2 Correct 6 ms 54104 KB Output is correct
3 Correct 7 ms 54108 KB Output is correct
4 Correct 6 ms 54104 KB Output is correct
5 Correct 3490 ms 305988 KB Output is correct
6 Execution timed out 4054 ms 253400 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 54108 KB Output is correct
2 Correct 7 ms 54044 KB Output is correct
3 Correct 6 ms 54108 KB Output is correct
4 Correct 6 ms 54108 KB Output is correct
5 Correct 6 ms 54108 KB Output is correct
6 Correct 6 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 6 ms 54108 KB Output is correct
10 Correct 6 ms 54108 KB Output is correct
11 Correct 6 ms 54108 KB Output is correct
12 Correct 6 ms 54108 KB Output is correct
13 Correct 6 ms 54108 KB Output is correct
14 Correct 6 ms 54108 KB Output is correct
15 Correct 33 ms 54108 KB Output is correct
16 Correct 17 ms 54108 KB Output is correct
17 Correct 11 ms 54108 KB Output is correct
18 Correct 7 ms 54108 KB Output is correct
19 Correct 10 ms 54260 KB Output is correct
20 Correct 9 ms 54364 KB Output is correct
21 Correct 9 ms 54104 KB Output is correct
22 Correct 7 ms 54364 KB Output is correct
23 Correct 58 ms 54108 KB Output is correct
24 Correct 12 ms 54108 KB Output is correct
25 Correct 7 ms 54108 KB Output is correct
26 Correct 63 ms 66640 KB Output is correct
27 Execution timed out 4070 ms 55428 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 54108 KB Output is correct
2 Correct 7 ms 54044 KB Output is correct
3 Correct 6 ms 54108 KB Output is correct
4 Correct 6 ms 54108 KB Output is correct
5 Correct 6 ms 54108 KB Output is correct
6 Correct 6 ms 54108 KB Output is correct
7 Correct 7 ms 54108 KB Output is correct
8 Correct 7 ms 54108 KB Output is correct
9 Correct 6 ms 54108 KB Output is correct
10 Correct 6 ms 54108 KB Output is correct
11 Correct 6 ms 54108 KB Output is correct
12 Correct 6 ms 54108 KB Output is correct
13 Correct 6 ms 54108 KB Output is correct
14 Correct 6 ms 54108 KB Output is correct
15 Correct 33 ms 54108 KB Output is correct
16 Correct 17 ms 54108 KB Output is correct
17 Correct 11 ms 54108 KB Output is correct
18 Correct 7 ms 54108 KB Output is correct
19 Correct 10 ms 54260 KB Output is correct
20 Correct 9 ms 54364 KB Output is correct
21 Correct 9 ms 54104 KB Output is correct
22 Correct 7 ms 54364 KB Output is correct
23 Correct 58 ms 54108 KB Output is correct
24 Correct 12 ms 54108 KB Output is correct
25 Correct 7 ms 54108 KB Output is correct
26 Correct 6 ms 54104 KB Output is correct
27 Correct 6 ms 54104 KB Output is correct
28 Correct 7 ms 54108 KB Output is correct
29 Correct 6 ms 54104 KB Output is correct
30 Correct 3490 ms 305988 KB Output is correct
31 Execution timed out 4054 ms 253400 KB Time limit exceeded
32 Halted 0 ms 0 KB -