zoukankan      html  css  js  c++  java
  • Milking Order II

    题目描述

    Farmer John's N cows (2≤N≤100), conveniently numbered 1…N as always, happen to have too much time on their hooves. As a result, they have worked out a complex social structure related to the order in which Farmer John milks them every morning. After weeks of study, Farmer John has discovered that this structure is based on two key properties.
    First, due to the cows' social hierarchy, some cows insist on being milked before other cows, based on the social status level of each cow. For example, if cow 3 has the highest status, cow 2 has average status, and cow 5 has low status, then cow 3 would need to be milked earliest, followed later by cow 2 and finally by cow 5.

    Second, some cows only allow themselves to be milked at a certain position within the ordering. For example, cow 4 might insist on being milked second among all the cows.

    Luckily, Farmer John will always be able to milk his cows in an order satisfying all of these conditions.

    Unfortunately, cow 1 has recently fallen ill, so Farmer John wants to milk this cow as early in the order as possible so that she can return to the barn and get some much-needed rest. Please help Farmer John determine the earliest position cow 1 can appear in the milking order.

    输入

    The first line contains N, M (1≤M<N), and K (1≤K<N), indicating that Farmer John has N cows, M of his cows have arranged themselves into a social hierarchy, and K of his cows demand that they be milked in a specific position in the order. The next line contains M distinct integers mimi (1≤mi≤N). The cows present on this line must be milked in the same order in which they appear in this line. The next K lines contain two integers ci (1≤ci≤N) and pi (1≤pi≤N), indicating that cow cici must be milked in position pi.
    It is guaranteed that under these constraints, Farmer John will be able to construct a valid milking order.

    输出

    Please output the earliest position cow 1 can take in the milking order。
     
    #include <bits/stdc++.h>
    #define ll long long
    using namespace std;
    int n,m,k;
    int a[205];
    struct node
    {
        int x,p;
    }b[205];
    map<int,int>mp,vis;
    bool check(int p)
    {
        for(int i=0;i<k;i++)
        {
            vis[b[i].x]=b[i].p;
            mp[b[i].p]=b[i].x;
        }
        if(mp[p])
            return false;
        mp[p]=1;
        vis[1]=p;
        int q=1,e=1;
        while(e<=n&&q<=m)
        {
            if(!vis[a[q]])
            {
                if(!mp[e])
                {
                    mp[e]=a[q];
                    vis[a[q]]=e;
                    q++;
                    e++;
                }
                else
                {
                    int tt=0;
                    for(int j=1;j<=m;j++)
                    {
                        if(a[j]==mp[e])
                        {
                            tt=j;
                            break;
                        }
                    }
                    if(tt>q&&tt)
                    {
                        return false;
                    }
                    e++;
                }
            }
            else
            {
                int tt=0;
                for(int i=1;i<=m;i++)
                {
                    if(a[i]==mp[e])
                    {
                        tt=i;
                        break;
                    }
                }
                if(tt&&tt>q)
                    return false;
                if(e<=vis[a[q]])
                {
                    e=vis[a[q]]+1;
                }
                else
                    return false;
                q++;
            }
        }
        //cout<<e<<" "<<m<<endl;
        if(e<=m)
            return 0;
        return 1;
    }
    int main()
    {
        scanf("%d %d %d",&n,&m,&k);
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0;i<k;i++)
        {
            int x,p;
            scanf("%d %d",&x,&p);
            b[i].x=x;
            b[i].p=p;
        }
        if(vis[1])
        {
            printf("%d",vis[1]);
            return 0;
        }
        for(int i=1;i<=n;i++)
        {
            mp.clear();
            vis.clear();
            if(check(i))
            {
                printf("%d
    ",i);
                return 0;
            }
        }
        return 0;
    }
  • 相关阅读:
    学过C#之后,对javascript数组容易犯的错误
    关于最优种植区评价问题
    JavaScript全局变量与局部变量
    ArcGIS API for Javascript 图层切换渐变效果实现
    Motan在服务provider端用于处理request的线程池
    转:Log4j 日志体系结构
    zookeeper的开机自启动
    maven的多模块项目搭建
    scala中json与对象的转换
    社区帖子全文搜索实战(基于ElasticSearch)
  • 原文地址:https://www.cnblogs.com/Diliiiii/p/10279551.html
Copyright © 2011-2022 走看看