题目描述:传送门
题解:
这题是比较水的一道题。我们发现n比较小,直接暴力一发。爆枚少了那张牌,再枚举用哪两张牌来组成对子,最后暴力判断是否可以和牌(可以组成刻子先组刻子,不行再组顺子)。
代码如下:
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
const int maxn=405;
int n,m,hsh[maxn],hsh1[maxn];
bool check;
inline int read(){
int x=0; char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-48,ch=getchar();
return x;
}
bool group(){
for (int i=1;i<=n;i++) hsh1[i]=hsh[i];
for (int i=1;i<n-1;i++)
if (hsh1[i]) {
hsh1[i]=hsh1[i]%3; if (!hsh1[i]) continue;
if (hsh1[i+1]<hsh1[i]||hsh1[i+2]<hsh1[i]) return 0;
else hsh1[i+1]-=hsh1[i],hsh1[i+2]-=hsh1[i],hsh1[i]=0;
}
if (hsh1[n-1]%3>0||hsh1[n]%3>0) return 0; else return 1;
}
void pd(int x){
bool check1=0;
for (int i=1;i<=n;i++)
if (hsh[i]>1) {hsh[i]-=2; if (group()) {check1=1,hsh[i]+=2; break;} hsh[i]+=2;}
if (check1==1) {printf("%d ",x); check=1;}
}
int main(){
n=read(),m=read();
for (int i=1;i<=3*m+1;i++) {int x=read(); hsh[x]++;}
for (int i=1;i<=n;i++) hsh[i]++,pd(i),hsh[i]--;
if (check==0) printf("NO\n"); else printf("\n");
return 0;
}