| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 637801 | beaconmc | Job Scheduling (CEOI12_jobs) | Pypy 3 | 149 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n,d,m = map(int, input().split())
lis = list(map(int, input().split()))
tot = [0 for i in range(n)]
for i in lis:
tot[i-1] += 1
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||