Submission #880483

#TimeUsernameProblemLanguageResultExecution timeMemory
880483marvinthangFibonacci representations (CEOI18_fib)C++17
Compilation error
0 ms0 KiB
/************************************* * author: marvinthang * * created: 29.11.2023 20:32:14 * *************************************/ #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define left ___left #define right ___right #define TIME (1.0 * clock() / CLOCKS_PER_SEC) #define MASK(i) (1LL << (i)) #define BIT(x, i) ((x) >> (i) & 1) #define __builtin_popcount __builtin_popcountll #define ALL(v) (v).begin(), (v).end() #define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i) #define REPD(i, n) for (int i = (n); i-- > 0; ) #define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i) #define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; ) #define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i) #define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i) #define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u) #define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u) #ifdef LOCAL #include "debug.h" #else #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); } #define DB(...) 23 #define db(...) 23 #define debug(...) 23 #endif template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; } template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; } template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; } template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); } template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); } template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; } // end of template const int MOD = 1e9 + 7; namespace MODULAR { inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) { unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m; #ifdef __GNUC__ asm( "divl %4 \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (y) ); #else __asm { mov edx, dword ptr[xh]; mov eax, dword ptr[xl]; div dword ptr[y]; mov dword ptr[d], eax; mov dword ptr[m], edx; }; #endif out_d = d; out_m = m; } template <class T> T invGeneral(T a, T b) { a %= b; if (!a) return b == 1 ? 0 : -1; T x = invGeneral(b, a); return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b; } template <int MOD> struct ModInt { unsigned int val; ModInt(void): val(0) {} ModInt(const long long &x) { *this = x; } ModInt & normalize(const unsigned int &v) { val = v >= MOD ? v - MOD : v; return *this; } bool operator ! (void) { return !val; } ModInt & operator = (const ModInt &x) { val = x.val; return *this; } ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); } ModInt operator - (void) { return ModInt(MOD - val); } ModInt & operator += (const ModInt &other) { return normalize(val + other.val); } ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); } ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); } ModInt & operator *= (const ModInt &other) { unsigned dummy; fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val); return *this; } ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; } ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; } ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; } ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; } ModInt pow(long long n) const { assert(n >= 0); ModInt res = 1, a = *this; for (; n; n >>= 1, a *= a) if (n & 1) res *= a; return res; } ModInt inv(void) const { int i = invGeneral((int) val, MOD); assert(~i); return i; } ModInt & operator ++ (void) { return *this += 1; } ModInt & operator -- (void) { return *this -= 1; } ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; } ModInt operator -- (int) { ModInt old = *this; operator --(); return old; } friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; } friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; } friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; } friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; } friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; } friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; } explicit operator bool(void) const { return val; } explicit operator int(void) const { return val; } }; using Modular = ModInt <MOD>; } using namespace MODULAR; void process(void) { int n; cin >> n; map <int, int> cnt; function<void(int)> fix = [&] (int u) { if (!cnt.contains(u) || !cnt[u]) return; if (cnt[u] == 1) { if (u && cnt[u - 1]) { --cnt[u - 1]; --cnt[u]; ++cnt[u + 1]; fix(u + 1); } if (cnt[u] && cnt.contains(u + 1) && cnt[u + 1]) { --cnt[u]; --cnt[u + 1]; ++cnt[u + 2]; fix(u + 2); } } else { cnt[u] = 0; ++cnt[u + 1]; if (u > 1) { ++cnt[u - 2]; fix(u - 2); } else if (u == 1) { ++cnt[0]; fix(0); } fix(u + 1); } }; REP(i, n) { int x; cin >> x; ++cnt[--x]; fix(x); vector <int> pos; for (auto [x, y]: cnt) if (y) pos.push_back(x); vector <Modular> dp(pos.size()); Modular sum = 1; dp[0] = pos[0] / 2; FOR(i, 1, pos.size()) { dp[i] = (pos[i] - pos[i - 1]) / 2 * dp[i - 1] + (pos[i] - pos[i - 1] - 1) / 2 * sum; sum += dp[i - 1]; } cout << dp[(int) pos.size() - 1] + sum << '\n'; } } int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr); file("fib"); // int t; cin >> t; while (t--) process(); // cerr << "Time elapsed: " << TIME << " s.\n"; return (0^0); }

Compilation message (stderr)

fib.cpp: In lambda function:
fib.cpp:128:12: error: 'class std::map<int, int>' has no member named 'contains'
  128 |   if (!cnt.contains(u) || !cnt[u]) return;
      |            ^~~~~~~~
fib.cpp:134:22: error: 'class std::map<int, int>' has no member named 'contains'
  134 |    if (cnt[u] && cnt.contains(u + 1) && cnt[u + 1]) {
      |                      ^~~~~~~~
fib.cpp: In function 'int main()':
fib.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fib.cpp:171:2: note: in expansion of macro 'file'
  171 |  file("fib");
      |  ^~~~
fib.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fib.cpp:171:2: note: in expansion of macro 'file'
  171 |  file("fib");
      |  ^~~~