D. Knowledge Cards

最新推荐文章于 2024-07-02 16:58:14 发布

三巷DP

最新推荐文章于 2024-07-02 16:58:14 发布

阅读量215

点赞数

分类专栏： codeforces 文章标签： c++ 开发语言数学树状数组

本文链接：https://blog.csdn.net/m0_62167326/article/details/127622050

版权

codeforces 专栏收录该内容

103 篇文章 1 订阅

订阅专栏

题意：给定一个方阵，要求将(1,1)处的1-k的卡牌排列，通过类似华容道的方式移动到（n,m）的位置，并从上到下为自然排列

思路：手动模拟一下，不难发现，当方阵中有一个空位时所有位置均可以到达（n,m），于是，我们得到一个当前不能移到(n，m)的卡牌数量上限，为n*m-3。树状数组维护一下这个值，如果在整个过程中，sum(k)>=n*m-3（可能包含要移动的数字本身），则输出TIDAK，否则则是YA

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 1e9 + 7;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

//int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int dx[8] = { 1,2,2,1,-1,-2,-2,-1 }, dy[8] = { 2,1,-1,-2,-2,-1,1,2 };
int n, m, k;
int idx[N], a[N];
int tr[M];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

inline void init() {}

void add(int x, int c)
{
	for (int i = x; i <= k; i += lowbit(i))
	{
		tr[i] += c;
	}
}

int sum(int x)
{
	int res = 0;
	for (int i = x; i > 0; i -= lowbit(i))
		res += tr[i];
	return res;

}

void slove()
{
	cin >> n >> m >> k;
	for (int i = 1; i <= k; i++)cin >> a[i];
	for (int i = 1; i <= k; i++) tr[i] = 0;

	string yes = "YA", no = "TIDAK";
	int stk = n * m - 4;
	int flag = k;
	bool suc = true;
	for (int i = 1; i <= k; i++) {
		if (flag != a[i] && ((sum(flag) - sum(flag - 1)) == 0))
		{
			add(a[i], 1);
		}
		else {
			if (a[i] == flag)flag--;
			while (sum(flag) - sum(flag - 1))add(flag--, -1);
			if (a[i] == flag)flag--;
		}
		if (sum(k) > stk)suc = false;
	}
	if (suc)cout << yes << endl;
	else cout << no << endl;
}

signed main()
{
	//IOS;
	int _ = 1;
	si(_);
	init();
	while (_--)
	{
		slove();
	}
	return 0;
}
/*
1
3 4 10
10 4 9 3 5 6 8 2 7 1

*/