STL.h

 1 template< typename RT >class queue
 2 {
 3     public:
 4     RT sta[10000005];
 5     int l,r;
 6     void clear(){l=r=0;}
 7     inline void push(RT x){sta[r++]=x;return ;}
 8     inline void pop(){l++;return ;}
 9     inline RT front(){return sta[l];}
10     inline bool empty(){return r==l;}
11     inline bool size(){return r!=l;}
12 };
13 template< typename RT >class stack
14 {
15     public:
16     RT sta[10000005];
17     int topp;
18     void clear(){topp=0;}
19     inline void push(RT x){sta[++topp]=x;return ;}
20     inline void pop(){topp--;return ;}
21     inline bool empty(){return topp==0;}
22     inline bool size(){return topp;}
23     inline bool top(){return sta[topp];}
24 };
25 template< typename RT >class hash_table
26 {
27     public:
28     int mod;
29     inline void init(int x){mod=x;return ;}
30     int head[100005],vvt[100005],nxt[100005],tot;
31     RT ver[100005];
32     inline void insert(int x,RT ac)
33     {
34         int u=x%mod;
35         for(int i=head[u];i;i=nxt[i])
36         {
37             RT y=ver[i];
38             if(y==ac){vvt[i]++;return ;}
39         }
40         ver[++tot]=ac;
41         nxt[tot]=head[u];
42         head[u]=tot;
43         vvt[tot]++;
44     }
45     inline int query_times(int x,RT ac)
46     {
47         int u=x%mod;
48         for(int i=head[u];i;i=nxt[i])
49         {
50             RT y=ver[i];
51             if(y==ac)return vvt[i];
52         }
53         return 0;
54     }
55 };