#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
const int mx = 50'000;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int R, C, Q;
cin >> R >> C >> Q;
vi L(1+C);
for(int i = 1; i <= C; i++) cin >> L[i];
vi P(1+C);
for(int i = 1; i <= C; i++) cin >> P[i];
for(int q = 1; q <= Q; q++)
{
int T;
cin >> T;
if(T == 1)
{
int x, y, p;
cin >> x >> y >> p;
P[x] = p;
}
else
{
int x, y, l;
cin >> x >> y >> l;
if(l < L[x]) cout << 0 << '\n';
else
{
vi occ(1+mx, 0);
for(int i = 1; i <= l; i++)
occ[P[i]] = 1;
int res = 0;
for(int z = 1; z <= mx; z++) res += occ[z];
cout << res << '\n';
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
904 KB |
Output is correct |
2 |
Correct |
59 ms |
1448 KB |
Output is correct |
3 |
Correct |
27 ms |
1456 KB |
Output is correct |
4 |
Correct |
30 ms |
1500 KB |
Output is correct |
5 |
Correct |
64 ms |
1468 KB |
Output is correct |
6 |
Correct |
146 ms |
1484 KB |
Output is correct |
7 |
Correct |
61 ms |
1388 KB |
Output is correct |
8 |
Correct |
62 ms |
1476 KB |
Output is correct |
9 |
Correct |
60 ms |
1484 KB |
Output is correct |
10 |
Correct |
69 ms |
1480 KB |
Output is correct |
11 |
Correct |
60 ms |
1468 KB |
Output is correct |
12 |
Correct |
59 ms |
1472 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
12 ms |
1612 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
8 ms |
1560 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
904 KB |
Output is correct |
2 |
Correct |
59 ms |
1448 KB |
Output is correct |
3 |
Correct |
27 ms |
1456 KB |
Output is correct |
4 |
Correct |
30 ms |
1500 KB |
Output is correct |
5 |
Correct |
64 ms |
1468 KB |
Output is correct |
6 |
Correct |
146 ms |
1484 KB |
Output is correct |
7 |
Correct |
61 ms |
1388 KB |
Output is correct |
8 |
Correct |
62 ms |
1476 KB |
Output is correct |
9 |
Correct |
60 ms |
1484 KB |
Output is correct |
10 |
Correct |
69 ms |
1480 KB |
Output is correct |
11 |
Correct |
60 ms |
1468 KB |
Output is correct |
12 |
Correct |
59 ms |
1472 KB |
Output is correct |
13 |
Execution timed out |
5092 ms |
2336 KB |
Time limit exceeded |
14 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
904 KB |
Output is correct |
2 |
Correct |
59 ms |
1448 KB |
Output is correct |
3 |
Correct |
27 ms |
1456 KB |
Output is correct |
4 |
Correct |
30 ms |
1500 KB |
Output is correct |
5 |
Correct |
64 ms |
1468 KB |
Output is correct |
6 |
Correct |
146 ms |
1484 KB |
Output is correct |
7 |
Correct |
61 ms |
1388 KB |
Output is correct |
8 |
Correct |
62 ms |
1476 KB |
Output is correct |
9 |
Correct |
60 ms |
1484 KB |
Output is correct |
10 |
Correct |
69 ms |
1480 KB |
Output is correct |
11 |
Correct |
60 ms |
1468 KB |
Output is correct |
12 |
Correct |
59 ms |
1472 KB |
Output is correct |
13 |
Runtime error |
12 ms |
1612 KB |
Execution killed with signal 11 |
14 |
Halted |
0 ms |
0 KB |
- |