oj.uz

답안 #825721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825721 2023-08-15T07:22:28 Z LittleCube 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 7952 KB 
#include "circuit.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll mod = 1'000'002'022;
namespace
{
  int N, M;
  vector<int> P, A, c;
  vector<int> child[200005];
  ll zero[200005], one[200005];
}

void init(int N, int M, vector<int> P, vector<int> A)
{
  ::N = N;
  ::M = M;
  ::P = P;
  ::A = A;
  c.resize(N);
  for (int i = 1; i < N + M; i++)
    c[P[i]]++, child[P[i]].emplace_back(i);
}

int count_ways(int L, int R)
{
  L -= N, R -= N;
  for (int i = L; i <= R; i++)
    A[i] ^= 1;
  for (int i = M - 1; i >= 0; i--)
    if(A[i] == 1)
      zero[N + i] = 0, one[N + i] = 1;
    else 
      zero[N + i] = 1, one[N + i] = 0;
  for (int i = N - 1; i >= 0; i--)
  {
    int K = child[i].size();
    vector<ll> dp(K + 1, 0);
    dp[0] = 1;
    for (auto j : child[i])
      for (int k = K - 1; k >= 0; k--)
      {
        dp[k + 1] = (dp[k + 1] + dp[k] * one[j]) % mod;
        dp[k] = (dp[k] * zero[j]) % mod;
      }
    zero[i] = one[i] = 0;
    for (int k = 0; k <= K; k++)
    {
      zero[i] = (zero[i] + (K - k) * dp[k]);
      one[i] = (one[i] + k * dp[k]);
    }
  }
  return one[0];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4900 KB Output is correct
3 Correct 14 ms 4944 KB Output is correct
4 Correct 19 ms 5048 KB Output is correct
5 Correct 15 ms 4944 KB Output is correct
6 Correct 15 ms 5052 KB Output is correct
7 Correct 15 ms 5072 KB Output is correct
8 Correct 15 ms 4944 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4900 KB Output is correct
3 Correct 14 ms 4944 KB Output is correct
4 Correct 19 ms 5048 KB Output is correct
5 Correct 15 ms 4944 KB Output is correct
6 Correct 15 ms 5052 KB Output is correct
7 Correct 15 ms 5072 KB Output is correct
8 Correct 15 ms 4944 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Incorrect 3 ms 4944 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052134984'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4900 KB Output is correct
3 Correct 14 ms 4944 KB Output is correct
4 Correct 19 ms 5048 KB Output is correct
5 Correct 15 ms 4944 KB Output is correct
6 Correct 15 ms 5052 KB Output is correct
7 Correct 15 ms 5072 KB Output is correct
8 Correct 15 ms 4944 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Incorrect 3 ms 4944 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052134984'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4900 KB Output is correct
3 Correct 14 ms 4944 KB Output is correct
4 Correct 19 ms 5048 KB Output is correct
5 Correct 15 ms 4944 KB Output is correct
6 Correct 15 ms 5052 KB Output is correct
7 Correct 15 ms 5072 KB Output is correct
8 Correct 15 ms 4944 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Incorrect 3 ms 4944 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052134984'
11 Halted 0 ms 0 KB -