oj.uz

Submission #897033

# Submission time Handle Problem Language Result Execution time Memory
897033 2024-01-02T13:02:32 Z AndrijaM Forensic (NOI12_forensic) C++14
0 / 25
 316 ms 1084 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    vector<pair<int,int>>v;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        v.push_back({x,y});
    }
    int dp[n][5];
    memset(dp,0,sizeof dp);
    for(int i=v[0].first;i<=v[0].second;i++)
    {
        dp[0][i%5]++;
    }
    for(int i=1;i<n;i++)
    {
        for(int mod=0;mod<5;mod++)
        {
            for(int j=v[i].first;j<=v[i].second;j++)
            {
                dp[i][(mod+j)%5]+=dp[i-1][mod];
            }
        }
    }
   /*for(int i=0;i<n;i++)
    {
        for(int mod=0;mod<5;mod++)
        {
            cout<<dp[i][mod]<<" ";
        }
        cout<<endl;
    }*/
    cout<<4*(dp[n-1][1]+dp[n-1][4])+5*(dp[n-1][2]+dp[n-1][3])+dp[n-1][0]<<endl;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 984 KB Output is correct
2 Incorrect 316 ms 1084 KB Output isn't correct
3 Halted 0 ms 0 KB -