Submission #1024432

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024432		vjudge1	디지털 회로 (IOI22_circuit)	C++17	18 / 100	3062 ms	6488 KiB

circuit

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int, int> pii;

const int MOD = 1000002022;
const int maxn = 1e5 + 100;

int n, k;
int p[maxn];
vector<int> g[maxn];
int a[maxn];
ll dp[2][maxn];

void init(int N, int M, std::vector<int> P, std::vector<int> A){
	int n = N + M; k = N;
	for(int i = 1; i <= n; i++){
		p[i] = P[i-1]; p[i]++;
		g[p[i]].push_back(i);
	}
	for(int i = k + 1; i <= n; i++){
		a[i] = A[i - k - 1];
		dp[a[i]][i] = 1;
		dp[a[i]^1][i] = 0;
	}
}

int count_ways(int L, int R){
	for(int i = L + 1; i <= R + 1; i++){
		a[i] ^= 1;
		dp[a[i]][i] = 1;
		dp[a[i]^1][i] = 0;
	}
	for(int v = k; v > 0; v--){
		vector<ll> d(g[v].size() + 1, 0);
		d[0] = 1; dp[1][v] = dp[0][v] = 0;
		for(int to: g[v]){
			for(int cnt = g[v].size(); cnt >= 0; cnt--){
				d[cnt] = d[cnt] * dp[0][to] % MOD;
				if(cnt) d[cnt] = (d[cnt] + d[cnt-1] * dp[1][to]) % MOD;
			}
		}
		for(int cnt = 0; cnt <= g[v].size(); cnt++){
			dp[1][v] = (dp[1][v] + d[cnt] * cnt) % MOD;
			dp[0][v] = (dp[0][v] + d[cnt] * (g[v].size() - cnt)) % MOD;
		}
	}
	return dp[1][1];
}

Compilation message (stderr)

circuit.cpp: In function 'int count_ways(int, int)':
circuit.cpp:43:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for(int cnt = 0; cnt <= g[v].size(); cnt++){
      |                    ~~~~^~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11