NEFU要崛起——第4场 A - Chat Server's Outgoing Traffic

最新推荐文章于 2019-10-04 15:34:31 发布

原创最新推荐文章于 2019-10-04 15:34:31 发布 · 585 阅读

0 ·

CC 4.0 BY-SA版权

字符串专栏收录该内容

16 篇文章

订阅专栏

博客内容讲述了Polycarp为新项目"Polychat"实现了一个聊天服务器，该服务器处理三种类型的命令：添加人员、移除人员和发送消息。流量计算只在发送消息时发生，即为消息长度乘以当前在聊天中的人员数量。博客提供了输入输出格式的说明，并给出了一段示例输入和对应输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A -Chat Server's Outgoing Traffic

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 5A

Description

Polycarp is working on a new project called "Polychat". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands:

Include a person to the chat ('Add' command).
Remove a person from the chat ('Remove' command).
Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command).

Now Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands.

Polycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sendsl bytes to each participant of the chat, wherel is the length of the message.

As Polycarp has no time, he is asking for your help in solving this problem.

Input

Input file will contain not more than 100 commands, each in its own line. No line will exceed 100 characters. Formats of the commands will be the following:

+<name> for 'Add' command.
-<name> for 'Remove' command.
<sender_name>:<message_text> for 'Send' command.

<name> and <sender_name> is a non-empty sequence of Latin letters and digits. <message_text> can contain letters, digits and spaces, but can't start or end with a space.<message_text> can be an empty line.

It is guaranteed, that input data are correct, i.e. there will be no 'Add' command if person with such a name is already in the chat, there will be no'Remove' command if there is no person with such a name in the chat etc.

All names are case-sensitive.

Output

Print a single number — answer to the problem.

Sample Input

Input

+Mike
Mike:hello
+Kate
+Dmitry
-Dmitry
Kate:hi
-Kate

Output

Input

+Mike
-Mike
+Mike
Mike:Hi   I am here
-Mike
+Kate
-Kate

Output

题意：进入一个人“+”说出的话字符个数*当前所在的人最后都加起来：

代码：

#include <iostream>
#include <string>
using namespace std;
int main()
{
   int num=0;
   int zishu=0;
   string s;
   while(getline(cin,s,'\n'))
   {
     if(s[0]=='+')
     {
      num++;
     }
     else if(s[0]=='-')
     {
      num--;
     }
     else
     {
        int a=s.find(':',0);
        zishu+=(s.size()-a-1)*mun;
     }
    }

    cout<<zishu<<endl;
 
   return 0;
}
 
心得：stl好强大

代码·:

#include <iostream>
#include<cstring>
#include<cstdio>
#include<map>
using namespace std;

int main()
{
    char c[120];
    int sum=0;
    map<string,int>mymap;
    while(gets(c))
    {

        if(c[0]=='+')
            mymap[c]++;
        else if(c[0]=='-')
        {
            c[0]='+';
            mymap[c]--;
        }
        else 
        {
            int len=strlen(c);
            int len1=0;
            for(int i=0;i<len;i++)
            if(c[i]==':')
            {
               len1=i;
              break;
            }
             len1++;
            int bs=0;
            map<string,int>::iterator it;//主要是想多了解一下
            for(it=mymap.begin();it!=mymap.end();it++)
            if(it->second)
            bs++;
            sum+=(len-len1)*bs;
        }
    }
            cout<<sum<<endl;
            mymap.clear();

    return 0;
}

这个不是自己ac的~ 嘿嘿~