# [JSOI2007]麻将 模拟 BZOJ1028

## 输入输出样例

9 4
1 1 2 2 3 3 5 5 5 7 8 8 8

6 7 9枚举；
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
//#include<cctype>
//#pragma GCC optimize(2)
using namespace std;
#define maxn 200005
#define inf 0x7fffffff
//#define INF 1e18
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
typedef long long  ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const long long int mod = 1e9;
#define Mod 1000000000
#define sq(x) (x)*(x)
#define eps 1e-5
typedef pair<int, int> pii;
#define pi acos(-1.0)
//const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef pair<int, int> pii;

inline int rd() {
int x = 0;
char c = getchar();
bool f = false;
while (!isdigit(c)) {
if (c == '-') f = true;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
return f ? -x : x;
}

ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a%b);
}
int sqr(int x) { return x * x; }

/*ll ans;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1; y = 0; return a;
}
ans = exgcd(b, a%b, x, y);
ll t = x; x = y; y = t - a / b * y;
return ans;
}
*/

int n, m;
int but[maxn];
bool fg;
int tmp[maxn];
bool OK() {
for (int i = 1; i <= n; i++) {
if (but[i] >= 2) {// 对子
but[i] -= 2;
bool ok = 1;
for (int j = 1; j <= n + 2; j++)tmp[j] = but[j];
for (int j = 1; j <= n + 2; j++) {
if (tmp[j] < 0) {
ok = 0; break;
}
tmp[j] %= 3;
tmp[j + 1] -= tmp[j];
tmp[j + 2] -= tmp[j];
}
but[i] += 2;
if (ok)return true;
}
}
return false;
}

int main()
{
//ios::sync_with_stdio(0);
n = rd(); m = rd();
for (int i = 1; i <= 3 * m + 1; i++) {
int x; x = rd(); but[x]++;
}
for (int i = 1; i <= n; i++) {
but[i]++;
if (OK()) {
fg = 1; cout << i << ' ';
}
but[i]--;
}
if (fg == 0)cout << "NO" << endl;
return 0;
}


posted @ 2019-02-02 14:53  NKDEWSM  阅读(697)  评论(0编辑  收藏  举报