DCEPC12E - End of Fun - SPOJ Solution C++

  Problem Link : DCEPC12E  


👉 Hint : edit please

 


✅ C++ Solution :

 
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
	int n;
	ll sum=0;
	cin>>n;
	ll arr1[n][n],arr2[n][n];
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
			cin>>arr1[i][j];

	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
			cin>>arr2[i][j];

	}

	for(int i=0;i<n;i++)
	{
		int j,k;
		for(j=0;j<n;j++)
		{
			for(int k=0;k<n;k++)
				sum+=arr1[i][k]*arr2[k][j];
		}
	}
	int q,x,y;
	ll v,diff;
	char c;
	cin>>q;
	while(q--)
	{
		cin>>c>>x>>y>>v;
		if(c=='A')
		{
			diff=v-arr1[x][y];
			for(int j=0;j<n;j++)
			{
				sum+=diff*arr2[y][j];
			}
			arr1[x][y]=v;
		}
		else
		{
			diff=v-arr2[x][y];
			for(int i=0;i<n;i++)
			{
				sum+=diff*arr1[i][x];
			}
			arr2[x][y]=v;
		}
		cout<<sum<<endl;

	}

}

 

Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook. 

😇Happy Learning!!