Wednesday 20 March 2019

UVA Problem 12207 - That is Your Queue (C++)

The problem link can be found here. It has been solved using deque data structure.
Code:

 1  #include<bits/stdc++.h>
 2  using namespace std;
 3  int main(){
 4      int cases =0;
 5  int p,c;
 6 
 7  while(cin>>p>>c,p!=0,c!=0){
 8          deque<int>dq;
 9      if(p<c){
10          for(int i=1;i<=p;i++){
11            dq.push_back(i);
12          }
13      }
14      else{
15          for(int i=1;i<=c;i++){
16            dq.push_back(i);
17          }
18      }
19      cases++;
20      printf("Case %d:\n",cases);
21      while(c--){
22          string com;
23          cin>>com;
24          if(com == "N"){
25              int e = dq.front();
26              cout<<e<<endl;
27              dq.pop_front();
28              dq.push_back(e);
29          }
30          else{
31              int num;
32              cin>>num;
33              for(deque<int>::iterator it = dq.begin();it!=dq.end();it++){
34                  if(*it == num){
35                  dq.erase(it);
36                  break;
37                  }
38 
39              }
40              dq.push_front(num);
41          }
42      }
43  }
44 
45 
46  return 0;}

No comments:

Post a Comment

Spoj Problem ACMCEG2C - Pick the candies (C++)

  The problem link may be found here.       Explanation: Use Deque to keep track of elements of the variety of candies. If i is gre...