zoukankan      html  css  js  c++  java
  • Codeforces Round #541 (Div. 2) D. Gourmet choice(并查集+拓扑排序)

    D. Gourmet choice
    time limit per test2 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    Mr. Apple, a gourmet, works as editor-in-chief of a gastronomic periodical. He travels around the world, tasting new delights of famous chefs from the most fashionable restaurants. Mr. Apple has his own signature method of review — in each restaurant Mr. Apple orders two sets of dishes on two different days. All the dishes are different, because Mr. Apple doesn’t like to eat the same food. For each pair of dishes from different days he remembers exactly which was better, or that they were of the same quality. After this the gourmet evaluates each dish with a positive integer.

    Once, during a revision of a restaurant of Celtic medieval cuisine named «Poisson», that serves chestnut soup with fir, warm soda bread, spicy lemon pie and other folk food, Mr. Apple was very pleasantly surprised the gourmet with its variety of menu, and hence ordered too much. Now he’s confused about evaluating dishes.

    The gourmet tasted a set of n dishes on the first day and a set of m dishes on the second day. He made a table a of size n×m, in which he described his impressions. If, according to the expert, dish i from the first set was better than dish j from the second set, then aij is equal to “>”, in the opposite case aij is equal to “<”. Dishes also may be equally good, in this case aij is “=”.

    Now Mr. Apple wants you to help him to evaluate every dish. Since Mr. Apple is very strict, he will evaluate the dishes so that the maximal number used is as small as possible. But Mr. Apple also is very fair, so he never evaluates the dishes so that it goes against his feelings. In other words, if aij is “<”, then the number assigned to dish i from the first set should be less than the number of dish j from the second set, if aij is “>”, then it should be greater, and finally if aij is “=”, then the numbers should be the same.

    Help Mr. Apple to evaluate each dish from both sets so that it is consistent with his feelings, or determine that this is impossible.

    Input
    The first line contains integers n and m (1≤n,m≤1000) — the number of dishes in both days.

    Each of the next n lines contains a string of m symbols. The j-th symbol on i-th line is aij. All strings consist only of “<”, “>” and “=”.

    Output
    The first line of output should contain “Yes”, if it’s possible to do a correct evaluation for all the dishes, or “No” otherwise.

    If case an answer exist, on the second line print n integers — evaluations of dishes from the first set, and on the third line print m integers — evaluations of dishes from the second set.

    Examples
    inputCopy
    3 4

    outputCopy
    Yes
    2 2 2
    1 1 1 1
    inputCopy
    3 3

    <<<

    outputCopy
    Yes
    3 1 3
    2 2 2
    inputCopy
    3 2

    =<

    outputCopy
    No
    Note
    In the first sample, all dishes of the first day are better than dishes of the second day. So, the highest score will be 2, for all dishes of the first day.

    In the third sample, the table is contradictory — there is no possible evaluation of the dishes that satisfies it.

    没写 暂且放到博客上当作拓扑排序例题
    看了大牛代码 有空自己撸一遍
    http://www.manongjc.com/article/60961.html
    拓扑排序讲解
    https://blog.csdn.net/qq_35644234/article/details/60578189

  • 相关阅读:
    BigDecimal加减乘除计算方式
    Element-UI 关于table中fixed使用和table样式混乱问题处理
    java集合框架中contains(),containsKey()和containsValue()的用法
    Vue中子组件watch监听props中父组件对象的变化的坑
    js中使用splice在一次循环删除数组中的多个元素
    Java中instanceof关键字的理解
    List.contains(Object object)方法,比较对象是否相同
    Vue 动态路由的实现以及 Springsecurity 按钮级别的权限控制
    sql中#与$的区别
    Vue自定义指令实现按钮级权限控制功能
  • 原文地址:https://www.cnblogs.com/caowenbo/p/11852337.html
Copyright © 2011-2022 走看看