Submission #5447275
Source Code Expand
N, M, Q = map(int, input().split()) matrix = [[0]*(N+1) for _ in range(N)] for _ in range(M): l, r = map(int, input().split()) matrix[l-1][r] += 1 for i in range(N): for j in range(1, N+1): matrix[i][j] += matrix[i][j-1] for _ in range(Q): p, q = map(int, input().split()) ans = 0 for i in range(p-1, q): ans += matrix[i][q]-matrix[i][p-1] print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - AtCoder Express 2 |
User | schwert |
Language | PyPy3 (2.4.0) |
Score | 400 |
Code Size | 415 Byte |
Status | AC |
Exec Time | 2934 ms |
Memory | 53208 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 166 ms | 38256 KB |
in02.txt | AC | 165 ms | 38256 KB |
in03.txt | AC | 168 ms | 38256 KB |
in04.txt | AC | 170 ms | 38256 KB |
in05.txt | AC | 2156 ms | 51800 KB |
in06.txt | AC | 2100 ms | 51800 KB |
in07.txt | AC | 2101 ms | 51800 KB |
in08.txt | AC | 2135 ms | 51672 KB |
in09.txt | AC | 1904 ms | 50904 KB |
in10.txt | AC | 2934 ms | 53208 KB |
sample_01.txt | AC | 164 ms | 38256 KB |
sample_02.txt | AC | 162 ms | 38256 KB |
sample_03.txt | AC | 168 ms | 38256 KB |