제출 #1059469

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059469		shiomusubi496	Digital Circuit (IOI22_circuit)	C++17	18 / 100	3081 ms	4032 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }


constexpr ll MOD = 1000002022;

int N, M;
vector<vector<int>> G;
vector<int> A;

void init(int N_, int M_, std::vector<int> P, std::vector<int> A_) {
    N = N_; M = M_;
    A = A_;
    G.assign(N, vector<int>());
    rep2 (i, 1, N + M) G[P[i]].push_back(i);
}

int count_ways(int L, int R) {
    L = L - N;
    R = R + 1 - N;
    rep2 (i, L, R) A[i] ^= 1;
    vector<ll> res(N + M), res2(N + M);
    rep (i, M) res[N + i] = A[i], res2[N + i] = 1;
    rrep (i, N) {
        for (int j : G[i]) {
            ll p = 1;
            for (int k : G[i]) {
                if (j != k) (p *= res2[k]) %= MOD;
            }
            (res[i] += p * res[j]) %= MOD;
        }
        ll p = G[i].size();
        for (int k : G[i]) (p *= res2[k]) %= MOD;
        res2[i] = p;
    }
    return res[0];
}

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11