oj.uz

답안 #1077441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077441 2024-08-27T07:16:25 Z Faisal_Saqib 디지털 회로 (IOI22_circuit) C++17
18 / 100
 3000 ms 6232 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll NP=1e5+100,mod=1e9+2022;
ll n,m,p[NP],a[NP];
vector<ll> ma[NP];
ll dp[NP][2];
void compute(int x,bool recur=1)
{
	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])
	{
		if(recur)
			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(L==R)
	{
		int x=L;
		while(x>=0)
		{
			compute(x);
			x=p[x];
		}
	}
	else
	{
		compute(0);
	}
	return (int)dp[0][1];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 22 ms 2864 KB Output is correct
4 Correct 23 ms 2856 KB Output is correct
5 Correct 23 ms 2648 KB Output is correct
6 Correct 26 ms 2648 KB Output is correct
7 Correct 24 ms 2648 KB Output is correct
8 Correct 24 ms 2648 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 3 ms 2904 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 2904 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 22 ms 2864 KB Output is correct
4 Correct 23 ms 2856 KB Output is correct
5 Correct 23 ms 2648 KB Output is correct
6 Correct 26 ms 2648 KB Output is correct
7 Correct 24 ms 2648 KB Output is correct
8 Correct 24 ms 2648 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 2 ms 2904 KB Output is correct
17 Correct 3 ms 2904 KB Output is correct
18 Correct 2 ms 2904 KB Output is correct
19 Correct 3 ms 2904 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 3 ms 2904 KB Output is correct
25 Correct 2 ms 2904 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 2 ms 2808 KB Output is correct
29 Correct 24 ms 2856 KB Output is correct
30 Correct 24 ms 2648 KB Output is correct
31 Correct 81 ms 2904 KB Output is correct
32 Correct 3 ms 2904 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 6 ms 2848 KB Output is correct
36 Correct 2 ms 2904 KB Output is correct
37 Correct 24 ms 2904 KB Output is correct
38 Correct 24 ms 2904 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2648 KB Output is correct

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 3 ms 2904 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 2904 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Execution timed out 3028 ms 6232 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 22 ms 2864 KB Output is correct
4 Correct 23 ms 2856 KB Output is correct
5 Correct 23 ms 2648 KB Output is correct
6 Correct 26 ms 2648 KB Output is correct
7 Correct 24 ms 2648 KB Output is correct
8 Correct 24 ms 2648 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 2 ms 2904 KB Output is correct
17 Correct 3 ms 2904 KB Output is correct
18 Correct 2 ms 2904 KB Output is correct
19 Correct 3 ms 2904 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 3 ms 2904 KB Output is correct
25 Correct 2 ms 2904 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 2 ms 2808 KB Output is correct
29 Correct 24 ms 2856 KB Output is correct
30 Correct 24 ms 2648 KB Output is correct
31 Correct 81 ms 2904 KB Output is correct
32 Correct 3 ms 2904 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 6 ms 2848 KB Output is correct
36 Correct 2 ms 2904 KB Output is correct
37 Correct 24 ms 2904 KB Output is correct
38 Correct 24 ms 2904 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2648 KB Output is correct
43 Execution timed out 3079 ms 2904 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 22 ms 2864 KB Output is correct
4 Correct 23 ms 2856 KB Output is correct
5 Correct 23 ms 2648 KB Output is correct
6 Correct 26 ms 2648 KB Output is correct
7 Correct 24 ms 2648 KB Output is correct
8 Correct 24 ms 2648 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 2 ms 2904 KB Output is correct
17 Correct 3 ms 2904 KB Output is correct
18 Correct 2 ms 2904 KB Output is correct
19 Correct 3 ms 2904 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 3 ms 2904 KB Output is correct
25 Correct 2 ms 2904 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 2 ms 2904 KB Output is correct
28 Correct 2 ms 2808 KB Output is correct
29 Correct 24 ms 2856 KB Output is correct
30 Correct 24 ms 2648 KB Output is correct
31 Correct 81 ms 2904 KB Output is correct
32 Correct 3 ms 2904 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 6 ms 2848 KB Output is correct
36 Correct 2 ms 2904 KB Output is correct
37 Correct 24 ms 2904 KB Output is correct
38 Correct 24 ms 2904 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2648 KB Output is correct
43 Execution timed out 3028 ms 6232 KB Time limit exceeded
44 Halted 0 ms 0 KB -