oj.uz

Submission #835818

# Submission time Handle Problem Language Result Execution time Memory
835818 2023-08-23T20:57:48 Z APROHACK Digital Circuit (IOI22_circuit) C++17
22 / 100
 3000 ms 49236 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;

#define isCase4 false  


// seg tree

ll sumaUno[200005*4];
ll sumaCero[200005*4];
bool lazy[200005*4];
ll aux1[200005];
ll aux0[200005];
int mid[200005*4];
void upd(int node);
void cambiar(int node, int dd, int ht, int l, int r);
void generate(int node, int dd, int ht){
	mid[node] = (dd + ht)/2;
	if(dd == ht){
		sumaUno[node] = aux1[dd];
		sumaCero[node] = aux0[dd];
	}else{
		generate(node*2, dd, mid[node]);
		generate(node * 2 + 1, mid[node] + 1, ht );
		upd(node);
	}
}
ll get1(int node){
	if(lazy[node]){
		return sumaCero[node];
	}else return sumaUno[node];
}
ll get0(int node){
	if(lazy[node]){
		return sumaUno[node];
	}else return sumaCero[node];
}
void upd(int node){
	sumaUno[node] = (get1(node*2) + get1(node*2+1))%MOD;
	sumaCero[node] = (get0(node*2) + get0(node*2+1))%MOD;
}
void prop(int node, int dd, int ht){
	if(lazy[node] ){
		//cout << "propagating from " << dd << " " << ht << endl;
		if(dd == ht)swap(sumaCero[node], sumaUno[node]);
		else{
			cambiar(node*2, dd, mid[node], dd, mid[node]);
			cambiar(node*2+1, mid[node] + 1, ht, mid[node] + 1, ht);
		}
	}
}
void cambiar(int node, int dd, int ht, int l, int r){
	if(dd == l and ht == r){
		lazy[node] = !lazy[node];
		//cout << "node " << dd << " " << ht << " exc " << lazy[node] << endl;
	}
	else{
		prop(node, dd, ht);
		lazy[node] = 0;
		if(r <= mid[node])cambiar(node * 2, dd, mid[node], l, r);
		else if(mid[node] < l)cambiar(node*2+1, mid[node]+1, ht, l, r);
		else{
			cambiar(node*2, dd, mid[node], l, mid[node]);
			cambiar(node*2+1, mid[node]+1, ht, mid[node] + 1, r);
		}
		upd(node);
		//cout << "node " << dd << " " << ht << " updated ";
		//cout << get1(node) << " " << get0(node) << endl;
	}
}


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;
		sumaUno[node] = 0;
		sumaCero[node] = 0;
		if(state[node])aux1[node] = aporte[node];
		else aux0[node] = aporte[node];
		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];
	}
	memset(past, -1, sizeof past);
	memset(lazy, false, sizeof lazy);
	generate(0);
	ans = encen[0][0];
	if(isCase4  or (  casito and (n > 1000 or m > 1000) ) ){
		precalc(0);
		calcPrefix(0, 1);
		generate(1, n, n+m-1);
	}

	
}

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 (  casito and (n > 1000 or m > 1000) ) ){
		cambiar(1, n, n+m-1, L, R);
		return get1(1);
	}
	else generate(0);
	return encen[0][0];
}

Compilation message

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 37072 KB Output is correct
2 Correct 15 ms 37124 KB Output is correct
3 Correct 143 ms 48456 KB Output is correct
4 Correct 153 ms 49120 KB Output is correct
5 Correct 156 ms 49088 KB Output is correct
6 Correct 167 ms 49096 KB Output is correct
7 Correct 148 ms 49120 KB Output is correct
8 Correct 149 ms 49096 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 37200 KB Output is correct
2 Correct 15 ms 37200 KB Output is correct
3 Correct 15 ms 37200 KB Output is correct
4 Correct 15 ms 37200 KB Output is correct
5 Correct 15 ms 37200 KB Output is correct
6 Correct 18 ms 37328 KB Output is correct
7 Correct 17 ms 37200 KB Output is correct
8 Correct 16 ms 37200 KB Output is correct
9 Correct 15 ms 37200 KB Output is correct
10 Correct 16 ms 37328 KB Output is correct
11 Correct 16 ms 37328 KB Output is correct
12 Correct 16 ms 37200 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 37072 KB Output is correct
2 Correct 15 ms 37124 KB Output is correct
3 Correct 143 ms 48456 KB Output is correct
4 Correct 153 ms 49120 KB Output is correct
5 Correct 156 ms 49088 KB Output is correct
6 Correct 167 ms 49096 KB Output is correct
7 Correct 148 ms 49120 KB Output is correct
8 Correct 149 ms 49096 KB Output is correct
9 Correct 15 ms 37200 KB Output is correct
10 Correct 15 ms 37200 KB Output is correct
11 Correct 15 ms 37200 KB Output is correct
12 Correct 15 ms 37200 KB Output is correct
13 Correct 15 ms 37200 KB Output is correct
14 Correct 18 ms 37328 KB Output is correct
15 Correct 17 ms 37200 KB Output is correct
16 Correct 16 ms 37200 KB Output is correct
17 Correct 15 ms 37200 KB Output is correct
18 Correct 16 ms 37328 KB Output is correct
19 Correct 16 ms 37328 KB Output is correct
20 Correct 16 ms 37200 KB Output is correct
21 Correct 16 ms 37200 KB Output is correct
22 Correct 15 ms 37200 KB Output is correct
23 Correct 15 ms 37200 KB Output is correct
24 Correct 16 ms 37200 KB Output is correct
25 Correct 17 ms 37308 KB Output is correct
26 Correct 16 ms 37200 KB Output is correct
27 Correct 16 ms 37200 KB Output is correct
28 Correct 18 ms 37252 KB Output is correct
29 Correct 150 ms 49020 KB Output is correct
30 Correct 165 ms 49124 KB Output is correct
31 Correct 15 ms 37200 KB Output is correct
32 Correct 16 ms 37184 KB Output is correct
33 Correct 19 ms 37200 KB Output is correct
34 Correct 16 ms 37244 KB Output is correct
35 Correct 34 ms 38480 KB Output is correct
36 Correct 16 ms 37232 KB Output is correct
37 Correct 160 ms 49228 KB Output is correct
38 Correct 163 ms 49236 KB Output is correct
39 Correct 15 ms 37172 KB Output is correct
40 Correct 15 ms 37200 KB Output is correct
41 Correct 16 ms 37200 KB Output is correct
42 Correct 17 ms 37328 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 42816 KB Output is correct
2 Correct 733 ms 48496 KB Output is correct
3 Correct 628 ms 48072 KB Output is correct
4 Correct 931 ms 48036 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 42816 KB Output is correct
2 Correct 733 ms 48496 KB Output is correct
3 Correct 628 ms 48072 KB Output is correct
4 Correct 931 ms 48036 KB Output is correct
5 Correct 1006 ms 42824 KB Output is correct
6 Correct 1981 ms 48472 KB Output is correct
7 Correct 1748 ms 48536 KB Output is correct
8 Execution timed out 3081 ms 48464 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 37200 KB Output is correct
2 Correct 15 ms 37200 KB Output is correct
3 Correct 15 ms 37200 KB Output is correct
4 Correct 15 ms 37200 KB Output is correct
5 Correct 15 ms 37200 KB Output is correct
6 Correct 18 ms 37328 KB Output is correct
7 Correct 17 ms 37200 KB Output is correct
8 Correct 16 ms 37200 KB Output is correct
9 Correct 15 ms 37200 KB Output is correct
10 Correct 16 ms 37328 KB Output is correct
11 Correct 16 ms 37328 KB Output is correct
12 Correct 16 ms 37200 KB Output is correct
13 Correct 540 ms 42816 KB Output is correct
14 Correct 733 ms 48496 KB Output is correct
15 Correct 628 ms 48072 KB Output is correct
16 Correct 931 ms 48036 KB Output is correct
17 Correct 1006 ms 42824 KB Output is correct
18 Correct 1981 ms 48472 KB Output is correct
19 Correct 1748 ms 48536 KB Output is correct
20 Execution timed out 3081 ms 48464 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 37072 KB Output is correct
2 Correct 15 ms 37124 KB Output is correct
3 Correct 143 ms 48456 KB Output is correct
4 Correct 153 ms 49120 KB Output is correct
5 Correct 156 ms 49088 KB Output is correct
6 Correct 167 ms 49096 KB Output is correct
7 Correct 148 ms 49120 KB Output is correct
8 Correct 149 ms 49096 KB Output is correct
9 Correct 15 ms 37200 KB Output is correct
10 Correct 15 ms 37200 KB Output is correct
11 Correct 15 ms 37200 KB Output is correct
12 Correct 15 ms 37200 KB Output is correct
13 Correct 15 ms 37200 KB Output is correct
14 Correct 18 ms 37328 KB Output is correct
15 Correct 17 ms 37200 KB Output is correct
16 Correct 16 ms 37200 KB Output is correct
17 Correct 15 ms 37200 KB Output is correct
18 Correct 16 ms 37328 KB Output is correct
19 Correct 16 ms 37328 KB Output is correct
20 Correct 16 ms 37200 KB Output is correct
21 Correct 16 ms 37200 KB Output is correct
22 Correct 15 ms 37200 KB Output is correct
23 Correct 15 ms 37200 KB Output is correct
24 Correct 16 ms 37200 KB Output is correct
25 Correct 17 ms 37308 KB Output is correct
26 Correct 16 ms 37200 KB Output is correct
27 Correct 16 ms 37200 KB Output is correct
28 Correct 18 ms 37252 KB Output is correct
29 Correct 150 ms 49020 KB Output is correct
30 Correct 165 ms 49124 KB Output is correct
31 Correct 15 ms 37200 KB Output is correct
32 Correct 16 ms 37184 KB Output is correct
33 Correct 19 ms 37200 KB Output is correct
34 Correct 16 ms 37244 KB Output is correct
35 Correct 34 ms 38480 KB Output is correct
36 Correct 16 ms 37232 KB Output is correct
37 Correct 160 ms 49228 KB Output is correct
38 Correct 163 ms 49236 KB Output is correct
39 Correct 15 ms 37172 KB Output is correct
40 Correct 15 ms 37200 KB Output is correct
41 Correct 16 ms 37200 KB Output is correct
42 Correct 17 ms 37328 KB Output is correct
43 Execution timed out 3062 ms 37456 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 37072 KB Output is correct
2 Correct 15 ms 37124 KB Output is correct
3 Correct 143 ms 48456 KB Output is correct
4 Correct 153 ms 49120 KB Output is correct
5 Correct 156 ms 49088 KB Output is correct
6 Correct 167 ms 49096 KB Output is correct
7 Correct 148 ms 49120 KB Output is correct
8 Correct 149 ms 49096 KB Output is correct
9 Correct 15 ms 37200 KB Output is correct
10 Correct 15 ms 37200 KB Output is correct
11 Correct 15 ms 37200 KB Output is correct
12 Correct 15 ms 37200 KB Output is correct
13 Correct 15 ms 37200 KB Output is correct
14 Correct 18 ms 37328 KB Output is correct
15 Correct 17 ms 37200 KB Output is correct
16 Correct 16 ms 37200 KB Output is correct
17 Correct 15 ms 37200 KB Output is correct
18 Correct 16 ms 37328 KB Output is correct
19 Correct 16 ms 37328 KB Output is correct
20 Correct 16 ms 37200 KB Output is correct
21 Correct 16 ms 37200 KB Output is correct
22 Correct 15 ms 37200 KB Output is correct
23 Correct 15 ms 37200 KB Output is correct
24 Correct 16 ms 37200 KB Output is correct
25 Correct 17 ms 37308 KB Output is correct
26 Correct 16 ms 37200 KB Output is correct
27 Correct 16 ms 37200 KB Output is correct
28 Correct 18 ms 37252 KB Output is correct
29 Correct 150 ms 49020 KB Output is correct
30 Correct 165 ms 49124 KB Output is correct
31 Correct 15 ms 37200 KB Output is correct
32 Correct 16 ms 37184 KB Output is correct
33 Correct 19 ms 37200 KB Output is correct
34 Correct 16 ms 37244 KB Output is correct
35 Correct 34 ms 38480 KB Output is correct
36 Correct 16 ms 37232 KB Output is correct
37 Correct 160 ms 49228 KB Output is correct
38 Correct 163 ms 49236 KB Output is correct
39 Correct 15 ms 37172 KB Output is correct
40 Correct 15 ms 37200 KB Output is correct
41 Correct 16 ms 37200 KB Output is correct
42 Correct 17 ms 37328 KB Output is correct
43 Correct 540 ms 42816 KB Output is correct
44 Correct 733 ms 48496 KB Output is correct
45 Correct 628 ms 48072 KB Output is correct
46 Correct 931 ms 48036 KB Output is correct
47 Correct 1006 ms 42824 KB Output is correct
48 Correct 1981 ms 48472 KB Output is correct
49 Correct 1748 ms 48536 KB Output is correct
50 Execution timed out 3081 ms 48464 KB Time limit exceeded
51 Halted 0 ms 0 KB -