oj.uz

답안 #633176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633176 2022-08-21T18:39:51 Z study 디지털 회로 (IOI22_circuit) C++17
2 / 100
 3000 ms 9172 KB 
#include <bits/stdc++.h>
#include "circuit.h"
using ll=long long;
using namespace std;

const ll mod = 1e9+2022, N = 1e5+1, M = 1e5+1;
pair<ll,ll> segt[4*N+5];
bool lazy[4*N+5];
vector<int> adj[N+M];
set<int> in;
int n=0, m = 0;
bool ok = false;
pair<ll,ll> crt;

void modify(int idx, int l, int r, int L, int R){
	if (r < L or l > R) return;
	if (l >= L and r <= R){
		if (ok){
			swap(segt[idx].first,segt[idx].second);
			lazy[idx] = 1;
		}
		else{
			segt[idx] = crt;
		}
		return;
	}
	if (lazy[idx]){
		lazy[2*idx] = !lazy[2*idx];
		lazy[2*idx+1] = !lazy[2*idx+1];
		swap(segt[2*idx].first,segt[2*idx].second);
		swap(segt[2*idx+1].first,segt[2*idx+1].second);
		lazy[idx] = 0;
	}
	int mid = (l+r)/2;
	modify(2*idx,l,mid,L,R);
	modify(2*idx+1,mid+1,r,L,R);
	segt[idx].first = (segt[2*idx].first+segt[2*idx+1].first)%mod;
	segt[idx].second = (segt[2*idx].second+segt[2*idx+1].second)%mod;
}

void dfs(int node){
	in.emplace(node);
	for (int i:adj[node]){
		dfs(i);
	}
}

void init(int N, int M, vector<int> P, vector<int> A){
	m = M;
	n = N;
	vector<ll> deg(N+M);
	for (int i=1; i<N+M; ++i){
		deg[P[i]]++;
		adj[i].emplace_back(P[i]);
	}
	for (int i=N; i<N+M; ++i){
		in.clear();
		dfs(i);
		ll prod = 1;
		for (int j=0; j<N; ++j){
			if (!in.count(j)){
				prod *= deg[j];
				prod %= mod;
			}
		}
		if (A[i-N]){
			crt = {prod,0};
		}
		else{
			crt = {0,prod};
		}
		modify(1,0,M-1,i-N,i-N);
	}
	ok = true;
}

int count_ways(int L, int R){
	L -= n;
	R -= n;
	modify(1,0,m-1,L,R);
	return segt[1].first;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Incorrect 5 ms 5072 KB 3rd lines differ - on the 1st token, expected: '133738288', found: '824438726'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 4 ms 5064 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Incorrect 5 ms 5072 KB 3rd lines differ - on the 1st token, expected: '133738288', found: '824438726'
12 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Incorrect 5 ms 5072 KB 3rd lines differ - on the 1st token, expected: '133738288', found: '824438726'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 4 ms 5064 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Incorrect 5 ms 5072 KB 3rd lines differ - on the 1st token, expected: '133738288', found: '824438726'
12 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 4 ms 5064 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Incorrect 5 ms 5072 KB 3rd lines differ - on the 1st token, expected: '133738288', found: '824438726'
12 Halted 0 ms 0 KB -