oj.uz

답안 #1077429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077429 2024-08-27T07:08:43 Z Faisal_Saqib 디지털 회로 (IOI22_circuit) C++17
0 / 100
 8 ms 2512 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll NP=1e4+10,mod=1e9+2022;
ll n,m,p[NP],a[NP];
vector<ll> ma[NP];
ll dp[NP][2];
void compute(int x)
{
	dp[x][0]=dp[x][1]=0;
	if(n<=x){
		dp[x][a[x-n]]=1;
		return;
	}
	int sz=ma[x].size();
	vector<int> tmp(sz+1);
	tmp[0]=1;
	for(auto y:ma[x])
	{
		compute(y);
		for(int j=sz;j>=0;j--)
		{
			if(j==0)
			{
				tmp[j]=(tmp[j]*dp[y][0])%mod;
			}
			else
			{
				tmp[j]=(tmp[j]*dp[y][0])%mod;
				tmp[j]=(tmp[j] + ((tmp[j-1]*dp[y][1])%mod))%mod;
			}
		}
	}
	int sm=0;
	for(int j=sz;j>=1;j--)
	{
		sm = ( sm + tmp[j] ) % mod;
		dp[x][1] = ( dp[x][1] + sm ) % mod;
	}
	sm=tmp[0];
	for(int j=1;j<=sz;j++)
	{
		dp[x][0] = ( dp[x][0] + sm ) % mod;
		sm = ( sm + tmp[j] ) % mod;
	}
}
bool subtask=1;
void init(int N, int M, std::vector<int> P, std::vector<int> A)
{
	n=N,m=M;
	for(ll i=0;i<n+m;i++)
	{
		p[i]=P[i];
		if(p[i]!=-1)ma[p[i]].push_back(i),subtask&=((p[i]==((i-1)/2)));
	}
	for(ll j=0;j<m;j++)a[j]=A[j];
	compute(0);
}

int count_ways(int L, int R)
{
	for(ll i=L-n;i<=R-n;i++)a[i]=(a[i]?0:1);
	if(subtask)
	{
		int x=L;
		while(x>=0)
		{
			dp[x][0]=dp[x][1]=0;
			if(n<=x)
			{
				dp[x][a[x-n]]=1;
			}
			else
			{	
				int sz=ma[x].size();
				vector<int> tmp(sz+1);
				tmp[0]=1;
				for(auto y:ma[x])
				{
					for(int j=sz;j>=0;j--)
					{
						if(j==0)
						{
							tmp[j]=(tmp[j]*dp[y][0])%mod;
						}
						else
						{
							tmp[j]=(tmp[j]*dp[y][0])%mod;
							tmp[j]=(tmp[j] + ((tmp[j-1]*dp[y][1])%mod))%mod;
						}
					}
				}
				int sm=0;
				for(int j=sz;j>=1;j--)
				{
					sm = ( sm + tmp[j] ) % mod;
					dp[x][1] = ( dp[x][1] + sm ) % mod;
				}
				sm=tmp[0];
				for(int j=1;j<=sz;j++)
				{
					dp[x][0] = ( dp[x][0] + sm ) % mod;
					sm = ( sm + tmp[j] ) % mod;
				}
			}
			x=p[x];
		}
	}
	else
	{
		compute(0);
	}
	return (int)dp[0][1];
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 600 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 1 ms 600 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 1 ms 600 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 600 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 1 ms 600 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 1 ms 600 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -