2019-2020 ACM-ICPC Brazil Subregional Programming Contest I题
这题真没什么坑的???这题卡常了……而且还卡的特别的隐蔽,没有故意踩坑或者有这个习惯还真是发现不了。
这题很好想到是dp[2][400][400][400]的一个Floyd数组来执行这个问题。但是呢,后面这个“400”和“[400] [400]”的怎样搭配会让你不经意之间就会TLE了。一开始的时候我选择,A->B就是开dp[2][A][B][Tims]这样的类型,但是TLE到死啊!QAQ。。。然后我硬是改不出来了啊。。。一直TLE,试着改了vector的记录方式,试着进行优化,但是还是不行,最后呢,改成了dp[2][Tims][A][B]的类型,我的天!过了……
越发玄学……
然后的话,除了这个问题之外,题目还在外面补充了:
As the statement of problem I, Interplanetary, is written, two conflicting interpretations are possible. The correct interpretation for the problem refers to temperatures between the hottest (or coldest) K, regardless of the number of planets with each of those temperatures. As an example, we provide the additional test case below. Sample Input 5 5 1 1 1 2 2 1 2 100 2 3 100 3 4 1 4 5 1 5 1 100 3 1 3 1 0 1 3 2 0 1 3 1 1 Sample Output 200 102 102
什么意思呢?就是如果有1,1,1,2,2这样的,我们只有两种排名,第一和第二,不会因为2之前有3个1而使得2的排名为4。
然后,剩下的,我们用正着跑和反着跑分别解决。
总体的思路一样,我们逐一把点放进去,用它来作为中继,松弛周围的点群。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 100000000
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 405;
int N, M, Q, mp[maxN][maxN], temp[maxN];
struct node
{
int val, id;
node(int a=0, int b=0):val(a), id(b) {}
friend bool operator < (node e1, node e2) { return e1.val < e2.val; }
}a[maxN];
bool cmp(node e1, node e2) { return e1.val > e2.val; }
int dp[2][maxN][maxN][maxN]; //0是前K、1是后K
int arr[maxN];
inline void floyd(int len, int _Index, int _Las, int Tth)
{
for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) dp[Tth][_Index][i][j] = dp[Tth][_Las][i][j];
for(int tot=1, u; tot<=len; tot++)
{
u = arr[tot];
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
dp[Tth][_Index][i][j] = min(dp[Tth][_Index][i][j], dp[Tth][_Index][i][u] + dp[Tth][_Index][u][j]);
}
}
}
}
inline void init()
{
for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) mp[i][j] = (i == j ? 0 : INF);
sort(a + 1, a + N + 1);
}
int main()
{
scanf("%d%d", &N, &M);
for(int i=1; i<=N; i++)
{
scanf("%d", &temp[i]);
a[i] = node(temp[i], i);
}
init();
for(int i=1, u, v, w; i<=M; i++)
{
scanf("%d%d%d", &u, &v, &w);
mp[u][v] = mp[v][u] = w;
}
for(int t=0; t<=1; t++) for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) dp[t][0][i][j] = mp[i][j];
int _Index = 1;
int len;
for(int i=1; i<=N; )
{
len = 0;
arr[++len] = a[i].id;
while(i < N && a[i].val == a[i + 1].val)
{
arr[++len] = a[i + 1].id;
i ++;
}
i++;
floyd(len, _Index, _Index - 1, 0); ++_Index;
}
_Index = 1;
for(int i=N; i>=1; )
{
len = 0; arr[++len] = a[i].id;
while(i > 1 && a[i].val == a[i - 1].val)
{
arr[++len] = a[i - 1].id;
i --;
}
i--;
floyd(len, _Index, _Index - 1, 1); ++_Index;
}
--_Index;
scanf("%d", &Q);
for(int i=1, A, B, K, T; i<=Q; i++)
{
scanf("%d%d%d%d", &A, &B, &K, &T);
K = min(K, _Index);
if(dp[T][K][A][B] >= INF) printf("-1\n");
else printf("%d\n", dp[T][K][A][B]);
}
return 0;
}