當(dāng)前位置：首頁(yè) > 芯聞號(hào) > 充電吧

HDU 5071 Chat （神一般的模擬題）

時(shí)間：2019-12-09 11:22:27

關(guān)鍵字： hdu 區(qū)域賽

手機(jī)看文章

掃描二維碼
隨時(shí)隨地手機(jī)看文章

[導(dǎo)讀]題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=5071 題面： Chat Time Limit: 2000/1000 MS (Java/Others

題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=5071

題面：

Chat Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 2195????Accepted Submission(s): 465

Problem Description As everyone knows, DRD has no girlfriends. But as everyone also knows, DRD’s friend ATM’s friend CLJ has many potential girlfriends. One evidence is CLJ’s chatting record.

CLJ chats with many girls all the time. Sometimes he begins a new conversation and sometimes he ends a conversation. Sometimes he chats with the girl whose window is on the top.

You can imagine CLJ’s windows as a queue. The first girl in the queue is the top girl if no one is “always on top ”.

Since CLJ is so popular, he begins to assign a unique positive integer as priority for every girl. The higher priority a girl has, the more CLJ likes her. For example, GYZ has priority 10⁹, and JZP has priority 10⁸ while Sister Soup has priority 1, and Face Face has priority 2.

As a famous programmer, CLJ leads a group to implement his own WM(window manager). The WM will log CLJ’s operations. Now you are supposed to implement the log system. The general logging format is “Operation #X: LOGMSG.”, where X is the number of the operation and LOGMSG is the logging message.

There are several kinds of operations CLJ may use:

1.Add u: CLJ opens a new window whose priority is u, and the new window will be the last window in the window queue. This operation will always be successful except the only case in which there is already a window with priority u. If it is successful, LOGMSG will be “success”. Otherwise LOGMSG will be “same priority”.

2.Close u: CLJ closes a window whose priority is u. If there exists such a window, the operation will be successful and LOGMSG will be “close u with c”, where u is the priority and c is the number of words CLJ has spoken to this window. Otherwise, LOGMSG will be “invalid priority”. Note that ANY window can be closed.

3.Chat w: CLJ chats with the top window, and he speaks w words. The top window is the first window in the queue, or the “always on top” window (as described below) instead if there exists. If no window is in the queue, LOGMSG will be “empty”, otherwise the operation can be successful and LOGMSG will be “success”.

4.Rotate x: CLJ performs one or more Alt-Tabs to move the x-th window to the first one in the queue. For example, if there are 4 windows in the queue, whose priorities are 1, 3, 5, 7 respectively and CLJ performs “Rotate 3”, then the window’s priorities in the queue will become 5, 1, 3, 7. Note that if CLJ wants to move the first window to the head, this operation is still considered “successful”. If x is out of range (smaller than 1 or larger than the size of the queue), LOGMSG will be “out of range”. Otherwise LOGMSG should be “success”.

5.Prior: CLJ finds out the girl with the maximum priority and then moves the window to the head of the queue. Note that if the girl with the maximum priority is already the first window, this operation is considered successful as well. If the window queue is empty, this operation will fail and LOGMSG must be “empty”. If it is successful, LOGMSG must be “success”.

6.Choose u: CLJ chooses the girl with priority u and moves the window to the head of the queue.This operation is considered successful if and only if the window with priority u exists. LOGMSG for the successful cases should be “success” and for the other cases should be “invalid priority”.

7.Top u: CLJ makes the window of the girl with priority u always on top. Always on top is a special state, which means whoever the first girl in the queue is, the top one must be u if u is always on top. As you can see, two girls cannot be always on top at the same time, so if one girl is always on top while CLJ wants another always on top, the first will be not always on top any more, except the two girls are the same one. Anyone can be always on top. LOGMSG is the same as that of the Choose operation.

8.Untop: CLJ cancels the “always on top” state of the girl who is always on top. That is, the girl who is always on top now is not in this special state any more. This operation will fail unless there is one girl always on top. If it fails, LOGMSG should be “no such person”, otherwise should be “success”.

As a gentleman, CLJ will say goodbye to every active window he has ever spoken to at last, “active” here means the window has not been closed so far. The logging format is “Bye u: c” where u is the priority and c is the number of words he has ever spoken to this window. He will always say good bye to the current top girl if he has spoken to her before he closes it. ?
Input The first line contains an integer T (T ≤ 10), denoting the number of the test cases.

For each test case, the first line contains an integer n(0 < n ≤ 5000), representing the number of operations. Then follow n operations, one in a line. All the parameters are positive integers below 10⁹. ?
Output Output all the logging contents. ?
Sample Input

1 18 Prior Add 1 Chat 1 Add 2 Chat 2 Top 2 Chat 3 Untop Chat 4 Choose 2 Chat 5 Rotate 2 Chat 4 Close 2 Add 3 Prior Chat 2 Close 1 ?
Sample Output

Operation #1: empty. Operation #2: success. Operation #3: success. Operation #4: success. Operation #5: success. Operation #6: success. Operation #7: success. Operation #8: success. Operation #9: success. Operation #10: success. Operation #11: success. Operation #12: success. Operation #13: success. Operation #14: close 2 with 8. Operation #15: success. Operation #16: success. Operation #17: success. Operation #18: close 1 with 11. Bye 3: 2 HintThis problem description does not relate to any real person in THU. ?
Source 2014 Asia AnShan Regional Contest

解題：

??? 之前一直覺得很煩，沒敢寫，沒想到居然能1A，還是比較驚喜的！

??? 對(duì)應(yīng)8種操作，我采用的數(shù)據(jù)結(jié)構(gòu)是兩個(gè)map。第一個(gè)map為<(int)pos，(node)n>，其中pos為位置，n為節(jié)點(diǎn)，節(jié)點(diǎn)中包含兩個(gè)值u（優(yōu)先級(jí)權(quán)值），w（單詞數(shù)量）。第二個(gè)map為<(int)u,(int)pos>其中u為優(yōu)先級(jí)權(quán)值，pos為位置，topp存儲(chǔ)的是被top的那個(gè)對(duì)象的優(yōu)先級(jí)，如果為-1，則說(shuō)明，沒有對(duì)象處在top狀態(tài)，sz為當(dāng)前節(jié)點(diǎn)數(shù)量。topp和sz都需要時(shí)時(shí)更新。

??? 1.添加操作，先看是否已經(jīng)存在（map.count判斷），若沒有，則添加，否則顯示錯(cuò)誤信息。

??? 2.關(guān)閉操作，看是否存在，若不存在，顯示錯(cuò)誤信息，否則刪除當(dāng)前節(jié)點(diǎn)，并將后面的往上順移一位。

??? 3.聊天操作，看sz是否為0，若為0，則顯示錯(cuò)誤信息。若不為0，則看topp是否為-1，若不為-1，則通過(guò)map2找到對(duì)應(yīng)位置，更新map1中的值，若為-1，則更新位置為1的map1中的值。

??? 4.置頂操作，首先判斷是否越界，不越界則將該位置提到首位即可，其實(shí)應(yīng)該寫成函數(shù)供下面功能使用，不過(guò)好在代碼都是差不多的，拷貝下就好了。

??? 5.優(yōu)先級(jí)置頂，循環(huán)遍歷，然后將該位置置頂，與上同。

??? 6.通過(guò)map2找到對(duì)應(yīng)位置，并置頂。

??? 7.將topp值改成此時(shí)的u值。

??? 8.將topp還原為-1。

??? 最后要注意還要輸出和剩下的沒關(guān)閉的窗口聊天的數(shù)量，若為0，則不需輸出，同時(shí)要將優(yōu)先級(jí)最高的先輸出。

坑點(diǎn)：

??? 1.topp值和sz值需時(shí)時(shí)維護(hù)。

??? 2.數(shù)量應(yīng)用long long保存。

??? 3.輸出答案時(shí)，最后是有'.'的。

??? 4.最后輸出窗口要先輸出處于top狀態(tài)的，沒有就按順序即可。

代碼：

#include 
#include 
#include 
#include 
#define LL long long 
using namespace std;
struct node
{
   node (int x,LL y)
   {
	   u=x;
	   w=y;
   }
   node ()
   {
	   u=0;
	   w=0;
   }
   node (const node &xx)
   {
	   u=xx.u;
	   w=xx.w;
   }
   //u優(yōu)先級(jí)權(quán)值，w數(shù)量
   int u;
   LL w;
};
map  store;
map  refl;
int main()
{
    int t,n,val,sz,pos,topp,uu,maxn;
	LL amt,ww;
	char oper[10];
	scanf("%d",&t);
	node tmp;
	for(int i=1;i<=t;i++)
	{
		store.clear();
		refl.clear();
		sz=0;
		topp=-1;
		scanf("%d",&n);
		for(int j=1;j<=n;j++)
		{
			printf("Operation #%d: ",j);
			getchar();
			scanf("%s",oper);
			//加操作
			if(oper[0]=='A')
			{
				scanf("%d",&val);
                if(!refl.count(val))
				{
					printf("success.n");
                    tmp.w=0;
					tmp.u=val;
                    pos=++sz;
                    refl[val]=pos;
					store[pos]=tmp;
				}
				else
				printf("same priority.n");
			}
			//關(guān)閉操作
			else if(oper[0]=='C'&&oper[1]=='l')
			{
				scanf("%d",&val);
				if(!refl.count(val))
				  printf("invalid priority.n");
				else
				{
                  if(val==topp)
					  topp=-1;
                  pos=refl[val];
				  amt=store[pos].w;
                  refl.erase(val);
				  for(int k=pos+1;k<=sz;k++)
				  {
					  uu=store[k].u;
					  store[k-1].u=store[k].u;
					  store[k-1].w=store[k].w;
					  refl[uu]=k-1;
				  }
				  store.erase(sz);
				  sz--;
                  printf("close %d with %d.n",val,amt);
				}
			}
			//聊天功能
			else if(oper[0]=='C'&&oper[2]=='a')
			{
				scanf("%d",&val);
				if(sz==0)
					printf("empty.n");
				else
				{
					printf("success.n");
					if(topp==-1)
						store[1].w+=val;
					else
					{
						pos=refl[topp];
						store[pos].w+=val;
					}
				}
			}
			//置頂操作
			else if(oper[0]=='R')
			{
				scanf("%d",&val);
				if(val<1||val>sz)
					printf("out of range.n");
				else
				{
				   printf("success.n");
                   uu=store[val].u;
				   ww=store[val].w;
				   for(int k=val-1;k>=1;k--)
				   {
                     store[k+1].u=store[k].u;
					 store[k+1].w=store[k].w;
					 refl[store[k+1].u]=k+1;
				   }
				   store[1].u=uu;
				   store[1].w=ww;
				   refl[uu]=1;
				}
			}
			//優(yōu)先級(jí)置頂
			else if(oper[0]=='P')
			{
               if(sz==0)
				   printf("empty.n");
			   else
			   {
				   printf("success.n");
				   maxn=0;
				   for(int k=1;k<=sz;k++)
				   {
					   if(store[k].u>maxn)
						   maxn=store[k].u;
				   }
				   val=refl[maxn];
				   uu=store[val].u;
				   ww=store[val].w;
				   for(int k=val-1;k>=1;k--)
				   {
                     store[k+1].u=store[k].u;
					 store[k+1].w=store[k].w;
					 refl[store[k+1].u]=k+1;
				   }
				   store[1].u=uu;
				   store[1].w=ww;
				   refl[uu]=1;
			   }
			}
			//選擇置頂
			else if(oper[0]=='C')
			{
				scanf("%d",&val);
				if(!refl.count(val))
			      printf("invalid priority.n");
				else
				{
					printf("success.n");
					val=refl[val];
 				    uu=store[val].u;
				    ww=store[val].w;
				    for(int k=val-1;k>=1;k--)
				    {
                      store[k+1].u=store[k].u;
					  store[k+1].w=store[k].w;
					  refl[store[k+1].u]=k+1;
				    }
				    store[1].u=uu;
				    store[1].w=ww;
				    refl[uu]=1;
				}
			}
			//top操作
			else if(oper[0]=='T')
			{
				scanf("%d",&val);
				if(!refl.count(val))
                  printf("invalid priority.n");
				else
				{
					printf("success.n");
					topp=val;
				}
			}
			//untop操作
			else if(oper[0]=='U')
			{
                if(topp==-1)
					printf("no such person.n");
				else
				{
					printf("success.n");
					topp=-1;
				}
			}
		}
		//特殊優(yōu)先級(jí)優(yōu)先
		if(topp!=-1&&store[refl[topp]].w)
			printf("Bye %d: %I64dn",topp,store[refl[topp]].w);
		for(int i=1;i<=sz;i++)
		{
			//優(yōu)先級(jí)只需輸出一次
			if(store[i].u!=topp&&store[i].w>0)
				printf("Bye %d: %I64dn",store[i].u,store[i].w);
		}
	}
	return 0;
}

本站聲明：本文章由作者或相關(guān)機(jī)構(gòu)授權(quán)發(fā)布，目的在于傳遞更多信息，并不代表本站贊同其觀點(diǎn)，本站亦不保證或承諾內(nèi)容真實(shí)性等。需要轉(zhuǎn)載請(qǐng)聯(lián)系該專欄作者，如若文章內(nèi)容侵犯您的權(quán)益，請(qǐng)及時(shí)聯(lián)系本站刪除。

換一批

阿維塔、賽力斯已入股！華為引望可能成“中國(guó)博世”

9月2日消息，不造車的華為或?qū)⒋呱龈蟮莫?dú)角獸公司，隨著阿維塔和賽力斯的入局，華為引望愈發(fā)顯得引人矚目。

關(guān)鍵字：阿維塔塞力斯華為

[美通社全球TMT]

Trianz與AWS達(dá)成戰(zhàn)略合作協(xié)議，徹底改變?cè)撇捎煤凸芾矸绞?/a>

加利福尼亞州圣克拉拉縣2024年8月30日 /美通社/ -- 數(shù)字化轉(zhuǎn)型技術(shù)解決方案公司Trianz今天宣布，該公司與Amazon Web Services （AWS）簽訂了...

關(guān)鍵字： AWS AN BSP 數(shù)字化

[美通社全球TMT]

人工智能驅(qū)動(dòng)工具SODA V將顛覆汽車市場(chǎng)，使汽車開發(fā)時(shí)間和成本降低90%

倫敦2024年8月29日 /美通社/ -- 英國(guó)汽車技術(shù)公司SODA.Auto推出其旗艦產(chǎn)品SODA V，這是全球首款涵蓋汽車工程師從創(chuàng)意到認(rèn)證的所有需求的工具，可用于創(chuàng)建軟件定義汽車。 SODA V工具的開發(fā)耗時(shí)1.5...

關(guān)鍵字：汽車人工智能智能驅(qū)動(dòng) BSP

[美通社全球TMT]

從容應(yīng)對(duì)未知風(fēng)險(xiǎn)----解密亞馬遜云科技的韌性之道

北京2024年8月28日 /美通社/ -- 越來(lái)越多用戶希望企業(yè)業(yè)務(wù)能7×24不間斷運(yùn)行，同時(shí)企業(yè)卻面臨越來(lái)越多業(yè)務(wù)中斷的風(fēng)險(xiǎn)，如企業(yè)系統(tǒng)復(fù)雜性的增加，頻繁的功能更新和發(fā)布等。如何確保業(yè)務(wù)連續(xù)性，提升韌性，成...

關(guān)鍵字：亞馬遜解密控制平面 BSP

[通信先鋒]

中國(guó)游戲市場(chǎng)開始復(fù)蘇！騰訊、網(wǎng)易等巨頭縮減在日本投資

8月30日消息，據(jù)媒體報(bào)道，騰訊和網(wǎng)易近期正在縮減他們對(duì)日本游戲市場(chǎng)的投資。

關(guān)鍵字：騰訊編碼器 CPU

[通信先鋒]

獨(dú)立自主！華為董事：致力打造不依賴西方的技術(shù)

8月28日消息，今天上午，2024中國(guó)國(guó)際大數(shù)據(jù)產(chǎn)業(yè)博覽會(huì)開幕式在貴陽(yáng)舉行，華為董事、質(zhì)量流程IT總裁陶景文發(fā)表了演講。

關(guān)鍵字：華為 12nm EDA 半導(dǎo)體

[通信先鋒]

華為張平安：數(shù)字世界話語(yǔ)權(quán)最終由生態(tài)繁榮決定！

8月28日消息，在2024中國(guó)國(guó)際大數(shù)據(jù)產(chǎn)業(yè)博覽會(huì)上，華為常務(wù)董事、華為云CEO張平安發(fā)表演講稱，數(shù)字世界的話語(yǔ)權(quán)最終是由生態(tài)的繁榮決定的。

關(guān)鍵字：華為 12nm 手機(jī) 衛(wèi)星通信

[美通社全球TMT]

中國(guó)通信服務(wù)公布2024年中期業(yè)績(jī)

要點(diǎn)：有效應(yīng)對(duì)環(huán)境變化，經(jīng)營(yíng)業(yè)績(jī)穩(wěn)中有升落實(shí)提質(zhì)增效舉措，毛利潤(rùn)率延續(xù)升勢(shì) 戰(zhàn)略布局成效顯著，戰(zhàn)新業(yè)務(wù)引領(lǐng)增長(zhǎng) 以科技創(chuàng)新為引領(lǐng)，提升企業(yè)核心競(jìng)爭(zhēng)力堅(jiān)持高質(zhì)量發(fā)展策略，塑強(qiáng)核心競(jìng)爭(zhēng)優(yōu)勢(shì)...

關(guān)鍵字：通信 BSP 電信運(yùn)營(yíng)商數(shù)字經(jīng)濟(jì)

[美通社全球TMT]

NVI技術(shù)創(chuàng)新聯(lián)盟成立！自主生態(tài)將帶動(dòng)產(chǎn)業(yè)鏈高速發(fā)展

北京2024年8月27日 /美通社/ -- 8月21日，由中央廣播電視總臺(tái)與中國(guó)電影電視技術(shù)學(xué)會(huì)聯(lián)合牽頭組建的NVI技術(shù)創(chuàng)新聯(lián)盟在BIRTV2024超高清全產(chǎn)業(yè)鏈發(fā)展研討會(huì)上宣布正式成立。活動(dòng)現(xiàn)場(chǎng) NVI技術(shù)創(chuàng)新聯(lián)...

關(guān)鍵字： VI 傳輸協(xié)議音頻 BSP

[美通社全球TMT]

軟通動(dòng)力與長(zhǎng)三角投資達(dá)成戰(zhàn)略合作共謀數(shù)字生態(tài)新發(fā)展

北京2024年8月27日 /美通社/ -- 在8月23日舉辦的2024年長(zhǎng)三角生態(tài)綠色一體化發(fā)展示范區(qū)聯(lián)合招商會(huì)上，軟通動(dòng)力信息技術(shù)（集團(tuán)）股份有限公司（以下簡(jiǎn)稱"軟通動(dòng)力"）與長(zhǎng)三角投資（上海）有限...

關(guān)鍵字： BSP 信息技術(shù)