CodeForces 1574D :The Strongest Build BFS

CodeForces 1574D :The Strongest Build BFS

传送门

题意

分析

用 m a p map map维护不能选的组合，然后 b f s bfs bfs直接搜
太暴力了。。。

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lldn",x);
#define di(x) printf("%dn",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
VI a[N];
int n,m;map<VI,bool> M,st;
typedef pair<int,VI> pii;int main() {read(n);for(int i = 1;i <= n;i++){int x;read(x);while(x--){int y;read(y);a[i].pb(y);}}   read(m);while(m--){VI c;for(int i = 1;i <= n;i++){int x;read(x);c.pb(x);}M[c] = true;}int res = 0;priority_queue<pii> q;VI v;for(int i = 1;i <= n;i++){res += a[i].back();v.pb((int)a[i].size());}q.push({res,v});VI ans;while(q.size()){auto t = q.top();q.pop();if(!M.count(t.se)){ans = t.se;break;}int sum = t.fi;VI back = t.se;for(int i = 1;i <= n;i++){if(back[i - 1] >= 2){sum -= a[i][back[i - 1] - 1];back[i - 1]--;if(st[back]){back[i - 1]++;sum += a[i][back[i - 1] - 1];continue;}sum += a[i][back[i - 1] - 1];q.push({sum,back});st[back] = true;sum -= a[i][back[i - 1] - 1];back[i - 1]++;sum += a[i][back[i - 1] - 1];}}}  for(int x:ans) printf("%d ",x);return 0;
}