Submission #5447628
Source Code Expand
n,m,Q = map(int,input().split()) a = [] for i in range(n+1): a.append([0]*(n+1)) s = a[:] for i in range(m): l,r = map(int,input().split()) a[l][r] += 1 for l in range(1,n+1): for r in range(1,n+1): s[l][r] = a[l][r] + s[l-1][r] + s[l][r-1] - s[l-1][r-1] for i in range(Q): p,q = map(int,input().split()) print(s[q][q] - s[p-1][q] - s[q][p-1] + s[p-1][p-1])
Submission Info
Submission Time | |
---|---|
Task | D - AtCoder Express 2 |
User | minefy |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 394 Byte |
Status | AC |
Exec Time | 1611 ms |
Memory | 14884 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 | 18 ms | 3064 KB |
in02.txt | AC | 17 ms | 3064 KB |
in03.txt | AC | 17 ms | 3064 KB |
in04.txt | AC | 19 ms | 3064 KB |
in05.txt | AC | 1590 ms | 13216 KB |
in06.txt | AC | 1611 ms | 13216 KB |
in07.txt | AC | 1577 ms | 13220 KB |
in08.txt | AC | 1557 ms | 14884 KB |
in09.txt | AC | 1531 ms | 5236 KB |
in10.txt | AC | 1530 ms | 13348 KB |
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 18 ms | 3064 KB |