2018计蒜之道 第三场 B

题目链接

题目&题意：怎么说呢，这道题根据题意直接暴力就行了

#include<algorithm>
#include<typeinfo>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<iomanip>
#include<stdio.h>
#include<math.h>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
#define pi acos(-1)
#define mod 323232323
ll gcd(ll x, ll y) { return x ? gcd(y%x, x) : y; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }

int n, m, ci, l, r, y, p, q, x, k, mp[1005][1005];
char ch;

int main() {
	ios::sync_with_stdio(false);
	//cin.tie(0);
	cout << fixed << setprecision(6);

	while (cin >> n >> m >> ci) {
		memset(mp, 0, sizeof(mp));
		map<int, pair<int, int>>mm;
		k = 0;
		while (ci--) {
			cin >> ch;
			if (ch == 'I') {
				cin >> l >> r >> y >> p >> q;
				k++;
				for (int a = l; a <= r; a++)
					mp[a][y] = k;
				mm[k] = pair<int, int>(p, q);
			}
			else if (ch == 'Q') {
				ll ans = 0;
				cin >> x >> l >> r;
				for (int a = l; a <= r; a++)
					if(mp[x][a]!=0)
						ans = mm[mp[x][a]].first*ans + mm[mp[x][a]].second, ans %= mod;
				printf("%lld\n", ans);
			}
			else {
				cin >> x;
				mm[x] = pair<int, int>(1, 0);
			}
		}
	}
	return 0;
}