oj.uz

답안 #791318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791318 2023-07-24T01:30:21 Z WongChun1234 디지털 회로 (IOI22_circuit) C++17
2 / 100
 466 ms 20612 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200050;
const ll MOD=1000002022;
int n,m,lz[N<<2];
ll dp[N],rdp[N],seg[N<<2],iseg[N<<2];
vector<int> p,a,ch[N],pref[N],suff[N];
void build(int id,int l,int r){
	if (l==r){
		seg[id]=a[l-1]*rdp[l+n-1];
		iseg[id]=(!a[l-1])*rdp[l+n-1];
		//cout<<id<<" "<<l<<" "<<r<<" "<<seg[id]<<" "<<iseg[id]<<"\n";
		return;
	}
	int m=(l+r)/2;
	build(id*2,l,m);
	build(id*2+1,m+1,r);
	seg[id]=seg[id*2]+seg[id*2+1]%MOD;
	iseg[id]=iseg[id*2]+iseg[id*2+1]%MOD;
	//cout<<id<<" "<<l<<" "<<r<<" "<<seg[id]<<" "<<iseg[id]<<"\n";
}
void pushdown(int id){
	lz[id]^=1;
	swap(seg[id],iseg[id]);
}
void update(int id,int l,int r,int ql,int qr){
	if (l>=ql&&r<=qr){
		pushdown(id);
		return;
	}
	if (l>qr||r<ql) return;
	if (lz[id]){
		pushdown(id*2);
		pushdown(id*2+1);
		lz[id]=0;
	}
	int m=(l+r)/2;
	update(id*2,l,m,ql,qr);
	update(id*2+1,m+1,r,ql,qr);
	seg[id]=seg[id*2]+seg[id*2+1]%MOD;
	iseg[id]=iseg[id*2]+iseg[id*2+1]%MOD;
}
void init(int N, int M, vector<int> P, vector<int> A) {
	n=N,m=M,p=P,a=A;
	for (int i=1;i<n+m;i++) ch[p[i]].push_back(i);
	for (int i=n+m-1;i>=n;i--){
		dp[i]=1;
	}
	for (int i=n-1;i>=0;i--){
		pref[i].push_back(1),suff[i].push_back(1);
		for (int j:ch[i]) pref[i].push_back(dp[j]),suff[i].push_back(dp[j]);
		pref[i].push_back(1),suff[i].push_back(1);
		for (int j=1;j<=ch[i].size();j++) pref[i][j]=pref[i][j-1]*pref[i][j]%MOD;
		for (int j=ch[i].size();j>=1;j--) suff[i][j]=suff[i][j+1]*suff[i][j]%MOD;
		dp[i]=suff[i][1]*ch[i].size();
	}
	rdp[0]=1;
	for (int i=0;i<n;i++){
		for (int j=1;j<=ch[i].size();j++) rdp[ch[i][j-1]]=rdp[i]*(pref[i][j-1]*suff[i][j+1]%MOD)%MOD;
	}
	//for (int i=0;i<n+m;i++) cout<<dp[i]<<" "<<rdp[i]<<"\n";
	build(1,1,m);
}

int count_ways(int L, int R) {
	update(1,1,m,L-n+1,R-n+1);
	return seg[1];
}

Compilation message

circuit.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>)':
circuit.cpp:55:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   for (int j=1;j<=ch[i].size();j++) pref[i][j]=pref[i][j-1]*pref[i][j]%MOD;
      |                ~^~~~~~~~~~~~~~
circuit.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for (int j=1;j<=ch[i].size();j++) rdp[ch[i][j-1]]=rdp[i]*(pref[i][j-1]*suff[i][j+1]%MOD)%MOD;
      |                ~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14416 KB Output is correct
2 Correct 6 ms 14416 KB Output is correct
3 Correct 7 ms 14476 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 10 ms 14432 KB Output is correct
7 Correct 7 ms 14416 KB Output is correct
8 Correct 7 ms 14416 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 466 ms 20612 KB 1st lines differ - on the 1st token, expected: '431985922', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 466 ms 20612 KB 1st lines differ - on the 1st token, expected: '431985922', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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

Subtask #7
0 / 28.0

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

Subtask #8
0 / 11.0

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