oj.uz

Submission #737502

# Submission time Handle Problem Language Result Execution time Memory
737502 2023-05-07T08:54:04 Z minhcool Digital Circuit (IOI22_circuit) C++17
2 / 100
 11 ms 6404 KB 
#include "circuit.h"
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e3 + 5;

const int oo = 1e18 + 7, mod = 1000002022;

int n, m;
vector<int> Adj[N];

int arr[N];

int coor[N][N];
int pref[N], suff[N];

void dfs(int u){
	if(!Adj[u].size()) return;
	for(auto v : Adj[u]) dfs(v);
	pref[0] = coor[Adj[u][0]][m];
	for(int i = 1; i < Adj[u].size(); i++) pref[i] = (pref[i - 1] * coor[Adj[u][i]][m]) % mod;
	suff[Adj[u].size()] = 1;
	for(int i = Adj[u].size() - 1; i >= 0; i--) suff[i] = (suff[i + 1] * coor[Adj[u][i]][m]) % mod;
	//for(int i = 0; i < Adj[u].size(); i++) cout << pref[i] << " " << suff[i] << "\n";
	coor[u][m] = (pref[Adj[u].size() - 1] * Adj[u].size()) % mod;
	for(int i = 0; i < Adj[u].size(); i++){
		for(int j = 0; j < m; j++){
			int temp1 = (!i ? 1 : pref[i - 1]);
			temp1 = (temp1 * suff[i + 1]) % mod;
			temp1 = (temp1 * coor[Adj[u][i]][j]) % mod;
			coor[u][j] = (coor[u][j] + temp1) % mod;
		}
	}
	for(int i = 0; i <= m; i++) coor[u][i] = ((coor[u][i] % mod) + mod) % mod;
	//for(int i = 0; i <= m; i++) cout << u << " " << i << " " << coor[u][i] << "\n";
}

void init(int N, int M, vector<int> P, vector<int> A){
	n = N, m = M;
	for(int i = 1; i < n + m; i++) Adj[P[i]].pb(i);
	for(int i = 0; i < m; i++) arr[i] = A[i];
	for(int i = n; i < n + m; i++) coor[i][i - n] = coor[i][m] = 1;
	dfs(0);
	//for(int i = 0; i < m; i++) cout << coor[0][i] << " ";
	//cout << "\n";
}

int count_ways(int L, int R){
	L -= n, R -= n;
	for(int i = L; i <= R; i++) arr[i] ^= 1;
	int ans = 0;
	for(int i = 0; i < m; i++) ans = (ans + arr[i] * coor[0][i]) % mod;
	return ((ans % mod) + mod) % mod;
}

Compilation message

circuit.cpp:16:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   16 | const int oo = 1e18 + 7, mod = 1000002022;
      |                ~~~~~^~~
circuit.cpp: In function 'void dfs(int)':
circuit.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i = 1; i < Adj[u].size(); i++) pref[i] = (pref[i - 1] * coor[Adj[u][i]][m]) % mod;
      |                 ~~^~~~~~~~~~~~~~~
circuit.cpp:35:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(int i = 0; i < Adj[u].size(); i++){
      |                 ~~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 9 ms 6096 KB Output is correct
4 Correct 9 ms 6404 KB Output is correct
5 Correct 10 ms 6384 KB Output is correct
6 Correct 10 ms 6352 KB Output is correct
7 Correct 10 ms 6400 KB Output is correct
8 Correct 9 ms 6352 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Incorrect 2 ms 2768 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052160'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 9 ms 6096 KB Output is correct
4 Correct 9 ms 6404 KB Output is correct
5 Correct 10 ms 6384 KB Output is correct
6 Correct 10 ms 6352 KB Output is correct
7 Correct 10 ms 6400 KB Output is correct
8 Correct 9 ms 6352 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Incorrect 2 ms 2768 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052160'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 2292 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 2292 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Incorrect 2 ms 2768 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052160'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 9 ms 6096 KB Output is correct
4 Correct 9 ms 6404 KB Output is correct
5 Correct 10 ms 6384 KB Output is correct
6 Correct 10 ms 6352 KB Output is correct
7 Correct 10 ms 6400 KB Output is correct
8 Correct 9 ms 6352 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Incorrect 2 ms 2768 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052160'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 9 ms 6096 KB Output is correct
4 Correct 9 ms 6404 KB Output is correct
5 Correct 10 ms 6384 KB Output is correct
6 Correct 10 ms 6352 KB Output is correct
7 Correct 10 ms 6400 KB Output is correct
8 Correct 9 ms 6352 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Incorrect 2 ms 2768 KB 1st lines differ - on the 1st token, expected: '52130940', found: '2052160'
11 Halted 0 ms 0 KB -