2024 暑假友谊赛-热身2

a.2024 暑假友谊赛-热身2 - Virtual Judge (vjudge.net)

思路：

设从第 i𝑖 个关卡通关的期望为 Ei𝐸𝑖。显然
𝐸𝑖=𝑝𝑖(𝐸𝑖+1+1)+(1−𝑝𝑖)(𝐸1+1)

特别地，𝐸𝑛+1=0，且答案为 E1𝐸1。

那么有
𝐸1=𝑝1(𝐸2+1)+(1−𝑝1)(𝐸1+1)⇒𝐸1=1𝑝1+𝐸2

同理将上述式子代入
𝐸2=𝑝2(𝐸3+1)+(1−𝑝2)(𝐸2+1)⇒𝐸1=1+1𝑝1𝑝2+𝐸3

继续推导可以发现答案为
E1=1+1+1+⋯pn−2pn−1pn

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=2e5+5;
const int mod=998244353;
int a[maxm];//
int d[maxm];//d[i]表示到达i的期望次数
int n;
int ppow(int a,int b,int mod){
    int ans=1%mod;a%=mod;
    while(b){
        if(b&1)ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}
signed main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        d[i]=(d[i-1]+1)%mod*100%mod*ppow(a[i],mod-2,mod)%mod;
    }
    cout<<d[n]<<endl;
    return 0;
}

*b2024 暑假友谊赛-热身2 - Virtual Judge (vjudge.net)

思路：有，cf的F题，不好过

首先，距离树上的任意一个节点最远的节点一定是某条直径的某个端点。

#include <bits/stdc++.h>

#define int long long 
const int inf = 1e18;

void solved ()
{
    int n, c = 0;
    std::cin >> n;
    std::vector<std::vector<int>> e(n + 1);
    std::vector<int> d1(n + 1), d2(n + 1), p;
    std::vector<int> vis(n + 1);

    for(int i = 0; i < n - 1; i++){
        int u, v;
        std::cin >> u >> v;
        e[u].emplace_back(v);
        e[v].emplace_back(u);
    }

    std::function<void(int, int, std::vector<int>&)> dfs = [&](int u, int fa, std::vector<int> &d) -> void{
        for(auto i : e[u]){
            if(i == fa) continue;
            d[i] = d[u] + 1;
            if(d[i] > d[c]) c = i;
            dfs(i, u, d);
            vis[u] |= vis[i];
        }
        if(vis[u] == true) p.emplace_back(u);
    };

    dfs(1, 0, d1);
    int l = c;
    d1[l] = 0;
    dfs(l, 0, d1);
    int r = c;
    vis[l] = true;
    dfs(r, 0, d2);

    int tot = (int)p.size() - 1;
    int ans = 0;
    std::vector<std::pair<int, int>> res;

    for(int i = 1; i <= n; i++){
        if(vis[i] == false){
            int a = l, b = i;
            if(d2[i] > d1[i]) a = r;
            ans += std::max(d1[i], d2[i]);
            res.emplace_back(a, b);
        }
    }

    std::sort(res.begin(), res.end(), [&](auto A, auto B){
        return d1[A.second] > d1[B.second];
    });

    for(auto i : p){
        ans += d1[i];
        res.emplace_back(p.back(), i);
    }
    res.pop_back();
    
    std::cout << ans << '\n';
    for(auto [i, j] : res){
        std::cout << i << ' ' << j << ' ' << j << '\n';
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    // std::cin >> t;
    for(int i = 0; i < t; i++) solved ();

    return 0;
}

*c2024 暑假友谊赛-热身2 - Virtual Judge (vjudge.net)

思路：无（不会）

代码：

#include <bits/stdc++.h>

#define int long long 

void solved ()
{
    int n, res = 0;
    std::cin >> n;
    std::vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) std::cin >> a[i];

    std::vector<std::vector<bool>> dp(n + 1, std::vector<bool>(n + 1, false));
    auto g = dp;
    
    dp[0][0] = true;
    for(int i = 1; i <= n; i++)
    {
        dp[i] = dp[i - 1];

        int mex = 0;
        std::vector<bool>vis(n + 1);
        for(int j = i; j > 0; j--)
        {
            vis[a[j]] = true;
            if(vis[mex])
            {
                while(vis[mex]) mex++;
                if(g[j][mex]) continue;
                g[j][mex] = true;
                for(int k = 0; k <= j; k++)
                {
                    if(dp[j - 1][k])
                    {
                        dp[i][mex ^ k] = true;
                    }
                }
            }
        }
        for(int j = 1; j <= n; j++) if(dp[i][j]) res = std::max(res, j);
    }
    
    std::cout << res << '\n';
}

signed main() 
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    std::cin >> t;
    while(t--) solved ();

    return 0;
}

*h2024 暑假友谊赛-热身2 - Virtual Judge (vjudge.net)

思路：线段数加dp,不太会。

代码：

#include <bits/stdc++.h>

#define int long long
#define lowbit(x) x&(-x)

const int M = 3e5;

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0), std::cout.tie(0);

  int n, k, ans = 0;
  std::cin >> n >> k;
  std::vector<int> a(n + 1), c(M + 7 << 2), f(n + 1);

  auto push_up = [&](int p) { c[p] = std::max(c[p << 1], c[p << 1 | 1]); };

  auto build = [&](auto build, int p, int l, int r) {
    if (l == r) {
      c[p] = 0;
      return;
    }
    int mid = l + r >> 1;
    build(build, p << 1, l, mid);
    build(build, p << 1 | 1, mid + 1, r);
    push_up(p);
    return;
  };

  auto up_date = [&](auto up_date, int p, int l, int r, int x, int k) {
    if (l == r) {
      c[p] = std::max(c[p], k);
      return;
    }
    int mid = l + r >> 1;
    if (x <= mid) {
      up_date(up_date, p << 1, l, mid, x, k);
    } else
      up_date(up_date, p << 1 | 1, mid + 1, r, x, k);
    push_up(p);
    return;
  };

  auto query = [&](auto query, int p, int l, int r, int x, int y) {
    if (x <= l && y >= r) return c[p];
    int mid = l + r >> 1;
    int res = 0;
    if (x <= mid)
      res = std::max(res, query(query, p << 1, l, mid, x, y));
    if (y >= mid + 1)
      res = std::max(res, query(query, p << 1 | 1, mid + 1, r, x, y));
    return res;
  };

  for (int i = 1; i <= n; i++) std::cin >> a[i];

  build(build, 1, 0, M);
  for (int i = 1; i <= n; i++) {
    int l = std::max(0ll, a[i] - k);
    int r = std::min(M, a[i] + k);
    int res = query(query, 1, 0, M, l, r);
    f[i] = res + 1;
    up_date(up_date, 1, 0, M, a[i], f[i]);
    ans = std::max(ans, f[i]);
  }

  std::cout << ans;

  return 0;
}