oj.uz

Submission #814885

# Submission time Handle Problem Language Result Execution time Memory
814885 2023-08-08T10:54:45 Z groshi Misspelling (JOI22_misspelling) C++17
100 / 100
 750 ms 160424 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int> mniej[600000],wiecej[600000];
int dp[600000][26];
int mod=1e9+7;
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n,m,x,y;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        if(x<y)
            mniej[x].push_back(y);
        else wiecej[y].push_back(x);
    }
    for(int i=0;i<26;i++)
        dp[1][i]=1;
    priority_queue<pair<int,int> > mnieej,wieecej;
    for(int i=2;i<=n;i++)
    {
        for(int j=0;j<mniej[i-1].size();j++)
            mnieej.push({i-1,mniej[i-1][j]});
        for(int j=0;j<wiecej[i-1].size();j++)
            wieecej.push({i-1,wiecej[i-1][j]});
        while(mnieej.size() && mnieej.top().second<i)
            mnieej.pop();
        while(wieecej.size() && wieecej.top().second<i)
            wieecej.pop();
        int gosciu=0;
        if(mnieej.size())
            gosciu=mnieej.top().first;
        //cout<<gosciu<<"\n";
        int suma=0;
        for(int j=1;j<26;j++)
        {
            suma-=dp[gosciu][j-1];
            suma+=dp[i-1][j-1];
            suma+=mod;
            suma%=mod;
            dp[i][j]+=suma;
            dp[i][j]+=mod*mod;
            dp[i][j]%=mod;
        }
        /*for(int j=0;j<26;j++)
            cout<<dp[i][j]<<" ";
        cout<<"\n";*/
        if(wieecej.size())
            gosciu=wieecej.top().first;
        else gosciu=0;
        //cout<<gosciu<<"\n";
        suma=0;
        for(int j=24;j>=0;j--)
        {
            suma-=dp[gosciu][j+1];
            suma+=dp[i-1][j+1];
            suma+=mod;
            suma%=mod;
            dp[i][j]+=suma;
            dp[i][j]+=mod*mod;
            dp[i][j]%=mod;
        }
        for(int j=0;j<26;j++)
            dp[i][j]+=dp[i-1][j],dp[i][j]%=mod;
        /*for(int j=0;j<26;j++)
            cout<<dp[i][j]<<" ";
        cout<<"\n";*/
    }
    int wynik=0;
    for(int i=0;i<26;i++)
    {
        wynik+=dp[n][i];
        wynik%=mod;
    }
    cout<<wynik;
    return 0;
}

Compilation message

misspelling.cpp: In function 'int32_t main()':
misspelling.cpp:26:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for(int j=0;j<mniej[i-1].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~~
misspelling.cpp:28:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for(int j=0;j<wiecej[i-1].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 15 ms 28564 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28448 KB Output is correct
5 Correct 16 ms 28504 KB Output is correct
6 Correct 15 ms 28472 KB Output is correct
7 Correct 16 ms 28508 KB Output is correct
8 Correct 15 ms 28500 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 15 ms 28500 KB Output is correct
12 Correct 15 ms 28508 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 14 ms 28396 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 15 ms 28564 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28448 KB Output is correct
5 Correct 16 ms 28504 KB Output is correct
6 Correct 15 ms 28472 KB Output is correct
7 Correct 16 ms 28508 KB Output is correct
8 Correct 15 ms 28500 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 15 ms 28500 KB Output is correct
12 Correct 15 ms 28508 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 14 ms 28396 KB Output is correct
15 Correct 15 ms 28520 KB Output is correct
16 Correct 16 ms 28500 KB Output is correct
17 Correct 16 ms 28500 KB Output is correct
18 Correct 17 ms 28500 KB Output is correct
19 Correct 16 ms 28512 KB Output is correct
20 Correct 16 ms 28508 KB Output is correct
21 Correct 15 ms 28512 KB Output is correct
22 Correct 17 ms 29036 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 17 ms 28504 KB Output is correct
25 Correct 15 ms 28500 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28420 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 15 ms 28500 KB Output is correct
5 Correct 581 ms 159596 KB Output is correct
6 Correct 580 ms 159444 KB Output is correct
7 Correct 574 ms 159268 KB Output is correct
8 Correct 577 ms 159960 KB Output is correct
9 Correct 575 ms 158836 KB Output is correct
10 Correct 38 ms 33876 KB Output is correct
11 Correct 16 ms 28500 KB Output is correct
12 Correct 15 ms 28500 KB Output is correct
13 Correct 666 ms 160424 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 15 ms 28564 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28448 KB Output is correct
5 Correct 16 ms 28504 KB Output is correct
6 Correct 15 ms 28472 KB Output is correct
7 Correct 16 ms 28508 KB Output is correct
8 Correct 15 ms 28500 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 15 ms 28500 KB Output is correct
12 Correct 15 ms 28508 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 14 ms 28396 KB Output is correct
15 Correct 15 ms 28520 KB Output is correct
16 Correct 16 ms 28500 KB Output is correct
17 Correct 16 ms 28500 KB Output is correct
18 Correct 17 ms 28500 KB Output is correct
19 Correct 16 ms 28512 KB Output is correct
20 Correct 16 ms 28508 KB Output is correct
21 Correct 15 ms 28512 KB Output is correct
22 Correct 17 ms 29036 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 17 ms 28504 KB Output is correct
25 Correct 15 ms 28500 KB Output is correct
26 Correct 37 ms 33868 KB Output is correct
27 Correct 34 ms 33224 KB Output is correct
28 Correct 39 ms 33224 KB Output is correct
29 Correct 38 ms 33868 KB Output is correct
30 Correct 36 ms 33848 KB Output is correct
31 Correct 163 ms 52540 KB Output is correct
32 Correct 38 ms 33612 KB Output is correct
33 Correct 37 ms 33628 KB Output is correct
34 Correct 39 ms 33708 KB Output is correct
35 Correct 141 ms 52916 KB Output is correct
36 Correct 33 ms 32456 KB Output is correct
37 Correct 37 ms 33344 KB Output is correct
38 Correct 40 ms 33144 KB Output is correct
39 Correct 34 ms 32892 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 15 ms 28564 KB Output is correct
3 Correct 15 ms 28500 KB Output is correct
4 Correct 15 ms 28448 KB Output is correct
5 Correct 16 ms 28504 KB Output is correct
6 Correct 15 ms 28472 KB Output is correct
7 Correct 16 ms 28508 KB Output is correct
8 Correct 15 ms 28500 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 15 ms 28500 KB Output is correct
11 Correct 15 ms 28500 KB Output is correct
12 Correct 15 ms 28508 KB Output is correct
13 Correct 15 ms 28492 KB Output is correct
14 Correct 14 ms 28396 KB Output is correct
15 Correct 15 ms 28520 KB Output is correct
16 Correct 16 ms 28500 KB Output is correct
17 Correct 16 ms 28500 KB Output is correct
18 Correct 17 ms 28500 KB Output is correct
19 Correct 16 ms 28512 KB Output is correct
20 Correct 16 ms 28508 KB Output is correct
21 Correct 15 ms 28512 KB Output is correct
22 Correct 17 ms 29036 KB Output is correct
23 Correct 15 ms 28500 KB Output is correct
24 Correct 17 ms 28504 KB Output is correct
25 Correct 15 ms 28500 KB Output is correct
26 Correct 16 ms 28420 KB Output is correct
27 Correct 15 ms 28500 KB Output is correct
28 Correct 15 ms 28508 KB Output is correct
29 Correct 15 ms 28500 KB Output is correct
30 Correct 581 ms 159596 KB Output is correct
31 Correct 580 ms 159444 KB Output is correct
32 Correct 574 ms 159268 KB Output is correct
33 Correct 577 ms 159960 KB Output is correct
34 Correct 575 ms 158836 KB Output is correct
35 Correct 38 ms 33876 KB Output is correct
36 Correct 16 ms 28500 KB Output is correct
37 Correct 15 ms 28500 KB Output is correct
38 Correct 666 ms 160424 KB Output is correct
39 Correct 37 ms 33868 KB Output is correct
40 Correct 34 ms 33224 KB Output is correct
41 Correct 39 ms 33224 KB Output is correct
42 Correct 38 ms 33868 KB Output is correct
43 Correct 36 ms 33848 KB Output is correct
44 Correct 163 ms 52540 KB Output is correct
45 Correct 38 ms 33612 KB Output is correct
46 Correct 37 ms 33628 KB Output is correct
47 Correct 39 ms 33708 KB Output is correct
48 Correct 141 ms 52916 KB Output is correct
49 Correct 33 ms 32456 KB Output is correct
50 Correct 37 ms 33344 KB Output is correct
51 Correct 40 ms 33144 KB Output is correct
52 Correct 34 ms 32892 KB Output is correct
53 Correct 511 ms 145488 KB Output is correct
54 Correct 520 ms 145456 KB Output is correct
55 Correct 624 ms 158816 KB Output is correct
56 Correct 618 ms 159016 KB Output is correct
57 Correct 571 ms 158892 KB Output is correct
58 Correct 590 ms 156928 KB Output is correct
59 Correct 567 ms 159288 KB Output is correct
60 Correct 750 ms 156720 KB Output is correct
61 Correct 448 ms 130204 KB Output is correct
62 Correct 652 ms 150800 KB Output is correct
63 Correct 579 ms 144256 KB Output is correct
64 Correct 536 ms 137520 KB Output is correct