[hihocoder][Offer收割]编程练习赛59

替换函数

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<functional>
#include<math.h>
//#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}

string s, d;
char f[];

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int t;
    cin >> t;
    while (t--) {
        cin >> s >> d;
        int n = s.length();
        memset(f, , sizeof(f));
        bool ok = true;
        for (int i = ; i < n; i++) {
            if (f[s[i]] == ) f[s[i]] = d[i];
            else if (f[s[i]] != d[i]) ok = false;
        }
        if (ok) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return ;
}

替换函数2

树的权重

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<functional>
#include<math.h>
//#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}

VI G[];
lint sum[], sz[], ans[], n;
void dfs(int u, int fa) {
    sz[u] = ;
    sum[u] = ;
    for (int i = ; i < G[u].size(); i++) {
        int v = G[u][i];
        if (v == fa) continue;
        dfs(v, u);
        sz[u] += sz[v];
        sum[u] += (sum[v] + sz[v]);
    }
}
void solve(int u, int fa) {
    ans[u] = ans[fa] + n -  * sz[u];
    for (int i = ; i < G[u].size(); i++) {
        int v = G[u][i];
        if (v == fa) continue;
        solve(v, u);
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int u, v;
    cin >> n;
    for (int i = ; i < n; i++) {
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(, -);
    ans[] = sum[];
    for (int i = ; i < G[].size(); i++) {
        int v = G[][i];
        solve(v, );
    }
    for (int i = ; i <= n; i++) cout << ans[i] << endl;
    return ;
}

K偏差排列