oj.uz

답안 #1057819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057819 2024-08-14T06:28:04 Z aykhn 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 10056 KB 
#include <bits/stdc++.h>
#include "circuit.h"

using namespace std;

#define int long long

const int MXN = 2e5 + 5;
const int mod = 1e9 + 2022;

int n, m;
vector<int> A;
vector<int> adj[MXN];
int dp[2][MXN];

void dfs(int a)
{
  dp[0][a] = dp[1][a] = 0;
  if (adj[a].empty())
  {
    dp[0][a] = A[a] ^ 1;
    dp[1][a] = A[a];
    return;
  }
  int sz = adj[a].size();
  vector<int> dp1(sz + 1, 0);
  dp1[0] = 1;
  for (int &v : adj[a])
  {
    dfs(v);
    for (int i = sz; i >= 0; i--)
    {
      dp1[i] = (dp1[i] * dp[0][v]) % mod;
      if (i) dp1[i] = (dp1[i] + ((dp1[i - 1] * dp[1][v]) % mod)) % mod;
    }
  }
  for (int i = 0; i <= sz; i++)
  {
    dp[0][a] = (dp[0][a] + (((sz - i) * dp1[i]) % mod));
    dp[1][a] = (dp[1][a] +  ((i * dp1[i]) % mod));
  }
}

void init(int32_t N, int32_t M, vector<int32_t> P, vector<int32_t> AA) 
{
  for (int32_t &i : AA) A.push_back(i);
  reverse(A.begin(), A.end());
  A.resize(N + M, 0);
  reverse(A.begin(), A.end());
  for (int i = 1; i < N + M; i++) adj[P[i]].push_back(i);
}

int32_t count_ways(int32_t L, int32_t R) {
  for (int i = L; i <= R; i++) A[i] ^= 1;
  dfs(0);
  return dp[1][0];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8024 KB Output is correct
2 Correct 1 ms 8024 KB Output is correct
3 Correct 19 ms 8024 KB Output is correct
4 Correct 21 ms 8024 KB Output is correct
5 Correct 21 ms 8024 KB Output is correct
6 Correct 20 ms 8024 KB Output is correct
7 Correct 21 ms 8024 KB Output is correct
8 Correct 21 ms 8024 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8024 KB Output is correct
2 Correct 1 ms 8024 KB Output is correct
3 Correct 19 ms 8024 KB Output is correct
4 Correct 21 ms 8024 KB Output is correct
5 Correct 21 ms 8024 KB Output is correct
6 Correct 20 ms 8024 KB Output is correct
7 Correct 21 ms 8024 KB Output is correct
8 Correct 21 ms 8024 KB Output is correct
9 Correct 1 ms 8024 KB Output is correct
10 Incorrect 1 ms 8024 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1052132962'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8024 KB Output is correct
2 Correct 1 ms 8024 KB Output is correct
3 Correct 19 ms 8024 KB Output is correct
4 Correct 21 ms 8024 KB Output is correct
5 Correct 21 ms 8024 KB Output is correct
6 Correct 20 ms 8024 KB Output is correct
7 Correct 21 ms 8024 KB Output is correct
8 Correct 21 ms 8024 KB Output is correct
9 Correct 1 ms 8024 KB Output is correct
10 Incorrect 1 ms 8024 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1052132962'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8024 KB Output is correct
2 Correct 1 ms 8024 KB Output is correct
3 Correct 19 ms 8024 KB Output is correct
4 Correct 21 ms 8024 KB Output is correct
5 Correct 21 ms 8024 KB Output is correct
6 Correct 20 ms 8024 KB Output is correct
7 Correct 21 ms 8024 KB Output is correct
8 Correct 21 ms 8024 KB Output is correct
9 Correct 1 ms 8024 KB Output is correct
10 Incorrect 1 ms 8024 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1052132962'
11 Halted 0 ms 0 KB -