UVA 133 The Dole Queue

题目链接：https://vjudge.net/problem/UVA-133

题目翻译摘自《算法禁赛入门经典》

题目大意

　　N 个人站成一圈，逆时针编号为 1 ~ N，有两个官员，A 从 1 开始逆时针数，B 从 N 开始顺时针数，在每一轮中，官员 A 数 k 个就停下来，官员 B 数 m 个就停下来（注意有可能两个官员停在同一个人身上）。接下来被官员选中的人（1个或者两个）离开队伍。

　　输入 N，k，m 输出每轮里被选中的人的编号，如果有两个人，先输出被A选中的。
　　PS：输出的每个数应当恰好占3列。

分析

　　只要是线性表都能做这道题，不过我私以为静态链表比较美观。

代码如下

  1 #include <bits/stdc++.h>
  2 using namespace std;
  3  
  4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
  6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
  7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
  8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
  9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 12  
 13 #define pr(x) cout << #x << " = " << x << "  "
 14 #define prln(x) cout << #x << " = " << x << endl
 15  
 16 #define LOWBIT(x) ((x)&(-x))
 17  
 18 #define ALL(x) x.begin(),x.end()
 19 #define INS(x) inserter(x,x.begin())
 20  
 21 #define ms0(a) memset(a,0,sizeof(a))
 22 #define msI(a) memset(a,inf,sizeof(a))
 23 #define msM(a) memset(a,-1,sizeof(a))
 24 
 25 #define MP make_pair
 26 #define PB push_back
 27 #define ft first
 28 #define sd second
 29  
 30 template<typename T1, typename T2>
 31 istream &operator>>(istream &in, pair<T1, T2> &p) {
 32     in >> p.first >> p.second;
 33     return in;
 34 }
 35  
 36 template<typename T>
 37 istream &operator>>(istream &in, vector<T> &v) {
 38     for (auto &x: v)
 39         in >> x;
 40     return in;
 41 }
 42  
 43 template<typename T1, typename T2>
 44 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
 45     out << "[" << p.first << ", " << p.second << "]" << "\n";
 46     return out;
 47 }
 48 
 49 inline int gc(){
 50     static const int BUF = 1e7;
 51     static char buf[BUF], *bg = buf + BUF, *ed = bg;
 52     
 53     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
 54     return *bg++;
 55 } 
 56 
 57 inline int ri(){
 58     int x = 0, f = 1, c = gc();
 59     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
 60     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
 61     return x*f;
 62 }
 63  
 64 typedef long long LL;
 65 typedef unsigned long long uLL;
 66 typedef pair< double, double > PDD;
 67 typedef pair< int, int > PII;
 68 typedef pair< int, PII > PIPII;
 69 typedef pair< string, int > PSI;
 70 typedef pair< int, PSI > PIPSI;
 71 typedef set< int > SI;
 72 typedef set< PII > SPII;
 73 typedef vector< int > VI;
 74 typedef vector< VI > VVI;
 75 typedef vector< PII > VPII;
 76 typedef map< int, int > MII;
 77 typedef map< int, PII > MIPII;
 78 typedef map< PII, int > MPIII;
 79 typedef map< string, int > MSI;
 80 typedef multimap< int, int > MMII;
 81 //typedef unordered_map< int, int > uMII;
 82 typedef pair< LL, LL > PLL;
 83 typedef vector< LL > VL;
 84 typedef vector< VL > VVL;
 85 typedef priority_queue< int > PQIMax;
 86 typedef priority_queue< int, VI, greater< int > > PQIMin;
 87 const double EPS = 1e-6;
 88 const LL inf = 0x7fffffff;
 89 const LL infLL = 0x7fffffffffffffffLL;
 90 const LL mod = 1e9 + 7;
 91 const int maxN = 1e4 + 7;
 92 const LL ONE = 1;
 93 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
 94 const LL oddBits = 0x5555555555555555;
 95 
 96 struct StaticList{
 97     int sl[21], nt[21], pv[21];
 98     int *next = nt, *prev = pv;
 99     int sz;
100     
101     void init(int x) {
102         sz = x;
103         For(i, 0, sz) {
104             if(i) sl[i] = i;
105             prev[i] = (sz + i) % (sz + 1);
106             next[i] = (i + 1) % (sz + 1);
107         }
108     }
109     
110     void erase(int x) {
111         next[prev[x]] = next[x];
112         prev[next[x]] = prev[x];
113     }
114     
115     bool empty() {
116         return next[0] == 0;
117     }
118     
119     void print() {
120         cout << "SL:  ";
121         For(i, 0, sz) cout << " " << sl[i];
122         cout << endl;
123         
124         cout << "prev:";
125         For(i, 0, sz) cout << " " << prev[i];
126         cout << endl;
127         
128         cout << "next:";
129         For(i, 0, sz) cout << " " << next[i];
130         cout << endl;
131         
132     }
133 }SL;
134 
135 int N, k, m, A, B;
136 
137 int main(){
138     //freopen("MyOutput.txt","w",stdout);
139     //freopen("input.txt","r",stdin);
140     //INIT();
141     while(cin >> N >> k >> m) {
142         if(!N) break;
143         SL.init(N);
144         A = N;
145         B = 1;
146         
147         while(!SL.empty()) {
148             Rep(i, k) {
149                 A = SL.next[A];
150                 if(A == 0) A = SL.next[A];
151             }
152             Rep(i, m) {
153                 B = SL.prev[B];
154                 if(B == 0) B = SL.prev[B];
155             }
156             if(A == B) {
157                 --N;
158                 printf("%3d%c", A, ",\n"[N == 0]);
159             }
160             else {
161                 N -= 2;
162                 printf("%3d%3d%c", A, B, ",\n"[N == 0]);
163             }
164             
165             SL.erase(A);
166             A = SL.prev[A];
167             SL.erase(B);
168             B = SL.next[B];
169         }
170     }
171     return 0;
172 }

View Code