Submission #1125319

#	Time	Username	Problem	Language	Result	Execution time	Memory
1125319		ljtunas	Binaria (CCO23_day1problem1)	C++17	10 / 25	67 ms	8260 KiB

Main

// author : anhtun_hi , nqg
// 25-26.12.2024

#include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define Log2(x) (63 - __builtin_clzll(x))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;

using ll = long long;
using ii = pair<ll, ll>;
using db = long double;
using ull = unsigned long long;

namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const  ll  mod = 1e6 + 3;
const  ll   oo = 1e18;

//#define int long long

int n, k, a[MAXN];

namespace Mod{

    inline void add(int &x, const int &y) { if((x += y) >= mod) x -= mod; }

    inline void sub(int &x, const int &y) { if((x -= y) < 0) x += mod; }

    inline void Mul(int &x, const int &y) { x = 1LL * x * y % mod; }

    inline int mul(const int &x, const int &y) { return 1LL * x * y % mod; }

    inline int sum(const int &x, const int &y) { int res = x + y; if(res >= mod) res -= mod; return res; }

    inline int diff(const int &x, const int &y) { int res = x - y; if(res < 0) res += mod; return res; }

} using namespace Mod;

namespace sub3{
    int dp[1005][(1 << 10) + 5];
    int solve(int i, int mask)
    {
        if (i > n) return 1;
        if (~dp[i][mask]) return dp[i][mask];
        int res = 0;
        For(j, 0, 1){
            int nmask = mask;
            nmask >>= 1;
            nmask |= j * (1 << (k - 1));
            if (a[i] == c_bit(nmask)) (res += solve(i + 1, nmask)) %= mod;
        }
        return dp[i][mask] = res;
    }
    void Solve(){
        memset(dp, -1, sizeof dp);
        int res = 0;
        For(mask, 0, (1 << k) - 1){
            if (c_bit(mask) == a[k])
            (res += solve(k + 1, mask)) %= mod;
        }
        cout << res << '\n';
    }
}

void Solve() {
    cin >> n >> k;
    For(i, k, n) cin >> a[i];
    sub3::Solve();
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("a.inp", "r")) {
        freopen("a.inp", "r", stdin);
        freopen("a.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;
    while(t --) Solve();
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen("a.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:99:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         freopen("a.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 7