oj.uz

Submission #424648

# Submission time Handle Problem Language Result Execution time Memory
424648 2021-06-12T08:34:41 Z Blistering_Barnacles Fibonacci representations (CEOI18_fib) C++11
5 / 100
 409 ms 36396 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[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void mem(ll i , ll sum){
    if(i > 22){
        mp[sum]++ ;
        R ;
    }
    mem(i + 1 , sum) , mem(i + 1 , sum + b[i]) ;
}
void solve(){
    cin >> n ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
    }
    b[1] = 1 , b[2] = 2 ;
    for(ll i = 3 ; i <= 22 ; i++){
        b[i] = b[i - 1] + b[i - 2] ;
    }
    mem(1 , 0) ;
    for(ll i = 1 ; i <= n ; i++){
        o += b[a[i]] ;
        cout << mp[o] << endl ;
    }
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 18152 KB Output is correct
2 Correct 386 ms 18072 KB Output is correct
3 Correct 376 ms 17988 KB Output is correct
4 Correct 408 ms 18048 KB Output is correct
5 Correct 375 ms 18052 KB Output is correct
6 Correct 409 ms 17988 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 18152 KB Output is correct
2 Correct 386 ms 18072 KB Output is correct
3 Correct 376 ms 17988 KB Output is correct
4 Correct 408 ms 18048 KB Output is correct
5 Correct 375 ms 18052 KB Output is correct
6 Correct 409 ms 17988 KB Output is correct
7 Correct 387 ms 18056 KB Output is correct
8 Incorrect 381 ms 17964 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 18152 KB Output is correct
2 Correct 386 ms 18072 KB Output is correct
3 Correct 376 ms 17988 KB Output is correct
4 Correct 408 ms 18048 KB Output is correct
5 Correct 375 ms 18052 KB Output is correct
6 Correct 409 ms 17988 KB Output is correct
7 Correct 387 ms 18056 KB Output is correct
8 Incorrect 381 ms 17964 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 393 ms 36396 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 387 ms 18152 KB Output is correct
2 Correct 386 ms 18072 KB Output is correct
3 Correct 376 ms 17988 KB Output is correct
4 Correct 408 ms 18048 KB Output is correct
5 Correct 375 ms 18052 KB Output is correct
6 Correct 409 ms 17988 KB Output is correct
7 Correct 387 ms 18056 KB Output is correct
8 Incorrect 381 ms 17964 KB Output isn't correct
9 Halted 0 ms 0 KB -