AcWing 5418. 宝藏
原题链接
困难
作者:
杨睿卿
,
2024-04-22 16:40:05
,
所有人可见
,
阅读 6
暴力35
#include<iostream>
#include<vector>
#include<deque>
using namespace std;
typedef long long LL;
int n,m;
vector<LL> command[100005];
vector<LL> caculate(vector<LL> a,vector<LL> b)
{
vector<LL> temp;
temp.push_back(0);
temp.push_back(((a[1]*b[1])%998244353+(a[2]*b[3])%998244353)%998244353);
temp.push_back(((a[1]*b[2])%998244353+(a[2]*b[4])%998244353)%998244353);
temp.push_back(((a[3]*b[1])%998244353+(a[4]*b[3])%998244353)%998244353);
temp.push_back(((a[3]*b[2])%998244353+(a[4]*b[4])%998244353)%998244353);
return temp;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
int v;
cin>>v;
command[i].push_back(v);
if(v==1||v==2)
{
for(int j=0;j<4;j++)
{
int x;
cin>>x;
command[i].push_back(x);
}
}
}
// for(int i=1;i<=n;i++)
// {
// for(auto j:command[i]) cout<<j;
// cout<<endl;
// }
while(m--)
{
int v;
cin>>v;
if(v==1)
{
int x;
cin>>x;
int y;
cin>>y;
vector<LL> ct;
ct.push_back(y);
if(y==1||y==2)
{
for(int j=0;j<4;j++)
{
int z;
cin>>z;
ct.push_back(z);
}
}
command[x]=ct;
}
else if(v==2)
{
int a,b;
cin>>a>>b;
deque<vector<LL>> deq;
for(int i=a;i<=b;i++)
{
if(command[i][0]==1||command[i][0]==2) deq.push_back(command[i]);
else if(command[i][0]==3&&deq.size()) deq.pop_back();
}
int ans1[5]={0,1,0,0,1};
vector<LL> ans(ans1,ans1+5);
while(deq.size())
{
auto t=deq.front();
deq.pop_front();
// for(int i=1;i<=4;i++) cout<<t[i]<<" ";
// cout<<endl;
if(t[0]==1) ans=caculate(t,ans);
else if(t[0]==2) ans=caculate(ans,t);
// for(int i=1;i<=4;i++) cout<<ans[i]<<" ";
// cout<<endl;
}
cout<<ans[1];
for(int i=2;i<=4;i++) cout<<" "<<ans[i];
cout<<endl;
}
}
// for(int i=1;i<=n;i++)
// {
// for(auto j:command[i]) cout<<j;
// cout<<endl;
// }
return 0;
}