oj.uz

답안 #1074667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074667 2024-08-25T11:57:41 Z fv3 디지털 회로 (IOI22_circuit) C++17
4 / 100
 722 ms 7768 KB 
#include "circuit.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll MOD = 1000002022ll;

int N, M;
vector<int> A;

vector<vector<int>> adj;
vector<pair<ll, ll>> nodes;

void DFS(int index)
{
  if (index >= N)
  {
    if (A[index - N])
      nodes[index] = {1, 0};
    else
      nodes[index] = {0, 1};
    return;
  }

  for (auto node : adj[index])
  {
    DFS(node);
  }

  const auto l = nodes[adj[index][0]];
  const auto r = nodes[adj[index][1]];

  nodes[index] = 
  { 
   (2 * l.first * r.first + 
        l.first * r.second + 
        l.second * r.first ) % MOD,
   (2 * l.second * r.second + 
        l.first * r.second + 
        l.second * r.first ) % MOD
  };
}

void init(int N_, int M_, vector<int> P, vector<int> A_) 
{
  N = N_;
  M = M_;
  A = A_;

  adj = vector<vector<int>>(N);
  for (int i = 1; i < N + M; i++)
    adj[P[i]].push_back(i);

  nodes = vector<pair<ll, ll>>(N+M);
  DFS(0);
}

int count_ways(int L, int R) 
{
  A[L - N] ^= 1;

  while (1)
  {
    if (L >= N)
    {
      if (A[L - N])
        nodes[L] = {1, 0};
      else
        nodes[L] = {0, 1};
      L = (L - 1) / 2;
      continue;
    }

    const auto l = nodes[adj[L][0]];
    const auto r = nodes[adj[L][1]];

    nodes[L] = 
    { 
     (2 * l.first * r.first + 
          l.first * r.second + 
          l.second * r.first ) % MOD,
     (2 * l.second * r.second + 
          l.first * r.second + 
          l.second * r.first ) % MOD
    };

    if (L == 0) break;
    L = (L - 1) / 2;  
  }

  return nodes[0].first;
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

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

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 478 ms 3928 KB Output is correct
2 Correct 722 ms 7760 KB Output is correct
3 Correct 667 ms 7760 KB Output is correct
4 Correct 671 ms 7768 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 478 ms 3928 KB Output is correct
2 Correct 722 ms 7760 KB Output is correct
3 Correct 667 ms 7760 KB Output is correct
4 Correct 671 ms 7768 KB Output is correct
5 Incorrect 555 ms 3928 KB 1st lines differ - on the 1st token, expected: '105182172', found: '2777846'
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

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

Subtask #8
0 / 11.0

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