oj.uz

답안 #637187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637187 2022-08-31T21:40:11 Z blue 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 9652 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;

const ll mod = 1'000'002'022;

ll ad(ll a, ll b)
{
	return (a+b)%mod;
}

ll mul(ll a, ll b)
{
	return (a*b)%mod;
}

const int mx = 200'000;

vll pow2(1 + mx);

vi children[1 + mx];
int N, M;

vi depth(1 + mx, 0);

vi A;

void dfs(int u)
{
	for(int v : children[u])
	{
		depth[v] = depth[u] + 1;
		dfs(v);
	}
}

void init(int N_, int M_, vi P_, vi A_)
{
	N = N_;
	M = M_;

	for(int i = 1; i < N+M; i++)
		children[P_[i]].push_back(i);

	dfs(0);

	A = vi(N, 0);
	for(int a : A_)
		A.push_back(a);

	pow2[0] = 1;
	for(int e = 1; e <= mx; e++)
		pow2[e] = mul(2, pow2[e-1]);
}

int count_ways(int L, int R)
{
	for(int i = L; i <= R; i++)
		A[i] = !A[i];

	ll res = 0;

	for(int i = N; i < N+M; i++)
		res = ad(res, mul(A[i], depth[i]));

	return res;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 5 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 4 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 5 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 4 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 5 ms 7248 KB Output is correct
10 Incorrect 5 ms 7376 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1024'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3004 ms 9652 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3004 ms 9652 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 5 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 4 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 5 ms 7248 KB Output is correct
10 Incorrect 5 ms 7376 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1024'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7248 KB Output is correct
2 Correct 4 ms 7360 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 5 ms 7376 KB Output is correct
6 Correct 5 ms 7376 KB Output is correct
7 Correct 4 ms 7376 KB Output is correct
8 Correct 5 ms 7376 KB Output is correct
9 Correct 5 ms 7248 KB Output is correct
10 Incorrect 5 ms 7376 KB 1st lines differ - on the 1st token, expected: '52130940', found: '1024'
11 Halted 0 ms 0 KB -