Submission #637165

#	Time	Username	Problem	Language	Result	Execution time	Memory
637165		Fidan	Digital Circuit (IOI22_circuit)	C++17	2 / 100	3047 ms	6236 KiB

circuit

#include <bits/stdc++.h>
#include "circuit.h"
using namespace std;
typedef long long ll;
const ll mod=1000002022;
ll n, m;
vector<ll> p, a;
vector<vector<ll>> v;
vector<ll> k;
vector<ll> s;
vector<ll> pr;
void solve1(int x){
	pr[x]=1;
	for(ll i:v[x]) {
		solve1(i);
		pr[x]=(pr[x]*pr[i])%mod;
	}
}	
void init(int N, int M, vector<int> P, vector<int> A){
	n=N;
	m=M;
	for(ll i=0; i<n+m; i++){
		p.push_back(P[i]);
		a.push_back(A[i]);
	}
	v.resize(n+m);
	for(ll i=1; i<n+m; i++){
		v[p[i]].push_back(i);
	}
	k.resize(n+m);
	s.resize(n+m);
	pr.resize(n+m);
	solve1(0);
}
void solve(int x){
	k[x]=0;
	if(x>=n){
		k[x]=a[x-n];
		s[x]=0;
		return;
	}
	for(ll i: v[x]) solve(i);
	for(ll i=0; i<v[x].size(); i++){
		ll l=k[v[x][i]];
		for(ll j=0; j<v[x].size(); j++){
			if(i!=j) l=(l*pr[v[x][j]])%mod;
		}
		k[x]=(k[x]+l)%mod;
	}
	return;
}
int count_ways(int l, int r){
	if(n==1){
		ll sum=0;
		for(ll i=l-n; i<=r-n; i++){
			a[i]=1-a[i];
		}
		for(ll i=0; i<m; i++){
			if(a[i]==1) sum++;
		}
		return sum;
	}
	for(ll i=l-n; i<=r-n; i++){
		a[i]=1-a[i];
	}
	solve1(0);
	solve(0);
	return int(k[0]);
}

Compilation message (stderr)

circuit.cpp: In function 'void solve(int)':
circuit.cpp:43:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for(ll i=0; i<v[x].size(); i++){
      |              ~^~~~~~~~~~~~
circuit.cpp:45:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for(ll j=0; j<v[x].size(); j++){
      |               ~^~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11