http://ybt.ssoier.cn:8088/problem_show.php?pid=1510

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;

int T;
int r[30];//r[i]表示第i个时间点需要工作的人数 
int n;
int num[30] , x;//num[i]表示第i个时间点有多少人开始工作 
int L , R , ans; 
vector<pair<int,int> > vc[N];
int dis[N];
bool vis[N];
queue<int> q;
void spfa(int mid)//最长路 
{
	memset(dis, -INF , sizeof(dis));
	memset(vis , 0 , sizeof(vis));
	while(!q.empty()) q.pop();
	dis[0] = 0;
	vis[0] = 1;
	
	q.push(0);
	
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		if( u == 24 && dis[u] > mid)
			return;
		
		vis[u] = 0;
		for(int i = 0; i < vc[u].size(); i++)
		{
			int v = vc[u][i].first , w = vc[u][i].second;
			if(dis[v] < dis[u] + w)
			{
				dis[v] = dis[u] +w;
				if(!vis[v]) 
				{
					q.push(v);	
					vis[v] = 1;
				}
			}	
		} 
	}
}

bool check(int mid)//一共mid人工作 
{
	for(int i = 0; i <= 24; i++)
	{
		vc[i].clear();	
	}
	
	//隐藏不等式
	//sum[i] 从1点到i点需要工作的人数
	//	sum[i] - sum[i - 1] >= 0
	//	sum[i - 1] - sum[i] >= -num[i]
	for(int i = 1; i <= 24; i++)
	{
		vc[i - 1].push_back({i , 0});
		vc[i].push_back({i - 1 ,-num[i]});	
	} 
//	23 24 1 2 3 4 5 6 7 8 9
//	sum[i] - sum[i - 8] >= r[i]
	for(int i = 8; i <= 24; i++)
		vc[i - 8].push_back({i , r[i]});
	
//	sum[24] - sum[8] <= mid - r[i]; 
//	sum[i] - sum[i + 16] >= r[i] - mid;
	for(int i = 1; i <= 8; i++)
		vc[i + 16].push_back({i , r[i] - mid});
		
//	sum[24] - sum[0] <= mid
	vc[0].push_back({24,mid});
	vc[24].push_back({0, -mid});
	
	spfa(mid);
	return dis[24] == mid;
}

int main()
{
	cin >> T;
	while( T-- )
	{
		memset(num , 0 , sizeof(num));
		for(int i = 1; i <= 24; i++)
			cin >> r[i];
			
		cin >> n;
		//表示每个人开始工作的时间 
		for(int i = 1; i <= n; i++)
		{
			cin >> x;
			num[x + 1]++;
		}
		//二分答案 
		L = 0 , R = n , ans = -1;
		while( L <= R)
		{
			int mid = L + R >> 1;
			if(check(mid))
			{
				ans = mid;
				R = mid - 1;
			}
			else
				L = mid + 1;
		}
		
		if(ans == -1)
			cout << "No Solution\n";
		else
			cout << ans << endl;
	}

	return 0;
}