oj.uz

답안 #759378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759378 2023-06-16T08:53:18 Z amunduzbaev 디지털 회로 (IOI22_circuit) C++17
0 / 100
 449 ms 5236 KB 
#include "circuit.h"

#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "stub.cpp"
#endif

#define ar array
typedef long long ll;

const int N = 1e5 + 5;

struct ST{
	ar<int, 2> tree[N << 2];
	int c[N << 2];
	
	void push(int x, int lx, int rx){
		if(lx == rx) return;
		if(c[x]){
			swap(tree[x << 1][0], tree[x << 1 | 1][0]);
			swap(tree[x << 1][1], tree[x << 1 | 1][1]);
			c[x << 1] ^= 1, c[x << 1 | 1] ^= 1;
		}
		
		c[x] = 0;
	}
	
	void set(int i, int v, int lx, int rx, int x){
		if(lx == rx){
			tree[x][0] = v;
			return;
		}
		push(x, lx, rx);
		int m = (lx + rx) >> 1;
		if(i <= m) set(i, v, lx, m, x << 1);
		else set(i, v, m + 1, rx, x << 1 | 1);
		tree[x][0] = (tree[x << 1][0] + tree[x << 1 | 1][0]);
		tree[x][1] = (tree[x << 1][1] + tree[x << 1 | 1][1]);
	}
	
	void set(int i, int v){
		set(i, v, 0, N, 1);
	}
	
	void togl(int l, int r, int lx, int rx, int x){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			c[x] ^= 1;
			swap(tree[x][0], tree[x][1]);
			return;
		}
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		togl(l, r, lx, m, x << 1);
		togl(l, r, m + 1, rx, x << 1 | 1);
		tree[x][0] = (tree[x << 1][0] + tree[x << 1 | 1][0]);
		tree[x][1] = (tree[x << 1][1] + tree[x << 1 | 1][1]);
	}
	
	void togl(int l, int r){
		togl(l, r, 0, N, 1);
	}
}tree;

const int mod = 1'000'002'022;
int N_;

void init(int n, int m, vector<int> p, vector<int> a) {
	vector<vector<int>> edges(n + m);
	for(int i=1;i<n+m;i++){
		edges[p[i]].push_back(i);
	}
	
	vector<int> dp(n + m), up(n + m);
	
	function<void(int)> dfs = [&](int u){
		dp[u] = max(1, (int)edges[u].size());
		for(auto x : edges[u]){
			dfs(x);
			dp[u] = dp[u] * 1ll * dp[x] % mod;
		}
	};
	
	dfs(0);
	//~ for(int i=0;i<n+m;i++){
		//~ cout<<dp[i]<<" ";
	//~ }
	//~ cout<<"\n";
	
	function<void(int)> re = [&](int u){
		int pref = 1;
		vector<int> suff(edges[u].size() + 1);
		suff.back() = 1;
		for(int i=(int)edges[u].size() - 1;~i;i--){
			suff[i] = suff[i + 1] * 1ll * dp[edges[u][i]];
		}
		
		for(int i=0;i<(int)edges[u].size();i++){
			up[edges[u][i]] = up[u] * 1ll * suff[i + 1] % mod * 1ll * pref % mod;
			pref = pref * 1ll * dp[edges[u][i]];
			re(edges[u][i]);
		}
	};
	
	up[0] = 1;
	re(0);
	for(int i=n;i<n+m;i++){
		tree.set(i - n, up[i]);
		if(a[i - n]) tree.togl(i - n, i - n);
	}
	
	N_ = n;
}

int count_ways(int l, int r) {
	l -= N_, r -= N_;
	tree.togl(l, r);
	return tree.tree[1][1];
	//~ cout<<tree.tree[1]<<"\n";
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB 3rd lines differ - on the 1st token, expected: '489', found: '514'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '-1782334720'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB 3rd lines differ - on the 1st token, expected: '489', found: '514'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 5236 KB 1st lines differ - on the 1st token, expected: '431985922', found: '-747097920'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 5236 KB 1st lines differ - on the 1st token, expected: '431985922', found: '-747097920'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '-1782334720'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB 3rd lines differ - on the 1st token, expected: '489', found: '514'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB 3rd lines differ - on the 1st token, expected: '489', found: '514'
4 Halted 0 ms 0 KB -