1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
|
using namespace std; #define forl(i, l, r) for (int i = l; i <= r; i++) #define forr(i, r, l) for (int i = r; i >= l; i--) #define for1(i, n) for (int i = 1; i <= n; i++) #define fro1(i, n) for (int i = 1; i <= n; i++) #define for0(i, n) for (int i = 0; i < n; i++) #define fro0(i, n) for (int i = 0; i < n; i++) #define meminf(a) memset(a, inf, sizeof(a)) #define mem_1(a) memset(a, -1, sizeof(a)) #define mem0(a) memset(a, 0, sizeof(a)) #define memcp(a,b) memcpy(a,b,sizeof(b)) #define oper(type) bool operator <(const type y)const #define mp make_pair #define pu_b push_back #define pu_f push_front #define po_b pop_back #define po_f pop_front #define fi first #define se second #define whiel while #define retrun return typedef pair<long long, long long> pll; typedef vector<long long> vll; typedef pair<int, int> pii; typedef unsigned long long ull; typedef vector<int> vii; typedef long double db; typedef long long ll; typedef int itn; int (int &a,int &b,int &c,int &d){return scanf("%d%d%d%d",&a,&b,&c,&d);} int (int &a,int &b,int &c){return scanf("%d%d%d",&a,&b,&c);} int (int &a,int &b){return scanf("%d%d",&a,&b);} int (ll &a){return scanf("%lld",&a);} int (int &a){return scanf("%d",&a);} int in(char *s){return scanf("%s",s);} int in(char &s){return scanf("%c",&s);} int in(db &a){return scanf("%Lf",&a);} void out(int a){printf("%d ",a);} void outln(int a){printf("%dn",a);} void out(ll a){printf("%lld ",a);} void outln(ll a){printf("%lldn",a);} const db pi = acos((db)-1); const ll inf =0x3f3f3f3f; const db eps = 1e-8; const int N = 3.1e3; const ll mod = 1e9+7; int sign(db a) { return a < -eps ? -1 : a > eps;} int db_cmp(db a, db b){ return sign(a-b); } int minn[N][N],h[N][N],q[N]; ll ans; void fun(int x,int n,int a){ int l=1,r=0; for1(i,n){ whiel(i-q[l]+1>a&&l<=r)l++; while(h[x][q[r]]>h[x][i]&&l<=r)r--; q[++r]=i; minn[x][i]=h[x][q[l]]; } } void fun2(int x,int n,int a){ int l=1,r=0; for(int i=1;i<=n;i++){ whiel(i-q[l]+1>a&&l<=r)l++; while(minn[q[r]][x]>minn[i][x]&&l<=r)r--; q[++r]=i; if(i>=a) ans+=minn[q[l]][x]; } } int main() { #ifdef PerpEternal #endif int n,m,a,b,g,x,y,z; in(n,m,a,b); in(g,x,y,z); for0(i,n*m){ h[i/m+1][i%m+1]=g; g=(1ll*g*x+y)%z; } for1(i,n){ fun(i,m,b); } for(int i=b;i<=m;i++){ fun2(i,n,a); } outln(ans); return 0; }
|
近期评论