Submission #4037754
Source Code Expand
#!/usr/bin/env python3 # -*- coding: utf-8 -*- import array from bisect import * from collections import * import fractions import heapq from itertools import * import math import random import re import string import sys N, M = map(int, input().split()) YPIs = [] for m in range(M): p, y = map(int, input().split()) YPIs.append((y, p, m)) YPIs.sort() ans = [None] * M ctr = Counter() for y, p, idx in YPIs: ans[idx] = "{:06d}{:06d}".format(p, ctr[p] + 1) ctr[p] += 1 for a in ans: print(a)
Submission Info
Submission Time | |
---|---|
Task | C - ID |
User | minus9d |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 544 Byte |
Status | AC |
Exec Time | 758 ms |
Memory | 38492 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 758 ms | 36832 KB |
02.txt | AC | 655 ms | 28356 KB |
03.txt | AC | 41 ms | 5580 KB |
04.txt | AC | 41 ms | 5580 KB |
05.txt | AC | 695 ms | 31492 KB |
06.txt | AC | 727 ms | 38492 KB |
07.txt | AC | 47 ms | 5836 KB |
08.txt | AC | 694 ms | 31688 KB |
09.txt | AC | 726 ms | 34296 KB |
10.txt | AC | 677 ms | 31468 KB |
11.txt | AC | 626 ms | 29340 KB |
12.txt | AC | 444 ms | 22692 KB |
13.txt | AC | 671 ms | 29488 KB |
14.txt | AC | 716 ms | 34416 KB |
15.txt | AC | 717 ms | 34424 KB |
16.txt | AC | 736 ms | 34432 KB |
17.txt | AC | 733 ms | 34412 KB |
18.txt | AC | 710 ms | 34428 KB |
sample_01.txt | AC | 41 ms | 5580 KB |
sample_02.txt | AC | 41 ms | 5580 KB |
sample_03.txt | AC | 42 ms | 5580 KB |