oj.uz

Submission #835766

# Submission time Handle Problem Language Result Execution time Memory
835766 2023-08-23T19:24:11 Z APROHACK Digital Circuit (IOI22_circuit) C++17
22 / 100
 3000 ms 48452 KB 
#include "circuit.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int n, m;
vector<int>child[200001];
bool state[200001];
ll encen[200001][2]; // encendido y apagado
const ll MOD = 1000002022;
ll past[2002][2002];
void generate(int node);
int parent[200002];
bool casito = true;
ll aporte[200002];
ll prefix[200002];
ll T[200002];
ll ans = 0;

ll aporteTodos;
ll cuenta1 = 0;
#define isCase4 false 
void precalc(int node){
	T[node] = 1;
	if(node >= n)return ;
	for(int i = 0 ; i < child[node].size() ; i ++){
		precalc(child[node][i]);
		T[node]  = T[node] * T[child[node][i]] % MOD;
	}	
	T[node] = T[node] * (ll)child[node].size() % MOD;
}
void calcPrefix(int node, ll acum){
	if(node >= n){
		aporte[node] = acum;	
		//cout << "aporte de " << node << ": " << acum << endl;
		aporteTodos = acum;
		return ;
	}
	int hijo1 = child[node][0];
	int hijo2 = child[node][1];
	calcPrefix(hijo1, (acum * T[hijo2]) % MOD);
	calcPrefix(hijo2, (acum * T[hijo1]) % MOD);
}


//
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
	n = N;
	m = M;
	if( m != n+1 )casito = false;
	for(int i = 0 ; i < n+m ; i ++){
		if(P[i] != -1){
			child[P[i]].pb(i);
			if(P[i] != (i-1)/2)casito = false;
		}
		parent[i] = P[i];
	}
	int temp = m;
	while(temp != 1){
		if(temp % 2 == 1)casito = false;
		temp /= 2;
	}
	//assert(casito);
	for(int i = N ; i <= N+M ; i ++){
		state[i] = A[i-N];
		if(state[i])cuenta1 ++ ;
	}
	memset(past, -1, sizeof past);
	generate(0);
	ans = encen[0][0];
	if(isCase4  or (  casito and (n > 1000 or m > 1000) ) ){
		precalc(0);
		calcPrefix(0, 1);
		prefix[0] = 0;
		for(int i = 1 ; i < N+M ; i ++){
			prefix[i] = (prefix[i-1] + aporte[i]) % MOD;	
		}
	}

	
}

ll mem[2002][2002];
ll currentIt = -1 ;
void newDp(){
	currentIt++;
}
ll dp(int parent, ll i, int k){
	if(k < 0)return 0;
	if(i == child[parent].size() and k > 0)return 0;
	else if(i == child[parent].size()) return 1;
	if(past[i][k] == currentIt)return mem[i][k];
	past[i][k] = currentIt;
	return mem[i][k] = ((dp(parent, i+1, k-1) * encen[child[parent][i]][0] % MOD) + ((dp(parent, i+1, k) * encen[child[parent][i]][1])%MOD))%MOD;
}

void generate(int node){
	if(node >= n){
		if(state[node]){
			encen[node][0] = 1;
			encen[node][1] = 0;
		}else{
			encen[node][0] = 0;
			encen[node][1] = 1;

		}
		return ;
	}
	for(int i = 0 ; i < child[node].size() ; i ++){
		generate(child[node][i]);
	}
	newDp();
	ll enc = 0, inv = 0;
	for(ll i = 1 ; i <= child[node].size() ; i ++){
		enc += dp(node, 0, i) * i % MOD;
		enc %= MOD;
	}
	ll allWays = 1;
	for(int i = 0 ; i < child[node].size() ; i ++){
		allWays *= (encen[child[node][i]][0] + encen[child[node][i]][1])%MOD;
		allWays %= MOD;
	}
	allWays *= (ll)child[node].size();
	allWays %= MOD;
	encen[node][0] = enc;
	encen[node][1] = ((allWays - enc) + MOD) % MOD;
	//cout << "for node " << node << " there are " << encen[node][0] << ", " << encen[node][1] << "\n";
}
	

int count_ways(int L, int R) {
	for(int i = L ; i <= R ; i ++){
		state[i] = !state[i];
	}
	if(isCase4  or ( L == R and casito and (n > 1000 or m > 1000) ) ){
		if(state[L])cuenta1 ++ ;
		else cuenta1 --;
		return (cuenta1 * aporteTodos)%MOD;
	}
	else generate(0);
	return encen[0][0];
}

Compilation message

circuit.cpp: In function 'void precalc(int)':
circuit.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i = 0 ; i < child[node].size() ; i ++){
      |                  ~~^~~~~~~~~~~~~~~~~~~~
circuit.cpp: In function 'long long int dp(int, long long int, int)':
circuit.cpp:92:7: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |  if(i == child[parent].size() and k > 0)return 0;
      |     ~~^~~~~~~~~~~~~~~~~~~~~~~
circuit.cpp:93:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |  else if(i == child[parent].size()) return 1;
      |          ~~^~~~~~~~~~~~~~~~~~~~~~~
circuit.cpp: In function 'void generate(int)':
circuit.cpp:111:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |  for(int i = 0 ; i < child[node].size() ; i ++){
      |                  ~~^~~~~~~~~~~~~~~~~~~~
circuit.cpp:116:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |  for(ll i = 1 ; i <= child[node].size() ; i ++){
      |                 ~~^~~~~~~~~~~~~~~~~~~~~
circuit.cpp:121:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |  for(int i = 0 ; i < child[node].size() ; i ++){
      |                  ~~^~~~~~~~~~~~~~~~~~~~
circuit.cpp:115:14: warning: unused variable 'inv' [-Wunused-variable]
  115 |  ll enc = 0, inv = 0;
      |              ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36304 KB Output is correct
2 Correct 15 ms 36384 KB Output is correct
3 Correct 156 ms 47792 KB Output is correct
4 Correct 165 ms 48232 KB Output is correct
5 Correct 171 ms 48332 KB Output is correct
6 Correct 154 ms 48288 KB Output is correct
7 Correct 166 ms 48440 KB Output is correct
8 Correct 147 ms 48232 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36396 KB Output is correct
2 Correct 15 ms 36396 KB Output is correct
3 Correct 15 ms 36392 KB Output is correct
4 Correct 15 ms 36372 KB Output is correct
5 Correct 15 ms 36340 KB Output is correct
6 Correct 15 ms 36352 KB Output is correct
7 Correct 16 ms 36504 KB Output is correct
8 Correct 16 ms 36576 KB Output is correct
9 Correct 16 ms 36432 KB Output is correct
10 Correct 16 ms 36432 KB Output is correct
11 Correct 17 ms 36456 KB Output is correct
12 Correct 15 ms 36388 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36304 KB Output is correct
2 Correct 15 ms 36384 KB Output is correct
3 Correct 156 ms 47792 KB Output is correct
4 Correct 165 ms 48232 KB Output is correct
5 Correct 171 ms 48332 KB Output is correct
6 Correct 154 ms 48288 KB Output is correct
7 Correct 166 ms 48440 KB Output is correct
8 Correct 147 ms 48232 KB Output is correct
9 Correct 15 ms 36396 KB Output is correct
10 Correct 15 ms 36396 KB Output is correct
11 Correct 15 ms 36392 KB Output is correct
12 Correct 15 ms 36372 KB Output is correct
13 Correct 15 ms 36340 KB Output is correct
14 Correct 15 ms 36352 KB Output is correct
15 Correct 16 ms 36504 KB Output is correct
16 Correct 16 ms 36576 KB Output is correct
17 Correct 16 ms 36432 KB Output is correct
18 Correct 16 ms 36432 KB Output is correct
19 Correct 17 ms 36456 KB Output is correct
20 Correct 15 ms 36388 KB Output is correct
21 Correct 16 ms 36452 KB Output is correct
22 Correct 19 ms 36480 KB Output is correct
23 Correct 15 ms 36412 KB Output is correct
24 Correct 15 ms 36496 KB Output is correct
25 Correct 16 ms 36484 KB Output is correct
26 Correct 15 ms 36432 KB Output is correct
27 Correct 17 ms 36524 KB Output is correct
28 Correct 16 ms 36432 KB Output is correct
29 Correct 168 ms 48332 KB Output is correct
30 Correct 168 ms 48276 KB Output is correct
31 Correct 16 ms 36516 KB Output is correct
32 Correct 16 ms 36448 KB Output is correct
33 Correct 16 ms 36432 KB Output is correct
34 Correct 15 ms 36436 KB Output is correct
35 Correct 35 ms 37724 KB Output is correct
36 Correct 15 ms 36468 KB Output is correct
37 Correct 157 ms 48452 KB Output is correct
38 Correct 159 ms 48452 KB Output is correct
39 Correct 16 ms 36432 KB Output is correct
40 Correct 15 ms 36432 KB Output is correct
41 Correct 16 ms 36432 KB Output is correct
42 Correct 18 ms 36560 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 40708 KB Output is correct
2 Correct 795 ms 45188 KB Output is correct
3 Correct 732 ms 45116 KB Output is correct
4 Correct 742 ms 45084 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 40708 KB Output is correct
2 Correct 795 ms 45188 KB Output is correct
3 Correct 732 ms 45116 KB Output is correct
4 Correct 742 ms 45084 KB Output is correct
5 Execution timed out 3095 ms 40776 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36396 KB Output is correct
2 Correct 15 ms 36396 KB Output is correct
3 Correct 15 ms 36392 KB Output is correct
4 Correct 15 ms 36372 KB Output is correct
5 Correct 15 ms 36340 KB Output is correct
6 Correct 15 ms 36352 KB Output is correct
7 Correct 16 ms 36504 KB Output is correct
8 Correct 16 ms 36576 KB Output is correct
9 Correct 16 ms 36432 KB Output is correct
10 Correct 16 ms 36432 KB Output is correct
11 Correct 17 ms 36456 KB Output is correct
12 Correct 15 ms 36388 KB Output is correct
13 Correct 445 ms 40708 KB Output is correct
14 Correct 795 ms 45188 KB Output is correct
15 Correct 732 ms 45116 KB Output is correct
16 Correct 742 ms 45084 KB Output is correct
17 Execution timed out 3095 ms 40776 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36304 KB Output is correct
2 Correct 15 ms 36384 KB Output is correct
3 Correct 156 ms 47792 KB Output is correct
4 Correct 165 ms 48232 KB Output is correct
5 Correct 171 ms 48332 KB Output is correct
6 Correct 154 ms 48288 KB Output is correct
7 Correct 166 ms 48440 KB Output is correct
8 Correct 147 ms 48232 KB Output is correct
9 Correct 15 ms 36396 KB Output is correct
10 Correct 15 ms 36396 KB Output is correct
11 Correct 15 ms 36392 KB Output is correct
12 Correct 15 ms 36372 KB Output is correct
13 Correct 15 ms 36340 KB Output is correct
14 Correct 15 ms 36352 KB Output is correct
15 Correct 16 ms 36504 KB Output is correct
16 Correct 16 ms 36576 KB Output is correct
17 Correct 16 ms 36432 KB Output is correct
18 Correct 16 ms 36432 KB Output is correct
19 Correct 17 ms 36456 KB Output is correct
20 Correct 15 ms 36388 KB Output is correct
21 Correct 16 ms 36452 KB Output is correct
22 Correct 19 ms 36480 KB Output is correct
23 Correct 15 ms 36412 KB Output is correct
24 Correct 15 ms 36496 KB Output is correct
25 Correct 16 ms 36484 KB Output is correct
26 Correct 15 ms 36432 KB Output is correct
27 Correct 17 ms 36524 KB Output is correct
28 Correct 16 ms 36432 KB Output is correct
29 Correct 168 ms 48332 KB Output is correct
30 Correct 168 ms 48276 KB Output is correct
31 Correct 16 ms 36516 KB Output is correct
32 Correct 16 ms 36448 KB Output is correct
33 Correct 16 ms 36432 KB Output is correct
34 Correct 15 ms 36436 KB Output is correct
35 Correct 35 ms 37724 KB Output is correct
36 Correct 15 ms 36468 KB Output is correct
37 Correct 157 ms 48452 KB Output is correct
38 Correct 159 ms 48452 KB Output is correct
39 Correct 16 ms 36432 KB Output is correct
40 Correct 15 ms 36432 KB Output is correct
41 Correct 16 ms 36432 KB Output is correct
42 Correct 18 ms 36560 KB Output is correct
43 Execution timed out 3054 ms 36688 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 36304 KB Output is correct
2 Correct 15 ms 36384 KB Output is correct
3 Correct 156 ms 47792 KB Output is correct
4 Correct 165 ms 48232 KB Output is correct
5 Correct 171 ms 48332 KB Output is correct
6 Correct 154 ms 48288 KB Output is correct
7 Correct 166 ms 48440 KB Output is correct
8 Correct 147 ms 48232 KB Output is correct
9 Correct 15 ms 36396 KB Output is correct
10 Correct 15 ms 36396 KB Output is correct
11 Correct 15 ms 36392 KB Output is correct
12 Correct 15 ms 36372 KB Output is correct
13 Correct 15 ms 36340 KB Output is correct
14 Correct 15 ms 36352 KB Output is correct
15 Correct 16 ms 36504 KB Output is correct
16 Correct 16 ms 36576 KB Output is correct
17 Correct 16 ms 36432 KB Output is correct
18 Correct 16 ms 36432 KB Output is correct
19 Correct 17 ms 36456 KB Output is correct
20 Correct 15 ms 36388 KB Output is correct
21 Correct 16 ms 36452 KB Output is correct
22 Correct 19 ms 36480 KB Output is correct
23 Correct 15 ms 36412 KB Output is correct
24 Correct 15 ms 36496 KB Output is correct
25 Correct 16 ms 36484 KB Output is correct
26 Correct 15 ms 36432 KB Output is correct
27 Correct 17 ms 36524 KB Output is correct
28 Correct 16 ms 36432 KB Output is correct
29 Correct 168 ms 48332 KB Output is correct
30 Correct 168 ms 48276 KB Output is correct
31 Correct 16 ms 36516 KB Output is correct
32 Correct 16 ms 36448 KB Output is correct
33 Correct 16 ms 36432 KB Output is correct
34 Correct 15 ms 36436 KB Output is correct
35 Correct 35 ms 37724 KB Output is correct
36 Correct 15 ms 36468 KB Output is correct
37 Correct 157 ms 48452 KB Output is correct
38 Correct 159 ms 48452 KB Output is correct
39 Correct 16 ms 36432 KB Output is correct
40 Correct 15 ms 36432 KB Output is correct
41 Correct 16 ms 36432 KB Output is correct
42 Correct 18 ms 36560 KB Output is correct
43 Correct 445 ms 40708 KB Output is correct
44 Correct 795 ms 45188 KB Output is correct
45 Correct 732 ms 45116 KB Output is correct
46 Correct 742 ms 45084 KB Output is correct
47 Execution timed out 3095 ms 40776 KB Time limit exceeded
48 Halted 0 ms 0 KB -