An easy problem
Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 543 Accepted Submission(s): 306
Problem Description
One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two types of operation.
1. multiply X with a number.
2. divide X with a number which was multiplied before.
After each operation, please output the number X modulo M.
1. multiply X with a number.
2. divide X with a number which was multiplied before.
After each operation, please output the number X modulo M.
Input
The first line is an integer T(
1≤T≤10
), indicating the number of test cases.
For each test case, the first line are two integers Q and M. Q is the number of operations and M is described above. ( 1≤Q≤105,1≤M≤109 )
The next Q lines, each line starts with an integer x indicating the type of operation.
if x is 1, an integer y is given, indicating the number to multiply. ( 0<y≤109 )
if x is 2, an integer n is given. The calculator will divide the number which is multiplied in the nth operation. (the nth operation must be a type 1 operation.)
It's guaranteed that in type 2 operation, there won't be two same n.
For each test case, the first line are two integers Q and M. Q is the number of operations and M is described above. ( 1≤Q≤105,1≤M≤109 )
The next Q lines, each line starts with an integer x indicating the type of operation.
if x is 1, an integer y is given, indicating the number to multiply. ( 0<y≤109 )
if x is 2, an integer n is given. The calculator will divide the number which is multiplied in the nth operation. (the nth operation must be a type 1 operation.)
It's guaranteed that in type 2 operation, there won't be two same n.
Output
For each test case, the first line, please output "Case #x:" and x is the id of the test cases starting from 1.
Then Q lines follow, each line please output an answer showed by the calculator.
Then Q lines follow, each line please output an answer showed by the calculator.
Sample Input
1 10 1000000000 1 2 2 1 1 2 1 10 2 3 2 4 1 6 1 7 1 12 2 7
Sample Output
Case #1: 2 1 2 20 10 1 6 42 504 84
比如对于上述样例第一组操作后1*=2,结果为2,第二组操作,u=2,v=1,那么就是当前的num除以第一组操作的v即2/2=1。输出对于每一组操作结束后的num的值。
这道题如果直接暴力搞的话结果太大会WA,如果用大数来搞估计也会T掉,因为长度实在太大了,不知道大整数类取模怎么样,没有试过。不够机智的是现场根本没有想到用
线段树来做,这题其实就是一道线段树的单点更新,区间查询嘛,每个节点记录每一步的操作,我们初始给每个节点赋值为1,查询的时候直接乘起来就可以,对于乘的操作,我们把对应的节点的值修改为要乘的数,对于每个除的操作,我们把对应节点的值修改回1,也即没有乘。对于每个询问输出从1,n相乘的结果就可以了。
#include <cstdio>
#include <iostream>
#include <cstring>
#include<vector>
#include <queue>
#include <algorithm>
using namespace std;
const int N = 200305;
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
LL ans[N<<2];
LL mod;
void PushUp(int rt)
{
ans[rt] = (ans[rt<<1] * ans[rt<<1|1]) % mod;
}
void build(int l,int r ,int rt)
{
if(l==r)
{
ans[rt] = 1;
return ;
}
int m = (l+r)>>1;
build(lson);
build(rson);
PushUp(rt);
}
void update(int L,LL c,int l,int r,int rt=1)
{
if (L == l && l == r)
{
ans[rt] = c;
return ;
}
int m = (l + r) >> 1;
if (L <= m) update(L , c , lson);
else update(L , c , rson);
PushUp(rt);
}
LL query(int L,int R,int l,int r,int rt=1)
{
if (L <= l && r <= R)
return ans[rt];
int m = (l + r) >> 1;
int ret = 1;
if (L <= m) ret = ret*query(L , R , lson) % mod;
if (m < R) ret = ret*query(L , R , rson) % mod;
return ret;
}
int main()
{
int T,tp,cs = 1;
LL c;
int n;
scanf("%d",&T);
while(T--)
{
scanf("%d%lld",&n,&mod);
build(1,n,1);
printf("Case #%d:\n",cs++);
for(int i = 1;i<=n;i++)
{
scanf("%d%lld",&tp,&c);
if(tp==1) update(i,c,1,n,1);
else update(c,1,1,n,1);
printf("%lld\n",query(1,n,1,n,1));
}
}
return 0;
}
题目链接: 点击打开链接