oj.uz

답안 #775405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775405 2023-07-06T11:05:48 Z Magikarp4000 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 10628 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int64_t(1000002022)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long
 
const int MAXN = 1e5+5;
int n,m;
vector<int> adj[MAXN];
int z[MAXN];
int dp0[MAXN], dp1[MAXN], cnt[MAXN];
 
void dfs(int s) {
    int sz = adj[s].size();
    if (sz == 0) {
        dp1[s] = z[s];
        dp0[s] = z[s]^1LL;
        cnt[s] = 1LL;
        return;
    }
    FORX(u,adj[s]) {
        dfs(u);
    }
    vector<int> v;
    FORX(u,adj[s]) v.PB(u);
    vector<vector<int>> dp(sz+1,vector<int>(sz+1,0LL));
    vector<int> num(sz+1,0LL), num1(sz+1,0LL);
    FOR(i,0,sz) {
        num[i+1] = num[i];
        num1[i+1] = num1[i];
        if (dp0[v[i]] == 0) num[i+1]++;
        if (dp1[v[i]] == 0) num1[i+1]++;
    }
    FOR(j,0,sz+1) dp[0][j] = 1LL;
    FOR(i,1,sz+1) {
        FOR(j,1,sz+1) {
            dp[i][j] = ((dp[i][j-1]*dp0[v[j-1]])%INF + (dp[i-1][j-1]*dp1[v[j-1]])%INF)%INF;
            if (num[j] > i || num1[j] > sz-i) dp[i][j] = 0LL;
        }
    }
    int total = sz;
    FORX(u,adj[s]) total = (total*cnt[u])%INF;
    int dpsum = 0LL;
    FOR(i,1,sz+1) dpsum = (dpsum+(dp[i][sz]*i)%INF)%INF;
    dp1[s] = dpsum;
    dp0[s] = (total-dpsum+INF)%INF;
    cnt[s] = total;
}
 
void init(int32_t N, int32_t M, std::vector<int32_t> P, std::vector<int32_t> A) {
    n = N; m = M;
    FOR(i,1,int32_t(P.size())) adj[P[i]].PB(i);
    FOR(i,0,int32_t(A.size())) z[n+i] = A[i];
}
 
int32_t count_ways(int32_t L, int32_t R) {
    FOR(i,L,R+1) z[i] ^= 1;
    dfs(0);
    // FOR(i,0,n+m) cout << dp1[i] << " ";
    // cout << ln;
    // FOR(i,0,n+m) cout << dp0[i] << " ";
    // cout << ln;
    return dp1[0];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 45 ms 10264 KB Output is correct
4 Correct 49 ms 10616 KB Output is correct
5 Correct 52 ms 10628 KB Output is correct
6 Correct 46 ms 10628 KB Output is correct
7 Correct 49 ms 10600 KB Output is correct
8 Correct 47 ms 10628 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Incorrect 2 ms 2640 KB 1st lines differ - on the 1st token, expected: '52130940', found: '719795116'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 45 ms 10264 KB Output is correct
4 Correct 49 ms 10616 KB Output is correct
5 Correct 52 ms 10628 KB Output is correct
6 Correct 46 ms 10628 KB Output is correct
7 Correct 49 ms 10600 KB Output is correct
8 Correct 47 ms 10628 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Incorrect 2 ms 2640 KB 1st lines differ - on the 1st token, expected: '52130940', found: '719795116'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3014 ms 5836 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3014 ms 5836 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Incorrect 2 ms 2640 KB 1st lines differ - on the 1st token, expected: '52130940', found: '719795116'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 45 ms 10264 KB Output is correct
4 Correct 49 ms 10616 KB Output is correct
5 Correct 52 ms 10628 KB Output is correct
6 Correct 46 ms 10628 KB Output is correct
7 Correct 49 ms 10600 KB Output is correct
8 Correct 47 ms 10628 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Incorrect 2 ms 2640 KB 1st lines differ - on the 1st token, expected: '52130940', found: '719795116'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 45 ms 10264 KB Output is correct
4 Correct 49 ms 10616 KB Output is correct
5 Correct 52 ms 10628 KB Output is correct
6 Correct 46 ms 10628 KB Output is correct
7 Correct 49 ms 10600 KB Output is correct
8 Correct 47 ms 10628 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Incorrect 2 ms 2640 KB 1st lines differ - on the 1st token, expected: '52130940', found: '719795116'
11 Halted 0 ms 0 KB -