TOJ 4596 一行盒子 -- 双向链表

最新推荐文章于 2018-10-29 22:32:02 发布

randygx

最新推荐文章于 2018-10-29 22:32:02 发布

阅读量491

点赞数

分类专栏： ACM 文章标签：链表双向链表

本文链接：https://blog.csdn.net/randygx/article/details/26154913

版权

ACM 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

题目链接：http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=4596

题目大意：有n个编号从1到n的盒子，对他们进行m次操作，一次操作可以把盒子X移到盒子Y前面或后面，也可以交换盒子X和盒子Y，还可以把序列反向。最后问在奇数位置上的盒子编号总和。

分析：直接用双向链接模拟整个序列。同时用一个数组记录每个盒子对应的链表结点，之后所有的操作都可以在O(1)时间内完成。

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
         #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #define mp make_pair #define X first #define Y second #define MEMSET(a, b) memset(a, b, sizeof(a)) using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef pair 
                   
                     pii; typedef vector 
                    
                      vi; typedef vi::iterator vi_it; typedef map 
                     
                       mii; typedef priority_queue 
                      
                        pqi; typedef priority_queue 
                       
                         , greater 
                        
                          > rpqi; typedef priority_queue 
                         
                           pqp; typedef priority_queue 
                          
                            , greater 
                           
                             > rpqp; const int MAX_N = 100000 + 2; struct node { int v; node *pre; node *next; } *head, *tail; node *coll[MAX_N]; void ini(int n) { head = new node(); tail = head; head->pre = NULL; node *p = head, *q = NULL; for (int i = 1; i <= n; ++i) { q = new node(); p->next = q; q->pre = p; q->v = i; coll[i] = q; p = q; tail = q; } q = new node(); p->next = q; q->pre = p; q->next = NULL; tail = q; } void free_list() { node *p = head, *q = NULL; while (p != tail) { q = p; p = p->next; delete q; } delete p; } void del(node *p) { p->next->pre = p->pre; p->pre->next = p->next; delete p; } void ins(node *p, int v) { node *q = new node(); q->v = v; coll[v] = q; q->next = p; q->pre = p->pre; p->pre->next = q; p->pre = q; } int main(int argc, char *argv[]) { // freopen("D:\\in.txt", "r", stdin); int n, m, cas = 1; while (scanf("%d%d", &n, &m) == 2) { bool flag = false; int t, x, y; ini(n); while (m--) { scanf("%d", &t); if (t == 4) { flag = !flag; continue; } scanf("%d%d", &x, &y); if (t == 1) { del(coll[x]); if (!flag) { ins(coll[y], x); } else { ins(coll[y]->next, x); } } else if (t == 2) { del(coll[x]); if (!flag) { ins(coll[y]->next, x); } else { ins(coll[y], x); } } else { node *p = coll[x]; node *q = coll[y]; p->v = y; q->v = x; coll[x] = q; coll[y] = p; } } ll ans = 0; if (!flag) { node *p = head->next; int cnt = 1; while (p != tail) { if (cnt % 2) { ans += p->v; } p = p->next; ++cnt; } } else { node *p = tail->pre; int cnt = 1; while (p != head) { if (cnt % 2) { ans += p->v; } p = p->pre; ++cnt; } } printf("Case %d: %I64d\n", cas++, ans); free_list(); } return 0; }