oj.uz

답안 #1078992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078992 2024-08-28T09:10:39 Z Boas 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 2904 KB 
#include "circuit.h"

#pragma GCC optimize("trapv")

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)x - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef signed i32;
typedef array<int, 2> ii;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<i32> vi32;
typedef vector<vi> vvi;

constexpr int MOD = 1'000'002'022;

vvi children;
int n, m;
vb a;

void init(i32 N, i32 M, vi32 P, vi32 A)
{
  n = N;
  m = M;
  children = vvi(N);
  a = vb(M);
  loop(sz(P), i)
  {
    if (i == 0)
      continue;
    children[P[i]].pb(i);
  }
  loop(sz(A), i)
  {
    a[i] = A[i];
  }
}

ii calc(int i)
{
  if (i >= n)
  {
    if (a[i - n])
      return {1, 1};
    return {1, 0};
  }
  int all = sz(children), r1 = 0;
  vi alls, ones;
  for (int j : children[i])
  {
    auto [allJ, v1] = calc(j);
    all *= allJ;
    all %= MOD;
    alls.pb(allJ);
    ones.pb(v1);
  }
  loop(sz(children[i]), j)
  {
    int allExcept = 1;
    loop(sz(children[i]), k)
    {
      if (j == k)
        continue;
      allExcept *= alls[k];
    }
    r1 += allExcept * ones[j];
    r1 %= MOD;
  }
  return {all % MOD, r1 % MOD};
}

i32 count_ways(i32 L, i32 R)
{
  for (int i = L; i <= R; i++)
  {
    a[i - n].flip();
  }
  return calc(0)[1];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 27 ms 344 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 27 ms 480 KB Output is correct
7 Correct 27 ms 480 KB Output is correct
8 Correct 27 ms 344 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

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

Subtask #8
0 / 11.0

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