Submission #1041695

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041695		Muhammad_Aneeq	Tenis (COI19_tenis)	C++17	0 / 100	1050 ms	2780 KiB

tenis

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#include <vector>
using namespace std;
inline void solve()
{
	int n,q;
	cin>>n>>q;
	int loc[3][n];
	for (int i=0;i<3;i++)
	{
		for (int j=0;j<n;j++)
		{
			int x;
			cin>>x;
			loc[i][x-1]=j;
		}
	}
	while (q--)
	{
		int ty;
		cin>>ty;
		if (ty==1)
		{
			vector<int>f;
			int x;
			cin>>x;
			x--;
			for (int i=0;i<n;i++)
			{
				if (i!=x)
					f.push_back(i);
			}
			vector<int>z;
			z.push_back(x);
			while (f.size())
			{
				vector<int>g,h;
				for (auto i:f)
				{
					for (auto j:z)
					{
						bool w=0;
						for (int k=0;k<3;k++)
						{
							if (loc[k][j]<loc[k][i])
							{
								w=1;break;
							}
						}
						if (w)
						{
							g.push_back(i);
							break;
						}
					}
					if (g.size()&&g.back()!=i)
						h.push_back(i);
				}
				if (g.size()==0)
					break;
				z=g,f=h;
			}
			if (f.size())
				cout<<"NE\n";
			else
				cout<<"DA\n";
		}
		else
		{
			int p,a,b;
			cin>>p>>a>>b;
			p--;a--;b--;
			swap(loc[p][a],loc[p][b]);
		}
	}
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 49