zoukankan      html  css  js  c++  java
  • Mahmoud and Ehab and the message

    Mahmoud wants to send a message to his friend Ehab. Their language consists of n words numbered from 1 to n. Some words have the same meaning so there are k groups of words such that all the words in some group have the same meaning.

    Mahmoud knows that the i-th word can be sent with cost ai. For each word in his message, Mahmoud can either replace it with another word of the same meaning or leave it as it is. Can you help Mahmoud determine the minimum cost of sending the message?

    The cost of sending the message is the sum of the costs of sending every word in it.

    Input

    The first line of input contains integers nk and m (1 ≤ k ≤ n ≤ 105, 1 ≤ m ≤ 105) — the number of words in their language, the number of groups of words, and the number of words in Mahmoud's message respectively.

    The second line contains n strings consisting of lowercase English letters of length not exceeding 20 which represent the words. It's guaranteed that the words are distinct.

    The third line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) where ai is the cost of sending the i-th word.

    The next k lines describe the groups of words of same meaning. The next k lines each start with an integer x (1 ≤ x ≤ n) which means that there are x words in this group, followed by x integers which represent the indices of words in this group. It's guaranteed that each word appears in exactly one group.

    The next line contains m space-separated words which represent Mahmoud's message. Each of these words appears in the list of language's words.

    Output

    The only line should contain the minimum cost to send the message after replacing some words (maybe none) with some words of the same meaning.

    Examples
    input
    Copy
    5 4 4
    i loser am the second
    100 1 1 5 10
    1 1
    1 3
    2 2 5
    1 4
    i am the second
    output
    Copy
    107
    input
    Copy
    5 4 4
    i loser am the second
    100 20 1 5 10
    1 1
    1 3
    2 2 5
    1 4
    i am the second
    output
    Copy
    116
    Note

    In the first sample, Mahmoud should replace the word "second" with the word "loser" because it has less cost so the cost will be 100+1+5+1=107.

    In the second sample, Mahmoud shouldn't do any replacement so the cost will be 100+1+5+10=116.


    阅读理解题

    #include <iostream>
    #include <vector>
    #include <algorithm>
    #include <string>
    #include <set>
    #include <queue>
    #include <map>
    #include <sstream>
    #include <cstdio>
    #include <cstring>
    #include <numeric>
    #include <cmath>
    #include <unordered_set>
    #include <unordered_map>
    //#include <xfunctional>
    #define ll long long
    #define mod 998244353
    using namespace std;
    int dir[4][2] = { {0,1},{0,-1},{-1,0},{1,0} };
    const int maxn = 16;
    const long long inf = 0x7f7f7f7f7f7f7f7f;
    const int INT = 0x3f3f3f3f;
    int main()
    {
        int n, k, m;
        cin >> n >> k >> m;
        vector<string> s(n + 1);
        map<string, int> mp;
        map<int, int> mpn;
        for (int i = 1; i <= n; i++)
        {
            cin >> s[i];
            mp[s[i]] = i;
        }
        for (int i = 1; i <= n; i++)
        {
            int t;
            cin >> t;
            mpn[i] = t;
        }
        for (int i = 0; i < k; i++)
        {
            int all,minn=INT;
            cin >> all;
            vector<int> v(all);
            for(int i=0;i<all;i++)
            {
                cin >> v[i];
                minn = min(minn, mpn[v[i]]);
            }
            for (int i = 0; i < all; i++)
            {
                mpn[v[i]] = minn;
            }
        }
        ll res=0;
        while (m--)
        {
            string ss;
            cin >> ss;
            res += mpn[mp[ss]];
        }
        cout << res;
        return 0;
    }
  • 相关阅读:
    HTML5 Video/Audio播放本地文件
    jquery 美化弹出提示 漂亮的Dialog 对话框
    JavaScript中变量、作用域、内存问题
    利用nethogs查看哪些进程占用网络带宽
    Dell服务器硬件监控,使用omreport出现object not found 错误解决
    filebeat收集nginx的json格式日志
    利用logrotate切割nginx的access.log日志
    Linux下单机部署ELK日志收集、分析环境
    linux开启Rsyslog服务收集日志
    mysql占用磁盘IO过高的解决办法
  • 原文地址:https://www.cnblogs.com/dealer/p/12369076.html
Copyright © 2011-2022 走看看