Wannafly挑战赛2

A

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
 
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b)   memset(a, b, sizeof a)
#define REP(i, x, n)    for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const LL INF = 1e18 + 10;
LL sum[qq];
 
int main(){
    int n;  scanf("%d", &n);
    for(int i = 0; i < n; ++i) {
        scanf("%lld", sum + i);
    }
    sort(sum, sum + n);
    LL ans = 0;
    for(int i = 0; i < n - 1; ++i) {
        ans += sum[i] * (i + 1LL);
    }
    ans += sum[n - 1] * (n - 1LL);
    printf("%lld\n", ans);
    return 0;
}

B

分析可知假设从A点到B点只有两种选择，

第一种不经过多给出来的边

第二种经过多给出来的边

第一种情况很好算，第二种我们可以抽象成A点走到C点再走到D点最后走到B点，那么CD这两个点实际就是多给出来的边中的两个点，要简化成这样只需要对这多出来的m条边的所有点做一个folyd的就可以，然后每次询问暴力枚举CD这两个点即可

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
 
using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b)   memset(a, b, sizeof a)
#define REP(i, x, n)    for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const LL INF = 1e18 + 10;
int n, m;
LL d[qq];
int u[30], v[30];
LL w[30];
LL dis[105][105];
LL sum[qq];
LL tot = 0;
int pos[qq];
int point[105];
LL getDis(int a, int b) {
    if(a > b)    swap(a, b);
    return min(sum[b] - sum[a], tot - (sum[b] - sum[a]));
}
int main(){
    int n, m;   scanf("%d%d", &n, &m);
    sum[1] = 0;
    for(int i = 2; i <= n + 1; ++i) {
        scanf("%lld", d + i);
        tot += d[i];
        sum[i] = sum[i - 1] + d[i];
    }
    for(int i = 1; i <= m; ++i) {
        scanf("%d%d%lld", u + i, v + i, w + i);
        if(!pos[u[i]]) {
            point[++point[0]] = u[i];
            pos[u[i]] = point[0];
        }
        if(!pos[v[i]]) {
            point[++point[0]] = v[i];
            pos[v[i]] = point[0];
        }
    }
    for(int i = 1; i <= point[0]; ++i) {
        for(int j = i + 1; j <= point[0]; ++j) {
            dis[i][j] = dis[j][i] = getDis(point[i], point[j]);
        }
    }
    for(int i = 1; i <= m; ++i) {
        int a = pos[u[i]];
        int b = pos[v[i]];
        dis[a][b] = dis[b][a] = min(dis[a][b], 1LL * w[i]);
    }
    for(int k = 1; k <= point[0]; ++k) {
        for(int i = 1; i <= point[0]; ++i) {
            for(int j = 1; j <= point[0]; ++j) {
                if(i == j)  continue;
                dis[i][j] = dis[j][i] = min(dis[i][j], dis[i][k] + dis[k][j]);
            }
        }
    }
    int q;  scanf("%d", &q);
    while(q--) {
        int a,  b;  scanf("%d%d", &a, &b);
        LL ans = getDis(a, b);
        for(int i = 1; i <= point[0]; ++i) {
            for(int j = 1; j <= point[0]; ++j) {
                ans = min(ans, getDis(a, point[i]) + dis[i][j] + getDis(point[j], b));
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}

C

看了题解才明白原来可以转化为区间问题

#include<bits/stdc++.h>
 
using namespace std;
#define LL long long
#define pb push_back
#define mst(a, b)   memset(a, b, sizeof)
#define pill pair<int, int>
#define mk makr_pair
#define fi first
#define se second
#define lson rt << 1
#define rson (rt << 1) | 1
 
const int qq = 2005 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 10;
char st[qq][qq];
int dp[3][qq][qq];
int tree1[qq << 2], tree2[qq << 2];
void pushUp(int *tree, int rt) {
    tree[rt] = max(tree[lson], tree[rson]);
}
void build(int *tree, int l, int r, int rt) {
    tree[rt] = -INF;
    if(l == r)  return;
    int mid = (l + r) >> 1;
    build(tree, l, mid, lson);
    build(tree, mid + 1, r, rson);
    pushUp(tree, rt);
}
void upDate(int *tree, int l, int r, int rt, int x, int y, int val) {
    if(l == r) {
        tree[rt] = val;
        return;
    }
    int mid = (l + r) >> 1;
    if(mid >= x)     upDate(tree, l, mid, lson, x, y, val);
    else if(mid < y) upDate(tree, mid + 1, r, rson, x, y, val);
    pushUp(tree, rt);
}
int query(int *tree, int l, int r, int rt, int x, int y, int val) {
    if(l == r) {
        return l;
    }
    int ret = 0;
    int mid = (l + r) >> 1;
    if(x <= l && r <= y) {
        if(tree[rson] >= val)    ret = query(tree, mid + 1, r, rson, x, y, val);
        else if(tree[lson] >= val)   ret = query(tree, l, mid, lson, x, y, val);
        return ret;
    }
    if(mid < y && tree[rson] >= val)  ret = query(tree, mid + 1, r, rson, x, y, val);
    if(ret) return ret;
    if(mid >= x && tree[lson] >= val) ret = query(tree, l, mid, lson, x, y, val);
    return ret;
}
 
int main() {
    int n, m;   scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) {
        scanf("%s", st[i] + 1);
    }
    for(int i = n; i >= 1; --i) {
        for(int j = 1; j <= m; ++j) {
            if(st[i][j] == 'O') continue;
            dp[0][i][j] = dp[0][i + 1][j - 1] + 1;
            dp[1][i][j] = dp[1][i + 1][j] + 1;
            dp[2][i][j] = dp[2][i + 1][j + 1] + 1;
        }
    }
/*  for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) {
            printf("%d ", dp[0][i][j]);
        }
        puts("");
    }   */
    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        build(tree1, 1, m, 1);
        build(tree2, 1, m, 1);
        for(int k = 1; k <= m; ++k) {
            if(k & 1)   upDate(tree1, 1, m, 1, k, k, min(dp[0][i][k], dp[1][i][k]) - k - 1);
            else        upDate(tree2, 1, m, 1, k, k, min(dp[0][i][k], dp[1][i][k]) - k - 1);
        }
        for(int j = 1; j <= m; ++j) {
            if(st[i][j] == 'O') continue;
            int pos = 0, v = min(dp[1][i][j], dp[2][i][j]);
            if(v <= ans) continue;
            if(j & 1)   pos = query(tree1, 1, m, 1, j, j + v - 1, -j);
            else    pos = query(tree2, 1, m, 1, j, j + v - 1, -j);
            if(pos) ans = max(ans, pos - j + 1);
        }
    }
    printf("%d\n", ans);
    return 0;
}