ABC209a~d题解

最近两场发现ABC前三道是签到题 第四道是图论题是简单图论
第五道第六道会加大难度
还有我发现一个问题abc的英语太难读了~唔

A

在b大于a是打印ab的差值

#include <algorithm>
#include <iostream>
#include <cstring>
 
#define xx first
#define yy second
#define ll long long
#define L(i, j, k) for (int i = j; i <= k; i ++)
#define R(i, j, k) for (int i = j; i >= k; i --)
 
using namespace std;
int a, b;
int main()
{
    cin >> a >> b;
    if (a <= b) cout << b - a + 1 << endl;
    else cout << 0 << endl;
    return 0;
}

B

四个一组四个一组判断是不是余0或者余2

#include <algorithm>
#include <iostream>
#include <cstring>
 
#define xx first
#define yy second
#define ll long long
#define L(i, j, k) for (int i = j; i <= k; i ++)
#define R(i, j, k) for (int i = j; i >= k; i --)
 
using namespace std;
 
const int N = 110;
int n, x;
int a[N];
 
int main()
{
    cin >> n >> x;
    ll sum = 0;
    for (int i = 1; i <= n; i ++ ) {
        cin >> a[i];
        if (i % 4 == 2 || i % 4 == 0) sum += a[i] - 1;
        else sum += a[i];
    }
    if (sum <= x) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

C

这题我比赛时候一直看不懂样例啊啊
后来是队友写下来12个例子我才懂了怎么回事 我太笨了
这个就是先排序
看看每个空可以填多少个数乘起来取模就ok了

#include <algorithm>
#include <iostream>
#include <cstring>
 
#define xx first
#define yy second
#define ll long long
#define L(i, j, k) for (int i = (j); i <= (k); i ++)
#define R(i, j, k) for (int i = (j); i >= (k); i --)
 
using namespace std;
 
const int N = 2e5 + 10, mod = 1e9 + 7;
int a[N];
 
int main()
{
    int n;
    cin >> n;
    L(i, 0 ,n - 1) cin >> a[i];
    sort(a, a + n);
    ll ans = 1;
    L(i, 0, n - 1) ans = ans * (a[i] - i) % mod;
    cout << ans << endl;
    return 0;
}

D

d题的话是一道LCA（最近祖先节点）的板子题
官方题解给的答案是用vector来维护关系树的

#include <vector>
#include <queue>
 
#define xx first
#define yy second
#define ll long long
#define L(i, j, k) for (int i = j; i <= k; i ++)
#define R(i, j, k) for (int i = j; i >= k; i --)
 
using namespace std;
 
int n, qq, a, b;
 
int main()
{
    cin >> n >> qq;
    vector<vector<int>>g(n);//存a b 之间的关系
    for (int i = 0; i < n - 1; i ++ ) {
        cin >> a >> b;
        g[a - 1].push_back(b - 1);//b是a的一个子节点
        g[b - 1].push_back(a - 1);//a是b的一个子节点
    }
    queue<int>q;//bfs预处理找最短的路径
    vector<int>dis(n, -1);//各个点到根节点的最短距离
    q.push(0);
    dis[0] = 0;
    while (!q.empty())
    {
        int t = q.front();
        q.pop();
        for (int x : g[t]) {
            if (dis[x] == -1){
                dis[x] = dis[t] + 1;
                q.push(x);
            }
        }
    }
    while (qq -- )
    {
        cin >> a >> b;
        if (dis[a - 1] % 2 == dis[b - 1] % 2) cout << "Town" << endl;
        if (dis[a - 1] % 2 != dis[b - 1] % 2) cout << "Road" << endl;
    }
    return 0;
}

其实按照模板的话也可以用链表来维护

#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
 
#define xx first
#define yy second
#define ll long long
#define L(i, j, k) for (int i = j; i <= k; i ++)
#define R(i, j, k) for (int i = j; i >= k; i --)
 
using namespace std;
const int N = 1e5 + 10, M = 2 * N;
int e[M], ne[M], h[M], idx;
int n, qq, q, a, b;
int dis[N];
void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
 
void bfs()
{
    queue<int>q;
    memset(dis, 0x3f, sizeof dis);
    dis[1] = 0;
    q.push(1);
    while (q.size())
    {
        int t = q.front();
        q.pop();
        for (int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (dis[j] > dis[t] + 1)
            {
                dis[j] = dis[t] + 1;
                //cout << " ~~~~" << j << " " << dis[j] << " " << endl;
                q.push(j);
            }
        }
    }
}
 
int main()
{
    cin >> n >> qq;
    memset(h, -1, sizeof h);
    for (int i = 1; i < n; i ++ )
    {
        cin >> a >> b;
        add(a, b);
        add(b, a);
    }
    bfs();
    while (qq -- )
    {
        cin >> a >> b;
        //cout << "____" << dis[a] << " " << dis[b] << endl;
        if (dis[a] % 2 == dis[b] % 2) cout << "Town" << endl;
        else cout << "Road" << endl;
    }
    return 0;
}

等我看看E和F再来更新~