oj.uz

Submission #424619

# Submission time Handle Problem Language Result Execution time Memory
424619 2021-06-12T08:10:01 Z Blistering_Barnacles Fibonacci representations (CEOI18_fib) C++11
0 / 100
 24 ms 26828 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[19][100005], a[555555] , fib[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
ll sum = 0 ;
ll mem(ll i , ll sm){
    if(sm > sum)R 0 ;
    if(i > 15){
        if(sum != sm)R 0 ;
        R 1 ;
    }
    R (mem(i + 1 , sm) + mem(i + 1 , sm + fib[i])) % mod ;
}
void solve(){
    cin >> n ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
    }
    //reverse(a + 1 , a + n + 1) ;
    fib[1] = 1 , fib[2] = 2 ;
    //ll sum = 1 ;
    for(ll i = 3 ; i <= 15 ; i++){
        fib[i] = fib[i - 1] + fib[i - 2] ;
        //cerr << fib[i] << endl ;
    }
    sum = 0 ;
    for(ll i = 1 ; i <= n ; i++){
        sum += fib[a[i]] ;
        cout << mem(1 , 0) << endl ;
    }
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 26828 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 8 ms 13260 KB Output is correct
2 Incorrect 11 ms 13260 KB Output isn't correct
3 Halted 0 ms 0 KB -