寒假刷题第20天

最新推荐文章于 2024-08-22 17:27:46 发布

xp_xht123

最新推荐文章于 2024-08-22 17:27:46 发布

阅读量400

点赞数 7

分类专栏：寒假刷题文章标签：算法数据结构

本文链接：https://blog.csdn.net/xp_xht123/article/details/136021208

版权

寒假刷题专栏收录该内容

19 篇文章 0 订阅

订阅专栏

文章讲述了在C++中使用递归和unordered_map数据结构实现二叉树的最近公共祖先(LCA)算法，以及处理两个节点查找和错误处理的情况。两个示例代码分别对应题目1143和1151，涉及了树的遍历和逻辑判断。

摘要由CSDN通过智能技术生成

PTA甲级

1143 Lowest Common Ancestor

#include<iostream>
#include<algorithm>
#include<unordered_map>

using namespace std;

const int N = 1e5 + 10;
int n , m;
int pre[N] , in[N] , depth[N];
int l[N] , r[N];
unordered_map<int , int>last , idx;

int build(int il , int ir , int pl , int pr , int dep)
{
    int root = pre[pl];
    int k = idx[root];
    depth[root] = dep;

    if(il < k)
    {
        l[root] = build(il , k - 1 , pl + 1 , k - il + pl , dep + 1);
        last[l[root]] = root;
    }
    if(ir > k)
    {
        r[root] = build(k + 1 , ir , k - il + pl + 1 , pr , dep + 1);
        last[r[root]] = root;
    }
    return root;
}

int main()
{
    cin >> m >> n;
    for(int i = 0;i < n;i ++)
        cin >> pre[i] , in[i] = pre[i];

    sort(in , in + n);
    for(int i = 0;i < n;i ++)
        idx[in[i]] = i;

    int root = build(0 , n - 1 , 0 , n - 1 , 0);
    while(m --)
    {
        int a , b;
        cin >> a >> b;
        if(idx.count(a) && idx.count(b))
        {
            int x = a , y = b;
            while(a != b)
            {
                //谁深谁往上走，直到找到一样的节点是就退出
                if(depth[a] > depth[b]) a = last[a];
                else b = last[b];
            }
            if(x != a && y != a) printf("LCA of %d and %d is %d.\n", x, y, a);
            else if(x == a) printf("%d is an ancestor of %d.\n", x , y);
            else printf("%d is an ancestor of %d.\n", y , x);
        }
        else if(!idx.count(a) && !idx.count(b))
            printf("ERROR: %d and %d are not found.\n" ,a ,b);
        else if(!idx.count(b)) 
            printf("ERROR: %d is not found.\n" , b);
        else 
            printf("ERROR: %d is not found.\n" , a);
    }
    return 0;
}

1151 LCA in a Binary Tree

#include<iostream>
#include<algorithm>
#include<unordered_map>

using namespace std;

const int N = 1e6 + 10;
int n , m;
int pre[N] , in[N] , depth[N];
int l[N] , r[N];
unordered_map<int , int>last , idx;

int build(int il , int ir , int pl , int pr , int dep)
{
    int root = pre[pl];
    int k = idx[root];
    depth[root] = dep;

    if(il < k)
    {
        l[root] = build(il , k - 1 , pl + 1 , k - il + pl , dep + 1);
        last[l[root]] = root;
    }
    if(ir > k)
    {
        r[root] = build(k + 1 , ir , k - il + pl + 1 , pr , dep + 1);
        last[r[root]] = root;
    }
    return root;
}

int main()
{
    cin >> m >> n;
    for(int i = 0;i < n;i ++) cin >> in[i] , idx[in[i]] = i;
    for(int i = 0;i < n;i ++) cin >> pre[i];

    int root = build(0 , n - 1 , 0 , n - 1 , 0);
    while(m --)
    {
        int a , b;
        cin >> a >> b;
        if(idx.count(a) && idx.count(b))
        {
            int x = a , y = b;
            while(a != b)
            {
                //谁深谁往上走，直到找到一样的节点是就退出
                if(depth[a] > depth[b]) a = last[a];
                else b = last[b];
            }
            if(x != a && y != a) printf("LCA of %d and %d is %d.\n", x, y, a);
            else if(x == a) printf("%d is an ancestor of %d.\n", x , y);
            else printf("%d is an ancestor of %d.\n", y , x);
        }
        else if(!idx.count(a) && !idx.count(b))
            printf("ERROR: %d and %d are not found.\n" ,a ,b);
        else if(!idx.count(b)) 
            printf("ERROR: %d is not found.\n" , b);
        else 
            printf("ERROR: %d is not found.\n" , a);
    }
    return 0;
}

1148 Werewolf - Simple Version

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

int n;
vector<int>v(n + 10);

int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++) cin >> v[i];

    for(int i = 1;i <= n;i ++)
    {
        for(int j = i + 1;j <= n;j ++)
        {
            vector<int>v1(n + 10 , 1); //该人是狼人还是好人 等于1表示是好人，等于-1表示是狼人
            vector<int>v2;
            v1[i] = v1[j] = -1;
            for(int k = 1;k <= n;k ++)
                if(v[k] * v1[abs(v[k])] < 0) v2.push_back(k);
            if(v2.size() == 2 && v1[v2[0]] + v1[v2[1]] == 0) // 说谎人数等于2并且这两个说谎的人一个是好人一个是狼人
            {
                cout << i << " " << j << endl;
                return 0;
            }
        }
    }
    puts("No Solution");
    return 0;
}

补牛客寒假第一次