oj.uz

답안 #405405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
405405 2021-05-16T10:59:24 Z ollel Fibonacci representations (CEOI18_fib) C++14
5 / 100
 4000 ms 344 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back

int n;
const int maxf = 20;
const int p2f = 1048576;

vi f(maxf);
void getf() {
  f[0] = 1; f[1] = 2;
  rep(i,2,maxf) f[i] = f[i - 2] + f[i - 1];
}

ll ways(int x) {
  int ways = 0;
  rep(ss, 0, p2f) {
    ll s = 0;
    rep(i,0,maxf) {
      if (ss & (1<<i)) s += f[i];
    }
    if (s == x) ways++;
  }
  return ways;
}

int main()
{
  cin >> n;
  getf();
  int des = 0;
  rep(i,0,n) {
    int x; cin >> x; des += f[x-1];
    cout << ways(des) << endl;
  }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 284 KB Output is correct
2 Correct 1140 ms 204 KB Output is correct
3 Correct 1131 ms 292 KB Output is correct
4 Correct 75 ms 204 KB Output is correct
5 Correct 1091 ms 204 KB Output is correct
6 Correct 1151 ms 268 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 284 KB Output is correct
2 Correct 1140 ms 204 KB Output is correct
3 Correct 1131 ms 292 KB Output is correct
4 Correct 75 ms 204 KB Output is correct
5 Correct 1091 ms 204 KB Output is correct
6 Correct 1151 ms 268 KB Output is correct
7 Execution timed out 4058 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2403 ms 284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 284 KB Output is correct
2 Correct 1140 ms 204 KB Output is correct
3 Correct 1131 ms 292 KB Output is correct
4 Correct 75 ms 204 KB Output is correct
5 Correct 1091 ms 204 KB Output is correct
6 Correct 1151 ms 268 KB Output is correct
7 Execution timed out 4058 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 284 KB Output is correct
2 Correct 1140 ms 204 KB Output is correct
3 Correct 1131 ms 292 KB Output is correct
4 Correct 75 ms 204 KB Output is correct
5 Correct 1091 ms 204 KB Output is correct
6 Correct 1151 ms 268 KB Output is correct
7 Execution timed out 4058 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -