uva 12100

最新推荐文章于 2021-04-12 19:46:03 发布

_星尘_

最新推荐文章于 2021-04-12 19:46:03 发布

阅读量405

点赞数

分类专栏： OJ

本文链接：https://blog.csdn.net/pb1995/article/details/48633803

版权

OJ 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

原题

简单题, 纯粹的按题意队列模拟

有时候用一点struct可以使得代码更清晰, 况且struct也不太会拖慢速度

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring> 
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <deque> 
#include <map>
#include <cassert>
#include <iomanip>
#include <list>
using namespace std;
const int MAXN = 1000;
typedef long long LL;
typedef long long Type;
/*
uva 12100


*/


struct Task{
<span style="white-space:pre">	</span>int num;
<span style="white-space:pre">	</span>int pri;
<span style="white-space:pre">	</span>Task(){
<span style="white-space:pre">		</span>num = pri = 0;
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>Task(int a,int b){
<span style="white-space:pre">		</span>num = a;
<span style="white-space:pre">		</span>pri = b;
<span style="white-space:pre">	</span>}
};

int main(){
//<span style="white-space:pre">	</span>freopen("input2.txt","r",stdin);
<span style="white-space:pre">	</span>int T;
<span style="white-space:pre">	</span>cin >> T;
<span style="white-space:pre">	</span>while ( T-- ){
<span style="white-space:pre">		</span>int N, own, p;
<span style="white-space:pre">		</span>cin >> N >> own;
<span style="white-space:pre">		</span>Task * q = new Task[MAXN];
<span style="white-space:pre">		</span>priority_queue<int> pq;
<span style="white-space:pre">		</span>
<span style="white-space:pre">		</span>int i, time = 0;
<span style="white-space:pre">		</span>for(i=0; i<N; i++){
<span style="white-space:pre">			</span>cin >> p;
<span style="white-space:pre">			</span>pq.push(p);
<span style="white-space:pre">			</span>q[i] = Task(i,p);
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>int tail = i;
<span style="white-space:pre">		</span>i = 0;
<span style="white-space:pre">		</span>while( i<tail ){
//<span style="white-space:pre">			</span>cout << "q[i].pri = " << q[i].pri << " , pop = " << pq.top() << endl;;
<span style="white-space:pre">			</span>if( q[i].pri<pq.top() ){
<span style="white-space:pre">				</span>q[tail++] = q[i++];
<span style="white-space:pre">				</span>continue;
<span style="white-space:pre">			</span>}else{
<span style="white-space:pre">				</span>time++;
<span style="white-space:pre">				</span>if( q[i].num==own ){
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>}
<span style="white-space:pre">				</span>pq.pop();
<span style="white-space:pre">				</span>i++;
<span style="white-space:pre">			</span>}
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>delete [] q;
<span style="white-space:pre">		</span>cout << (time) << endl;
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>
<span style="white-space:pre">	</span>
<span style="white-space:pre">	</span>return 0;
}