oj.uz

답안 #652755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652755 2022-10-24T08:22:00 Z Blagoj 디지털 회로 (IOI22_circuit) C++17
0 / 100
 10 ms 2372 KB 
#include "circuit.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> states;
vector<int> kids[1009];
int n, m;
long long mod = 1000002022;

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
  states = A;
  n = N;
  m = M;
  for (int i = 1; i < P.size(); i++)
  {
    kids[P[i]].push_back(i);
  }
}

long long dp[3000][2];
bool solved[3000];

void solve(int x)
{
  solved[x] = true;
  int k1 = kids[x][0], k2 = kids[x][1];
  if (dp[k1][0] == -1 || dp[k1][1] == -1)
  {
    solve(k1);
  }
  if (dp[k2][0] == -1 || dp[k2][1] == -1)
  {
    solve(k2);
  }
  dp[x][0] = dp[k1][0] * dp[k2][1] + dp[k1][1] * dp[k2][0] + 2 * dp[k1][0] * dp[k2][0];
  dp[x][1] = dp[k1][0] * dp[k2][1] + dp[k1][1] * dp[k2][0] + 2 * dp[k1][1] * dp[k2][1];
}

int count_ways(int L, int R) {
  for (int i = L - n; i <= R - n; i++)
  {
    if (states[i] == 0)
    {
      states[i] = 1;
    }
    else
    {
      states[i] = 0;
    }
  }
  if (n == 1)
  {
    int ans = 0;
    for (int i = 1; i <= m; i++)
    {
      ans += states[i];
    }
    return ans;
  }
  for (int i = 0; i < n; i++)
  {
    dp[i][0] = dp[i][1] = -1;
  }
  for (int i = n; i < n + m; i++)
  {
    if (states[i] == 1)
    {
      dp[i][1] = 1;
      dp[i][0] = 0;
    }
    else
    {
      dp[i][1] = 0;
      dp[i][0] = 1;
    }
  }
  memset(solved, 0, sizeof(solved));
  for (int i = 0; i < n; i++)
  {
    if (!solved[i])
    {
      solve(i);
    }
  }
  return dp[0][1];
}

Compilation message

circuit.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>)':
circuit.cpp:15:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   for (int i = 1; i < P.size(); i++)
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 2372 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 2372 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

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

Subtask #8
0 / 11.0

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