Codeforces_813

A.统计总时间，从总时间开始找第一个能提交的点。

#include<bits/stdc++.h>
using namespace std;

int n,m,a[],ok[] = {};

int main()
{
    ios::sync_with_stdio();
    cin >> n;
    int sum = ;
    for(int i = ;i <= n;i++)   cin >> a[i],sum += a[i];
    cin >> m;
    for(int i = ;i <= m;i++)
    {
        int x,y;
        cin >> x >>y;
        for(int j = x;j <= y;j++)   ok[j] = ;
    }
    for(int i = sum;i <= ;i++)
    {
        if(ok[i])
        {
            cout << i << endl;
            return ;
        }
    }
    cout << - << endl;
    return ;
}

---

B.把每个unlucky值都算出来，再算最长段。

#include<bits/stdc++.h>
using namespace std;

long long x,y,l,r,a[],b[];

int main()
{
    ios::sync_with_stdio();
    cin >> x >> y >> l >> r;
    int cnt1 = ,cnt2 = ;
    a[++cnt1] = ;
    b[++cnt2] = ;
    while(a[cnt1] <= r/x)
    {
        a[cnt1+] = a[cnt1]*x;
        cnt1++;
    }
    while(b[cnt2] <= r/y)
    {
        b[cnt2+] = b[cnt2]*y;
        cnt2++;
    }
    set<long long> s;
    for(int i = ;i <=cnt1;i++)
    {
        if(a[i] > r)    continue;
        for(int j = ;j <= cnt2;j++)
        {
            if(b[j] > r) continue;
            if(a[i]+b[j] < l) continue;
            if(a[i]+b[j] > r) continue;
            s.insert(a[i]+b[j]);
        }
    }
    s.insert(l-);
    s.insert(r+);
    long long ans = ;
    for(auto it = ++s.begin();it != s.end();it++)
    {
        long long xx = *it;
        it--;
        long long yy = *it;
        it++;
        ans = max(ans,xx-yy-);
    }
    cout << ans << endl;
    return ;
}

---

C.分两种情况，Bob一直往下跑到叶子节点或者先往上跑，再往下跑到更深的叶子节点。

#include<bits/stdc++.h>
using namespace std;

int n,x,a[] = {},maxx[],ok[] = {};
int ans;
vector<int> v[];

void dfs1(int now,int pre)
{
    maxx[now] = a[now];
    for(int i = ;i < v[now].size();i++)
    {
        int t = v[now][i];
        if(t == pre)    continue;
        a[t] = a[now]+;
        dfs1(t,now);
        if(ok[t])   ok[now] = ;
        maxx[now] = max(maxx[now],maxx[t]);
    }
}

int main()
{
    ios::sync_with_stdio();
    cin >> n >> x;
    ok[x] = ;
    for(int i = ;i < n;i++)
    {
        int x,y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs1(,-);
    ans = maxx[x];
    for(int i = ;i <= n;i++)
    {
        if(ok[i])
        {
            if(a[x]-a[i] < a[i])    ans = max(ans,maxx[i]);
        }
    }
    cout << ans* << endl;
    return ;
}