Submission #962941

#	Time	Username	Problem	Language	Result	Execution time	Memory
962941		vjudge1	Fibonacci representations (CEOI18_fib)	C++14	15 / 100	4035 ms	3212 KiB

fib

#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N=1e5+10, mod=1e9+7;
int n, a[N], f[N][2];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   for (int i=1; i<=n; ++i) cin >> a[i];
   for (int i=1; i<=n; ++i){
      sort(a+1, a+i+1);
      f[1][0]=(a[1]+1)/2;
      f[1][1]=f[1][0]-1;
      for (int j=2; j<=i; ++j){
         if ((a[j]&1)==(a[j-1]&1)){
            f[j][0]=(f[j-1][0]*(a[j]-a[j-1])/2+f[j-1][1]+mod)%mod;
            f[j][1]=(f[j][0]-f[j-1][0]+mod)%mod;
         }else{
            f[j][0]=f[j-1][0]*(a[j]-a[j-1]+1)/2%mod;
            f[j][1]=(f[j][0]-f[j-1][0]+mod)%mod;
         }
      }
      cout << f[i][0] << '\n';
   }
   return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 20
• Subtask 3: 15 / 15
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 35