oj.uz

답안 #719021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719021 2023-04-05T08:40:43 Z baojiaopisu 디지털 회로 (IOI22_circuit) C++17
2 / 100
 30 ms 2120 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1000002022; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1000 + 10;

vector<int> g[N];
ll dp[N][2], f[N][N];

int n, m;
vector<int> state;
void init(int N, int M, vector<int> p, vector<int> A) {
	for(int i = 1; i < N + M; i++) {
		g[p[i]].pb(i);
	}
	n = N; m = M;
	state = A;
}

void dfs(int u) {
	if(u >= n) return;
	for(int i = 0; i <= g[u].size(); i++) f[u][i] = 0;
	f[u][0] = 1;
	for(auto v : g[u]) {
		dfs(v);
		for(int i = g[u].size(); i >= 0; i--) {
			f[u][i] = f[u][i] * dp[v][0] % MOD;
			if(i > 0) f[u][i] += f[u][i - 1] * dp[v][1] % MOD;
			f[u][i] %= MOD;
		}
	}

	dp[u][0] = dp[u][1] = 0;
	for(int i = 0; i <= g[u].size(); i++) {
		dp[u][1] += f[u][i] * i % MOD;
		dp[u][0] += f[u][i] * (g[u].size() - i) % MOD;
		dp[u][0] %= MOD;
		dp[u][1] %= MOD;
	}
}

ll count_ways(int l, int r) {
	l -= n;
	r -= n;
	for(int i = l; i <= r; i++) state[i] ^= 1;

	for(int i = n; i < n + m; i++) {
		dp[i][1] = state[i - n];
		dp[i][0] = state[i - n] ^ 1;
	}

	dfs(0);
	return dp[0][1];
}

Compilation message

circuit.cpp: In function 'void dfs(int)':
circuit.cpp:87:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |  for(int i = 0; i <= g[u].size(); i++) f[u][i] = 0;
      |                 ~~^~~~~~~~~~~~~~
circuit.cpp:99:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for(int i = 0; i <= g[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 23 ms 336 KB Output is correct
4 Correct 30 ms 336 KB Output is correct
5 Correct 29 ms 380 KB Output is correct
6 Correct 25 ms 336 KB Output is correct
7 Correct 20 ms 336 KB Output is correct
8 Correct 20 ms 376 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 1360 KB Output is correct
3 Runtime error 1 ms 464 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 23 ms 336 KB Output is correct
4 Correct 30 ms 336 KB Output is correct
5 Correct 29 ms 380 KB Output is correct
6 Correct 25 ms 336 KB Output is correct
7 Correct 20 ms 336 KB Output is correct
8 Correct 20 ms 376 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 1360 KB Output is correct
11 Runtime error 1 ms 464 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 2120 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 2120 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 1360 KB Output is correct
3 Runtime error 1 ms 464 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 23 ms 336 KB Output is correct
4 Correct 30 ms 336 KB Output is correct
5 Correct 29 ms 380 KB Output is correct
6 Correct 25 ms 336 KB Output is correct
7 Correct 20 ms 336 KB Output is correct
8 Correct 20 ms 376 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 1360 KB Output is correct
11 Runtime error 1 ms 464 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 23 ms 336 KB Output is correct
4 Correct 30 ms 336 KB Output is correct
5 Correct 29 ms 380 KB Output is correct
6 Correct 25 ms 336 KB Output is correct
7 Correct 20 ms 336 KB Output is correct
8 Correct 20 ms 376 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 1360 KB Output is correct
11 Runtime error 1 ms 464 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -