Submission #16505628


Source Code Expand

Copy
n, m = map(int, input().split())
jobs = [list(map(int, input().split())) for _ in range(n)]
seekers = [list(map(int, input().split())) for _ in range(m)]

for s in seekers:
    ans = 0
    for job in jobs:
        if s[0] >= job[0] and s[1] >= job[1] and s[2] >= job[2]:
            ans = max(ans, job[3])
    print(ans)

Submission Info

Submission Time
Task C - Optimal Recommendations
User keroido
Language Python (3.8.2)
Score 0
Code Size 331 Byte
Status TLE
Exec Time 2206 ms
Memory 23444 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 5
TLE × 19
Set Name Test Cases
All 10-random-00.txt, 10-random-01.txt, 10-random-02.txt, 10-random-03.txt, 10-random-04.txt, 20-absW-00.txt, 20-absW-01.txt, 20-absW-02.txt, 20-absW-03.txt, 20-absW-04.txt, 30-balance-00.txt, 30-balance-01.txt, 30-balance-02.txt, 30-balance-03.txt, 30-balance-04.txt, 40-limit_dim-00.txt, 40-limit_dim-01.txt, 40-limit_dim-02.txt, 40-limit_dim-03.txt, 40-limit_dim-04.txt, 40-limit_dim-05.txt, 40-limit_dim-06.txt, Corner1.txt, Sample1.txt
Case Name Status Exec Time Memory
10-random-00.txt TLE 2206 ms 23316 KB
10-random-01.txt AC 19 ms 9048 KB
10-random-02.txt TLE 2206 ms 13540 KB
10-random-03.txt TLE 2206 ms 16680 KB
10-random-04.txt TLE 2206 ms 15820 KB
20-absW-00.txt TLE 2206 ms 21692 KB
20-absW-01.txt AC 18 ms 9008 KB
20-absW-02.txt TLE 2206 ms 16964 KB
20-absW-03.txt TLE 2206 ms 17720 KB
20-absW-04.txt TLE 2206 ms 12348 KB
30-balance-00.txt TLE 2206 ms 23228 KB
30-balance-01.txt AC 25 ms 9168 KB
30-balance-02.txt TLE 2206 ms 11604 KB
30-balance-03.txt TLE 2206 ms 18952 KB
30-balance-04.txt TLE 2206 ms 15420 KB
40-limit_dim-00.txt TLE 2206 ms 23136 KB
40-limit_dim-01.txt TLE 2206 ms 23292 KB
40-limit_dim-02.txt TLE 2206 ms 23144 KB
40-limit_dim-03.txt TLE 2206 ms 23144 KB
40-limit_dim-04.txt TLE 2206 ms 23444 KB
40-limit_dim-05.txt TLE 2206 ms 23256 KB
40-limit_dim-06.txt TLE 2206 ms 23132 KB
Corner1.txt AC 19 ms 9028 KB
Sample1.txt AC 23 ms 9020 KB