oj.uz

답안 #955517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955517 2024-03-30T17:57:15 Z StefanSebez 디지털 회로 (IOI22_circuit) C++17
22 / 100
 3000 ms 17016 KB 
#include "circuit.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int N=1e5+500;
const ll mod=1000002022;
ll Puta(ll a,ll b){a%=mod,b%=mod;ll x=a*b;x%=mod;return x;}
ll Plus(ll a,ll b){a%=mod,b%=mod;ll x=a+b;x%=mod;return x;}
vector<int>E[2*N+500];
int a[N+500],n,m,P[2*N+500];
ll res[N+500],dp[2*N+500][2],F[2*N+500],F1[2*N+500];
void DFSsetup(int u){
	if(E[u].empty()) return;
	F[u]=E[u].size();
	for(auto i:E[u]){
		DFSsetup(i);
		F[u]=Puta(F[u],F[i]);
	}
	for(auto i:E[u]){
		F1[i]=1;
		for(auto j:E[u]){
			if(j!=i) F1[i]=Puta(F1[i],F[j]);
		}
	}
}
void DFS(int u){
	if(E[u].empty()) return;
	for(auto i:E[u]) DFS(i);
	dp[u][1]=0;
	for(auto i:E[u]) dp[u][1]=Plus(dp[u][1],Puta(dp[i][1],F1[i]));
	//printf("%i: %lld %lld\n",u,dp[u][1],F[u]);
	/*int mask=0;
	while(mask< (1<<(E[u].size()))){
		ll temp1=1,sum=0;
		for(int i=0,temp=mask;i<E[u].size();i++,temp/=2){
			temp1=Puta(temp1,dp[E[u][i]][temp%2]);sum+=temp%2;
		}
		if(mask!=0) dp[u][1]=Plus(dp[u][1],Puta(sum,temp1));
		dp[u][0]=Plus(dp[u][0],Puta(E[u].size()-sum,temp1));
		mask++;
	}*/
	//dp[u][0]=F[u]-dp[u][1];
}
void Update(int v){
	dp[v][1]=1-dp[v][1];
	dp[v][0]=1-dp[v][0];
	int u=P[v];
	while(u!=-1){
		dp[u][1]=0;
		for(auto i:E[u]) dp[u][1]=Plus(dp[u][1],Puta(dp[i][1],F1[i]));
		/*dp[u][1]=dp[u][0]=0;
		int mask=0;
		while(mask< (1<<(E[u].size()))){
			ll temp1=1,sum=0;
			for(int i=0,temp=mask;i<E[u].size();i++,temp/=2){
				temp1=Puta(temp1,dp[E[u][i]][temp%2]);sum+=temp%2;
			}
			if(mask!=0) dp[u][1]=Plus(dp[u][1],Puta(sum,temp1));
			dp[u][0]=Plus(dp[u][0],Puta(E[u].size()-sum,temp1));
			mask++;
		}*/
		u=P[u];
	}
}
void init(int N1, int M1, std::vector<int> P1, std::vector<int> A) {
	n=N1,m=M1;
	for(int i=0;i<P1.size();i++) P[i]=P1[i];
	for(int i=0;i<P1.size();i++){
		E[P[i]].pb(i);
	}
	for(int i=0;i<m;i++){
		dp[n+i][1]=A[i],dp[n+i][0]=1-A[i];
		a[i]=A[i];
		F[n+i]=1;
	}
	DFSsetup(0);
	DFS(0);
	/*for(int i=0;i<=n+m-1;i++){
		printf("%i: %i %i\n",i,dp[i][0],dp[i][1]);
	}*/
	/*for(int i=1;i<=M;i++){

	}*/
}

int count_ways(int L, int R) {
	if(n==1){
		int ct=0;
		for(int i=L;i<=R;i++) a[i-1]=1-a[i-1];
		for(int i=0;i<=m-1;i++) ct+=a[i];
		return ct;
	}
	for(int i=L;i<=R;i++){
		Update(i);
		//dp[i][1]=1-dp[i][1];
		//dp[i][0]=1-dp[i][0];
	}
	//DFS(0);
	/*for(int i=0;i<=n+m-1;i++){
		printf("%i: %i %i\n",i,dp[i][0],dp[i][1]);
	}*/
	return dp[0][1];
}

Compilation message

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

Subtask #1
2.0 / 2.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11092 KB Output is correct
2 Correct 2 ms 11096 KB Output is correct
3 Correct 3 ms 11096 KB Output is correct
4 Correct 3 ms 11096 KB Output is correct
5 Correct 3 ms 11096 KB Output is correct
6 Correct 3 ms 11096 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 2 ms 11096 KB Output is correct
9 Correct 3 ms 11096 KB Output is correct
10 Correct 26 ms 11352 KB Output is correct
11 Correct 44 ms 11604 KB Output is correct
12 Correct 3 ms 11096 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 2 ms 11096 KB Output is correct
3 Correct 9 ms 11096 KB Output is correct
4 Correct 9 ms 11096 KB Output is correct
5 Correct 9 ms 11096 KB Output is correct
6 Correct 9 ms 11096 KB Output is correct
7 Correct 10 ms 11096 KB Output is correct
8 Correct 9 ms 11252 KB Output is correct
9 Correct 2 ms 11092 KB Output is correct
10 Correct 2 ms 11096 KB Output is correct
11 Correct 3 ms 11096 KB Output is correct
12 Correct 3 ms 11096 KB Output is correct
13 Correct 3 ms 11096 KB Output is correct
14 Correct 3 ms 11096 KB Output is correct
15 Correct 3 ms 11096 KB Output is correct
16 Correct 2 ms 11096 KB Output is correct
17 Correct 3 ms 11096 KB Output is correct
18 Correct 26 ms 11352 KB Output is correct
19 Correct 44 ms 11604 KB Output is correct
20 Correct 3 ms 11096 KB Output is correct
21 Correct 3 ms 11096 KB Output is correct
22 Correct 3 ms 11096 KB Output is correct
23 Correct 2 ms 11096 KB Output is correct
24 Correct 3 ms 11096 KB Output is correct
25 Correct 3 ms 11096 KB Output is correct
26 Correct 3 ms 11096 KB Output is correct
27 Correct 4 ms 11096 KB Output is correct
28 Correct 4 ms 11096 KB Output is correct
29 Correct 9 ms 11096 KB Output is correct
30 Correct 9 ms 11096 KB Output is correct
31 Correct 2 ms 11096 KB Output is correct
32 Correct 3 ms 11096 KB Output is correct
33 Correct 3 ms 11096 KB Output is correct
34 Correct 3 ms 11348 KB Output is correct
35 Correct 8 ms 11256 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 34 ms 11356 KB Output is correct
38 Correct 96 ms 11356 KB Output is correct
39 Correct 3 ms 11096 KB Output is correct
40 Correct 3 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 4 ms 11096 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 13156 KB Output is correct
2 Correct 682 ms 17016 KB Output is correct
3 Correct 651 ms 16868 KB Output is correct
4 Correct 649 ms 16868 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 13156 KB Output is correct
2 Correct 682 ms 17016 KB Output is correct
3 Correct 651 ms 16868 KB Output is correct
4 Correct 649 ms 16868 KB Output is correct
5 Execution timed out 3024 ms 13168 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11092 KB Output is correct
2 Correct 2 ms 11096 KB Output is correct
3 Correct 3 ms 11096 KB Output is correct
4 Correct 3 ms 11096 KB Output is correct
5 Correct 3 ms 11096 KB Output is correct
6 Correct 3 ms 11096 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 2 ms 11096 KB Output is correct
9 Correct 3 ms 11096 KB Output is correct
10 Correct 26 ms 11352 KB Output is correct
11 Correct 44 ms 11604 KB Output is correct
12 Correct 3 ms 11096 KB Output is correct
13 Correct 452 ms 13156 KB Output is correct
14 Correct 682 ms 17016 KB Output is correct
15 Correct 651 ms 16868 KB Output is correct
16 Correct 649 ms 16868 KB Output is correct
17 Execution timed out 3024 ms 13168 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 2 ms 11096 KB Output is correct
3 Correct 9 ms 11096 KB Output is correct
4 Correct 9 ms 11096 KB Output is correct
5 Correct 9 ms 11096 KB Output is correct
6 Correct 9 ms 11096 KB Output is correct
7 Correct 10 ms 11096 KB Output is correct
8 Correct 9 ms 11252 KB Output is correct
9 Correct 2 ms 11092 KB Output is correct
10 Correct 2 ms 11096 KB Output is correct
11 Correct 3 ms 11096 KB Output is correct
12 Correct 3 ms 11096 KB Output is correct
13 Correct 3 ms 11096 KB Output is correct
14 Correct 3 ms 11096 KB Output is correct
15 Correct 3 ms 11096 KB Output is correct
16 Correct 2 ms 11096 KB Output is correct
17 Correct 3 ms 11096 KB Output is correct
18 Correct 26 ms 11352 KB Output is correct
19 Correct 44 ms 11604 KB Output is correct
20 Correct 3 ms 11096 KB Output is correct
21 Correct 3 ms 11096 KB Output is correct
22 Correct 3 ms 11096 KB Output is correct
23 Correct 2 ms 11096 KB Output is correct
24 Correct 3 ms 11096 KB Output is correct
25 Correct 3 ms 11096 KB Output is correct
26 Correct 3 ms 11096 KB Output is correct
27 Correct 4 ms 11096 KB Output is correct
28 Correct 4 ms 11096 KB Output is correct
29 Correct 9 ms 11096 KB Output is correct
30 Correct 9 ms 11096 KB Output is correct
31 Correct 2 ms 11096 KB Output is correct
32 Correct 3 ms 11096 KB Output is correct
33 Correct 3 ms 11096 KB Output is correct
34 Correct 3 ms 11348 KB Output is correct
35 Correct 8 ms 11256 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 34 ms 11356 KB Output is correct
38 Correct 96 ms 11356 KB Output is correct
39 Correct 3 ms 11096 KB Output is correct
40 Correct 3 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 4 ms 11096 KB Output is correct
43 Execution timed out 3088 ms 11352 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 2 ms 11096 KB Output is correct
3 Correct 9 ms 11096 KB Output is correct
4 Correct 9 ms 11096 KB Output is correct
5 Correct 9 ms 11096 KB Output is correct
6 Correct 9 ms 11096 KB Output is correct
7 Correct 10 ms 11096 KB Output is correct
8 Correct 9 ms 11252 KB Output is correct
9 Correct 2 ms 11092 KB Output is correct
10 Correct 2 ms 11096 KB Output is correct
11 Correct 3 ms 11096 KB Output is correct
12 Correct 3 ms 11096 KB Output is correct
13 Correct 3 ms 11096 KB Output is correct
14 Correct 3 ms 11096 KB Output is correct
15 Correct 3 ms 11096 KB Output is correct
16 Correct 2 ms 11096 KB Output is correct
17 Correct 3 ms 11096 KB Output is correct
18 Correct 26 ms 11352 KB Output is correct
19 Correct 44 ms 11604 KB Output is correct
20 Correct 3 ms 11096 KB Output is correct
21 Correct 3 ms 11096 KB Output is correct
22 Correct 3 ms 11096 KB Output is correct
23 Correct 2 ms 11096 KB Output is correct
24 Correct 3 ms 11096 KB Output is correct
25 Correct 3 ms 11096 KB Output is correct
26 Correct 3 ms 11096 KB Output is correct
27 Correct 4 ms 11096 KB Output is correct
28 Correct 4 ms 11096 KB Output is correct
29 Correct 9 ms 11096 KB Output is correct
30 Correct 9 ms 11096 KB Output is correct
31 Correct 2 ms 11096 KB Output is correct
32 Correct 3 ms 11096 KB Output is correct
33 Correct 3 ms 11096 KB Output is correct
34 Correct 3 ms 11348 KB Output is correct
35 Correct 8 ms 11256 KB Output is correct
36 Correct 17 ms 11352 KB Output is correct
37 Correct 34 ms 11356 KB Output is correct
38 Correct 96 ms 11356 KB Output is correct
39 Correct 3 ms 11096 KB Output is correct
40 Correct 3 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 4 ms 11096 KB Output is correct
43 Correct 452 ms 13156 KB Output is correct
44 Correct 682 ms 17016 KB Output is correct
45 Correct 651 ms 16868 KB Output is correct
46 Correct 649 ms 16868 KB Output is correct
47 Execution timed out 3024 ms 13168 KB Time limit exceeded
48 Halted 0 ms 0 KB -