-
Notifications
You must be signed in to change notification settings - Fork 0
/
5475_Aneasyproblem.cc
101 lines (84 loc) · 1.6 KB
/
5475_Aneasyproblem.cc
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
/*
*
* Author : fcbruce <[email protected]>
*
* Time : Sat 26 Sep 2015 12:12:20 PM CST
*
*/
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <algorithm>
#include <ctime>
#include <cctype>
#include <cmath>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#define sqr(x) ((x)*(x))
#ifdef _WIN32
#define lld "%I64d"
#else
#define lld "%lld"
#endif
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
const double PI = acos(-1.0);
const double eps = 1e-10;
typedef long long LL;
typedef int itn;
const int maxn = 100007;
const int maxm = 0;
long long p[maxn << 2];
long long mod;
void build(int k, int l, int r)
{
p[k] = 1;
if (l + 1 == r) return ;
build(k * 2 + 1, l, l + r >> 1);
build(k * 2 + 2, l + r >> 1, r);
}
void update(int pos, int v, int k, int l, int r)
{
if (l + 1 == r)
{
p[k] = v % mod;
return ;
}
int m = l + r >> 1;
if (pos < m) update(pos, v, k * 2 + 1, l, m);
else update(pos, v, k * 2 + 2, m, r);
p[k] = p[k * 2 + 1] * p[k * 2 + 2] % mod;
}
int main()
{
#ifdef FCBRUCE
freopen("/home/fcbruce/code/t", "r", stdin);
#endif // FCBRUCE
int T_T, __=0;
scanf("%d", &T_T);
while (T_T--)
{
printf("Case #%d:\n", ++__);
int n;
scanf("%d" lld, &n, &mod);
build(0, 0, n);
for (int i = 0; i < n; i++)
{
int a,b;
scanf("%d%d", &a ,&b);
if (a == 1)
update(i, b, 0, 0, n);
else
update(b - 1, 1, 0, 0, n);
printf(lld "\n", p[0]);
}
}
return 0;
}