oj.uz

Submission #870082

# Submission time Handle Problem Language Result Execution time Memory
870082 2023-11-06T22:17:42 Z Nonoze Digital Circuit (IOI22_circuit) C++17
7 / 100
 3000 ms 4720 KB 
#include "circuit.h"
//#include "stub.cpp"
 
#include <bits/stdc++.h>
using namespace std;
const long long MOD= 1000002022;
 
 
vector<int> a;
vector<int> adj[100005];
vector<pair<int, int>> memo;
int n, m;
 
pair<long long, long long> dfs(int s) {
	if (s>=n) {
		return {a[s-n], a[s-n]^1};
	}
	if (memo[s].first!=-1) return memo[s];
	long long erase1=1, erase2=1, comp=1;
	for (auto u: adj[s]) {
		auto act=dfs(u);
		comp=(comp*(act.first+act.second))%MOD;
		erase1*=act.first, erase2*=act.second;
		erase1%=MOD, erase2%=MOD;
	}
	comp-=erase1+erase2;
	comp=(comp+10*MOD)%MOD;
    long long sz=adj[s].size();
	return memo[s]={
		(comp+(erase1*sz)%MOD)%MOD,
		(comp+(erase2*sz)%MOD)%MOD
	};
}
 
void init(int N, int M, vector<int> p, vector<int> aa) {
	a=aa;
	n=N, m=M; 
	for (int i=1; i<n+m; i++) {
		adj[p[i]].push_back(i);
	}
}
 
int count_ways(int L, int R) {
	for (int i=L; i<=R; i++) {
		a[i-n]^=1;
	}
	memo.clear();
	memo.resize(n, {-1, -1});
	return dfs(0).first;
}

Subtask #1
0 / 2.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2648 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2904 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 4720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 4720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2648 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2904 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Execution timed out 3075 ms 4720 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

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

Subtask #8
0 / 11.0

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