oj.uz

Submission #826313

# Submission time Handle Problem Language Result Execution time Memory
826313 2023-08-15T12:40:21 Z Sam_a17 Fibonacci representations (CEOI18_fib) C++17
5 / 100
 401 ms 52436 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
// #include "B.cpp"
// #include "trilib.h"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const long long mod = 1e9 + 7;
long long fib[2005], a[2005];

long long add(long long a, long long b) {
  return (a + b) % mod;
}

long long mult(long long a, long long b) {
  return (a * b) % mod;
}

long long sub(long long a, long long b) {
  return (a - b + 2 * mod) % mod;
}

void solve_() {
  int n; cin >> n;
  long long max_n = 0;
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    max_n = max(max_n,  a[i]);
  }

  map<long long, long long> mp;
  mp[0] = 1;

  for(int i = 1; i <= 26; i++) {
    map<long long, long long> new_mp;
    for(auto j: mp) {
      new_mp[j.first + fib[i]] = add(new_mp[j.first + fib[i]], j.second);
    }

    for(auto j: mp) {
      new_mp[j.first] = add(new_mp[j.first], j.second);
    }
    mp.swap(new_mp);
  }

  if(max_n <= 15 && n <= 15) {
    long long curr = 0;
    for(int i = 1; i <= n; i++) {
      curr += fib[a[i]];
      cout << mp[curr] << '\n'; 
    }
  } else {
    vector<long long> all{0};
    for(int i = 1; i <= n; i++) {
      all.push_back(a[i]);
      vector<vector<long long>> dp(n + 2, vector<long long> (2, 0));
      dp[0][1] = 1;
      sort(all(all));
      long long lst = 0, pat = 1;
      for(int j = 1; j < sz(all); j++) {
        //
        dp[j][1] = add(dp[j - 1][0], dp[j - 1][1]);
    
        for(int k = j - 1; j >= 0; k--) {
          if(k == j - 1) {
            long long cnt = (all[j] - all[k] - 1) / 2;
            dp[j][0] = add(dp[j][0], mult(add(dp[k][1], dp[k][0]), cnt));
          } else {
            dp[j][0] = add(dp[j][0], dp[k + 1][0]);
          }

          if(all[k] % 2 != all[j] % 2) {
            break;
          }
        }
      }

      cout << add(dp[sz(all) - 1][0], dp[sz(all) - 1][1]) << '\n';
    }
  }
}
 
int main() {
  fastIO();

  fib[0] = fib[1] = 1;
  for(int i = 2; i <= 105; i++) {
    fib[i] = fib[i - 1] + fib[i - 2];
  }
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

fib.cpp: In function 'void solve_()':
fib.cpp:124:17: warning: unused variable 'lst' [-Wunused-variable]
  124 |       long long lst = 0, pat = 1;
      |                 ^~~
fib.cpp:124:26: warning: unused variable 'pat' [-Wunused-variable]
  124 |       long long lst = 0, pat = 1;
      |                          ^~~
fib.cpp: In function 'void setIO(std::string)':
fib.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fib.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 52292 KB Output is correct
2 Correct 397 ms 52428 KB Output is correct
3 Correct 401 ms 52284 KB Output is correct
4 Correct 394 ms 52332 KB Output is correct
5 Correct 390 ms 52312 KB Output is correct
6 Correct 393 ms 52396 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 52292 KB Output is correct
2 Correct 397 ms 52428 KB Output is correct
3 Correct 401 ms 52284 KB Output is correct
4 Correct 394 ms 52332 KB Output is correct
5 Correct 390 ms 52312 KB Output is correct
6 Correct 393 ms 52396 KB Output is correct
7 Incorrect 392 ms 52408 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 397 ms 52436 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 52292 KB Output is correct
2 Correct 397 ms 52428 KB Output is correct
3 Correct 401 ms 52284 KB Output is correct
4 Correct 394 ms 52332 KB Output is correct
5 Correct 390 ms 52312 KB Output is correct
6 Correct 393 ms 52396 KB Output is correct
7 Incorrect 392 ms 52408 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

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

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 52292 KB Output is correct
2 Correct 397 ms 52428 KB Output is correct
3 Correct 401 ms 52284 KB Output is correct
4 Correct 394 ms 52332 KB Output is correct
5 Correct 390 ms 52312 KB Output is correct
6 Correct 393 ms 52396 KB Output is correct
7 Incorrect 392 ms 52408 KB Output isn't correct
8 Halted 0 ms 0 KB -