题面
Sol
这道题卡空间。。。
先模拟出T，大力贪心，每次选最小的走显然最优
那么选了\((i, j)\)它上面都只能选第\(j\)列以前的，它下面都只能选第\(j\)列以后的
每次选最小，更新每行能选的区间，判断即可
# include <bits/stdc++.h>
# define RG register
# define IL inline
# define Fill(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
const int _(25000005);
IL ll Read(){
RG char c = getchar(); RG ll x = 0, z = 1;
for(; c < '0' || c > '9'; c = getchar()) z = c == '-' ? -1 : 1;
for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
return x * z;
}
int n, m, q, X[_], T[_], len, l[5010], r[5010];
int main(RG int argc, RG char* argv[]){
X[0] = Read(); RG int A = Read(), B = Read(), C = Read(), D = Read(); n = Read(); m = Read(); q = Read(); len = n * m;
for(RG int i = 1; i <= len; ++i) X[i] = (1LL * A * X[i - 1] % D * X[i - 1] % D + 1LL * B * X[i - 1] % D + C) % D;
for(RG int i = 1; i <= len; ++i) T[i] = i;
for(RG int i = 1; i <= len; ++i) swap(T[i], T[X[i] % i + 1]);
for(RG int i = 1, x, y; i <= q; ++i) x = Read(), y = Read(), swap(T[x], T[y]);
for(RG int i = 1; i <= len; ++i) X[T[i]] = i;
for(RG int i = 1; i <= n; ++i) l[i] = 1, r[i] = m;
for(RG int i = 1, tot = 0; i <= len && tot < n + m; ++i){
RG int x = (X[i] + m - 1) / m, y = X[i] % m; if(!y) y += m;
if(l[x] <= y && r[x] >= y){
++tot; printf("%d", i); if(tot != n + m - 1) printf(" ");
for(RG int j = x + 1; j <= n; ++j) l[j] = max(l[j], y);
for(RG int j = 1; j < x; ++j) r[j] = min(r[j], y);
}
}
return 0;
}