oj.uz

Submission #1072731

# Submission time Handle Problem Language Result Execution time Memory
1072731 2024-08-24T03:35:33 Z 12345678 Fibonacci representations (CEOI18_fib) C++17
25 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=105, mod=1e9+7;

#define ll long long

ll n, a[nx], dp[nx][2], lst, cur, sz;
set<ll> s;

void add(ll x)
{
    if (x!=1&&s.find(x-1)!=s.end()) s.erase(x-1), add(x+1);
    else if (s.find(x+1)!=s.end()) s.erase(x+1), add(x+2);
    else if (s.find(x)!=s.end())
    {
        if (x==1) s.erase(x), add(2);
        else if (x==2) s.erase(x), add(1), add(3);
        else s.erase(x), add(x-2), add(x+1);
    }
    else s.insert(x);
}

ll cost(ll x, ll y)
{
    return (y-x-1)/2;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    s.insert(0);
    dp[0][0]=1;
    for (int i=1; i<=n; i++)
    {
        cin>>a[i];
        add(a[i]);
        /*
        cout<<"set ";
        for (auto x:s) cout<<x<<' ';
        cout<<'\n';
        */
        auto itr=s.begin();
        sz=s.size()-1;
        for (int j=1; j<=sz; j++)
        {
            lst=*(itr++);
            cur=*itr;
            dp[j][0]=(dp[j-1][0]+dp[j-1][1])%mod;
            dp[j][1]=(dp[j-1][0]*cost(lst, cur)+dp[j-1][1]*cost(lst-1, cur));
            //cout<<"cur "<<cur<<' '<<dp[j][0]<<' '<<dp[j][1]<<'\n';
        }
        cout<<(dp[sz][0]+dp[sz][1])%mod<<'\n';
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -