7.21 补题

Rectangles

题意

t组输入，每组n个坐标i, j, k代表一个矩形的左下(i,0) 和右上(j,k)点，计算最后组成的图形的面积。

思路

将每个小矩形的每个点都标记一下就行了，最后数一下。

刚开始还想着怎么计算💧💧

#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define scan1(n) scanf("%d",&n)
#define scan2(n,m) scanf("%d %d",&n,&m)
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define debug(x) cout <<'*' << x <<endl;

const int N = 110;
const int M = 2 * N + 10;
const int mod = 1e9 + 7;
const int P = 131;
typedef pair<int, int> PII;
typedef long long ll;

bool vis[110][110];

int main()
{
    off;
    //freopen("window.in", "r", stdin);
    int t;
    cin >> t;
    while (t--) {
        memset(vis, 0, sizeof vis);
        int n;
        cin >> n;
        int x, y, z;
        while (n--) {
            cin >> x >> y >> z;
            for (int i = x; i < y; i++) {
                for (int j = 0; j < z; j++) {
                    vis[i][j] = 1;
                }
            }
        }
        int ans = 0;
        for (int i = 0; i < 110; i++) {
            for (int j = 0; j < 110; j++) {
                if (vis[i][j]) ans++;
            }
        }
        cout << ans << endl;
    }
    return 0;
}

Weekend

题意

t组数据，每组n个地点，m条边，f个朋友。你必须经过f个点之后到达点n，经过顺序无关，问最短距离。

思路

最短路，要经过f个点，且f很小，那么用floyd更新一遍任意点直接的最短路之后，f个点全排列所有经过顺序，每次dfs一遍记录最小值即可。

#define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define scan1(n) scanf("%d",&n)
#define scan2(n,m) scanf("%d %d",&n,&m)
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define debug(x) cout <<'*' << x <<endl;

const int N = 110;
const int M = 2 * N + 10;
const int mod = 1e9 + 7;
const int P = 131;
typedef pair<int, int> PII;
typedef long long ll;

int p[N][N];
int pos[11];

int dfs(int f,int n) {
    int res = 1;
    int ans = 0;
    for (int i = 0; i < f; i++) {
        ans += p[res][pos[i]];
        res = pos[i];
    }
    ans += p[res][n];
    return ans;
    
}

int main()
{
    off;
    int t;
    cin >> t;
    int cnt = 0;
    while (cnt < t) {
        cnt++;
        int n, m, f;
        cin >> n >> m >> f;
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++) {
                if (i == j) p[i][j] = 0;
                else p[i][j] = INF;
            }
        for (int i = 0; i < m; i++) {
            int u, v, w;
            cin >> u >> v >> w;
            p[u][v] = p[v][u] = w;
        }
        memset(pos, 0, sizeof pos);
        for (int i = 0; i < f; i++) {
            cin >> pos[i];
        }
        sort(pos, pos + f);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                for (int k = 1; k <= n; k++) {
                    p[j][k] = min(p[j][i] + p[i][k], p[j][k]);
                }
            }
        }
        int mi = INF;
        mi = dfs(f, n);
        int c = 0;
        while (next_permutation(pos, pos + f)) {   
            mi = min(mi, dfs(f, n));
        }
        cout << "Case " << cnt << ':' << ' ' << mi << endl;
    }
    return 0;
}