oj.uz

Submission #44256

# Submission time Handle Problem Language Result Execution time Memory
44256 2018-03-31T01:32:29 Z iletavcioski Calvinball championship (CEOI15_teams) C++17
10 / 100
 396 ms 928 KB 
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000007;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    int n;
    cin>>n;
    vector<ll> dp(n+1,0);
    vector<ll> dp2(n+1,0);
    dp[1]=2;
    ll broj=2;
    vector<ll> v;
    ll brojac=0;
    for(int i=0;i<n;i++)
    {
        ll a;
        cin>>a;
        v.push_back(a);
    }
    dp[1]=2;
    dp2[1]=2;
    for(int i=2;i<=n;i++)
    {
        broj++;
        broj%=mod;
        dp[i]=broj;
        dp[i]%=mod;
        dp2[i]=dp2[i-1]+broj;
        dp2[i]%=mod;
    }
    for(int i=n-1;i>=1;i--)
    {
        brojac+=dp2[v[i-1]-1];
        brojac%=mod;
        dp[1]=dp[1]+dp[2];
        dp[1]%=mod;
        dp2[1]=dp[1];
        broj=dp[1];
        for(int j=2;j<i;j++)
        {
            broj+=dp[j+1];
            broj%=mod;
            dp[j]=0;
            dp[j]=broj;
            dp[j]%=mod;
            dp2[j]=dp2[j-1]+dp[j];
            dp2[j]%=mod;
        }
    }
    brojac+=v[n-1];
    brojac%=mod;
    cout<<brojac<<endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 520 KB Output isn't correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 379 ms 928 KB Output isn't correct

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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