oj.uz

Submission #123173

# Submission time Handle Problem Language Result Execution time Memory
123173 2019-06-30T09:42:02 Z davitmarg Fibonacci representations (CEOI18_fib) C++17
5 / 100
 83 ms 704 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,p[100005],f[100005],cnt[100005],sum;
int main()
{
    cin>>n;
    f[0]=1;
    f[1]=1;
    for(int i=2;i<=20;i++)
		f[i]=f[i-1]+f[i-2];
    for(int mask=0;mask<(1<<20);mask++)
    {
        for(int i=1;i<=20;i++)
            if(mask&(1<<(i-1)))
				sum+=f[i];
        cnt[sum]++;
    	sum=0;
    }


    for(int i=1;i<=n;i++)
	{
		cin>>p[i];
        sum+=f[p[i]];
        cout<<cnt[sum]<<endl;
	}

	return 0;
}


/*


*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 632 KB Output is correct
2 Correct 80 ms 464 KB Output is correct
3 Correct 81 ms 548 KB Output is correct
4 Correct 80 ms 504 KB Output is correct
5 Correct 83 ms 504 KB Output is correct
6 Correct 80 ms 504 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 632 KB Output is correct
2 Correct 80 ms 464 KB Output is correct
3 Correct 81 ms 548 KB Output is correct
4 Correct 80 ms 504 KB Output is correct
5 Correct 83 ms 504 KB Output is correct
6 Correct 80 ms 504 KB Output is correct
7 Correct 80 ms 504 KB Output is correct
8 Incorrect 81 ms 504 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 632 KB Output is correct
2 Correct 80 ms 464 KB Output is correct
3 Correct 81 ms 548 KB Output is correct
4 Correct 80 ms 504 KB Output is correct
5 Correct 83 ms 504 KB Output is correct
6 Correct 80 ms 504 KB Output is correct
7 Correct 80 ms 504 KB Output is correct
8 Incorrect 81 ms 504 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 81 ms 704 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 632 KB Output is correct
2 Correct 80 ms 464 KB Output is correct
3 Correct 81 ms 548 KB Output is correct
4 Correct 80 ms 504 KB Output is correct
5 Correct 83 ms 504 KB Output is correct
6 Correct 80 ms 504 KB Output is correct
7 Correct 80 ms 504 KB Output is correct
8 Incorrect 81 ms 504 KB Output isn't correct
9 Halted 0 ms 0 KB -