Problem:


Score: 300 points

Problem Statement

In Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.

City i is established in year Y_i and belongs to Prefecture P_i.

You can assume that there are no multiple cities that are established in the same year.

It is decided to allocate a 12-digit ID number to each city.

If City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.

Here, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.

Find the ID numbers for all the cities.

Note that there can be a prefecture with no cities.

Constraints

1 \leq N \leq 10^5

1 \leq M \leq 10^5

1 \leq P_i \leq N

1 \leq Y_i \leq 10^9

Y_i are all different.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
P_1 Y_1
:
P_M Y_M

Output

Print the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).

Sample Input 1

2 3
1 32
2 63
1 12

Sample Output 1

000001000002
000002000001
000001000001

As City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.

As City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.

As City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.

Sample Input 2

2 3
2 55
2 77
2 99

Sample Output 2

000002000001
000002000002
000002000003



Sample input:
2 3
1 32
2 63
1 12


Sample output:
000001000002
000002000001
000001000001

Submission status: Wrong Answer

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array, use [[0] * N for _ in range(N)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N, M = R()
    PY = [R() for _ in range(M)]
    PYs = sorted(PY, key=itemgetter(1,0))
    setp = set()
    pl = [[] for _ in range(N+1)]
    done = [0] * (N+1)
    for p, y in PYs:
        pl[p].append(y)
        setp.add(p)
    
    plist = list(setp)
    for p, y in PY:
        if not done[p]:
            done[p] = 1
            pl[p].sort
        print('{0:0=6}{1:0=6}'.format(bisect_right(plist, p),bisect_right(pl[p], y)))
    

    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
lst = [None]*M
pre_lst = []
for i in range(M):
  lst[i] = list(map(int,input().split()))
  lst[i].append(i)
for k in range(M):
  lst[k][0] = str(lst[k][0])
  lst[k][0] = lst[k][0].zfill(6)
lst.sort(key = lambda x:x[0])

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
yp = [list(map(int, input().split())) for _ in range(m)]
yp=[(x[1], x[0]) for x in yp]
yp.sort()
pref_counter = [0]*(n+1) # 県 1～n
xp = [[0,0]]*m

for i in range(m):
    y, p = yp[i]
    pref_counter[p] += 1
    xp[i] = [pref_counter[p], p]
    s = format(p, '06d') + format(pref_counter[p], '06d')
    print(s)

Submission status: Wrong Answer

Solution code:
import sys
n,m = map(int,input().split())
py = []
d = dict()

for i in range(m):
    (a,b) = map(int,input().split())
    py.append((a,b))
sort_py = sorted(py)

tmp_p = sort_py[0][0]
cnt = 1
for p,y in sort_py:
    if p == tmp_p:
        d[(p,y)] = cnt
    else:
        tmp_p = p
        cnt = 1
        d[(p,y)] = cnt
    cnt += 1
for i in range(m):
    print('{0} {1}'.format(str(py[i][0]).zfill(6), str(d[py[i]]).zfill(6)))

Submission status: Wrong Answer

Solution code:
import sys
n,m = map(int,input().split())
py = []
d = dict()

for i in range(m):
    (a,b) = map(int,input().split())
    py.append((a,b))
sort_py = sorted(py)

tmp_p = sort_py[0][0]
cnt = 1
for p,y in sort_py:
    if p == tmp_p:
        d[(p,y)] = cnt
    else:
        tmp_p = p
        cnt = 1
        d[(p,y)] = cnt
    cnt += 1
print(d)
for i in range(m):
    print('{0} {1}'.format(str(py[i][0]).zfill(6), str(d[py[i]]).zfill(6)))

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
base = [[int(l) for l in input().split()] for i in range(M)]
sort_target = sorted(base)
 
  
print(sort_target)
prefecture_index = sort_target[0][0]
i=0
result = []
for target in sort_target:
  i = i + 1 if prefecture_index == target[0] else 1
  prefecture_index = target[0]
  result.append([base.index(target), "{:0=6}{:0=6}".format(target[0], i)])

sorted_result = sorted(result) 
for result in sorted_result:
  print(result[1])

Submission status: Wrong Answer

Solution code:
n,m=list(map(int,input().split()))
a=[]
b=[[] for _ in range(n)]
for _ in range(m):
  p,y=list(map(int,input().split()))
  a.append([p,y])
  b[p-1].append(y)
def sorttwo(x):
  x.sort()
  return x
b=list(map(sorttwo,b))
print(b)
for i in a:
  print('{:0>6}'.format(i[0])+'{:0>6}'.format(b[i[0]-1].index(i[1])+1))

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
city_list = sorted([[list(map(int,input().split())),i] for i in range(M)])
ID = city_list[0][0]
num = 0
ans = []
print(city_list)
for i in range(M):
  if ID != city_list[i][0][0]:
    ID = city_list[i][0][0]
    num = 0
  num += 1
  ans.append([city_list[i][1],'{0:06d}'.format(ID)+'{0:06d}'.format(num)])
ans = sorted(ans)
for i in range(len(ans)):
  print(ans[i][1])

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
city_list = sorted([[int(x) for x in input().split()] for i in range(M)])
ID = city_list[0][0]
num = 0
for i in range(M):
 if ID != city_list[i][0]:
  ID = city_list[i][0]
  num = 0
 num += 1
 print('{0:06d}'.format(ID)+'{0:06d}'.format(num))

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
city_list = sorted([[int(x) for x in input().split()] for i in range(M)])
ID = city_list[0][0]
num = 0
for i in range(M):
 if ID != city_list[i][0]:
  ID = city_list[i][0]
  num = 0
 num += 1
 print('{0:04d}'.format(ID)+'{0:04d}'.format(num))

Submission status: Wrong Answer

Solution code:
n,m=list(map(int,input().split()))
a=[[] for _ in range(n)]
for _ in range(m):
  p,y=list(map(int,input().split()))
  a[p-1].append(y)
def sorttwo(x):
  y=x.copy()
  y.sort()
  return y
b=list(map(sorttwo,a))
for k,i in enumerate(a):
  if i!=[]:
    for j in i:
      print('{:0>6}'.format(k+1)+'{:0>6}'.format(b[k].index(j)+1))

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
yp = [list(map(int, input().split())) for _ in range(m)]
yp=[(x[1], x[0]) for x in yp]
yp.sort()
pref_counter = [0]*(n+1) # 県 1～n
xp = [[0,0]]*m

for i in range(m):
    y, p = yp[i]
    pref_counter[p] += 1
    xp[i] = [pref_counter[p], p]

px = sorted([[a[1],a[0]] for a in xp])
sorted_xp = [[a[1],a[0]] for a in px]

for i in range(m):
    x, p = sorted_xp[i]
    s = format(p, '06d') + format(x, '06d')
    print(s)

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
yp = [list(map(int, input().split())) for _ in range(m)]
yp=[(x[1], x[0]) for x in yp]
yp.sort()
pref_counter = [0]*(n+1) # 県 1～n
xp = [[0,0]]*m

for i in range(m):
    y, p = yp[i]
    pref_counter[p] += 1
    xp[i] = [pref_counter[p], p]

px = sorted([[a[1],a[0]] for a in xp])
sorted_xp = [[a[1],a[0]] for a in px]

for i in range(m):
    x, p = px[i]
    s = format(p, '06d') + format(x, '06d')
    print(s)

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
yp = [list(map(int, input().split())) for _ in range(m)]
yp=[(x[1], x[0]) for x in yp]
yp.sort()
pref_counter = [0]*(n+1) # 県 1～n
xp = [[0,0]]*m

for i in range(m):
    y, p = yp[i]
    pref_counter[p] += 1
    xp[i] = [pref_counter[p], p]

px = sorted([[a[1],a[0]] for a in xp])
#sorted_xp = [[a[1],a[0]] for a in px]

for i in range(m):
    x, p = px[i]
    s = format(x, '06d') + format(p, '06d')
    print(s)

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n,m=MI()
pref=[]
for i in range(m):
    p,y=MI()
    pref+=[(p,i,y)]
pref.sort(key=lambda x:x[0]*10**10+x[2])
c=1
pre=pref[0][0]
ans=[]
for p,i,y in pref:
    pid='0'*(6-len(str(p)))+str(p)
    if pre==p:
        cid='0'*(6-len(str(c)))+str(c)
        c+=1
    else:
        c=1
        cid='0'*(6-len(str(c)))+str(c)
    ans+=[(i,pid+cid)]
    pre=p
ans.sort(key=lambda x:x[1])
for i,iid in ans:
    print(iid)

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n,m=MI()
pref=[]
for i in range(m):
    p,y=MI()
    pref+=[(p,i,y)]
pref.sort(key=lambda x:x[0]*10**10+x[2])
c=1
pre=pref[0][0]
ans=[]
for p,i,y in pref:
    pid='0'*(6-len(str(p)))+str(p)
    if pre==p:
        cid='0'*(6-len(str(c)))+str(c)
        c+=1
    else:
        c=1
        cid='0'*(6-len(str(c)))+str(c)
    ans+=[(i,pid+cid)]
    pre=p
ans.sort(key=lambda x:x[0])
for i,iid in ans:
    print(iid)

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
PYi = [list(input().split()) + [i] for i in range(M)]

sorted_by_y = sorted(PYi, key=lambda x: x[1])
city_count = {}
for pyi in sorted_by_y:
    city_count[pyi[0]] = city_count.get(pyi[0], 1)
    pyi[1] = str(pyi[0]).zfill(6) + str(city_count[pyi[0]]).zfill(6)
    city_count[pyi[0]] += 1

for k in sorted(PYi, key=lambda x: x[2]):
    print(k[1])

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())

prefectures = [[] for _ in range(n)]
for i in range(m):
    p, y = map(int, input().split())
    prefectures[p-1].append((y, i))

ans = [None] * m
for i, p in enumerate(prefectures):
    p.sort()
    for j, (y, i) in enumerate(p):
        ans[i] = "%06d%06d" % (i+1, j+1)

print(*ans, sep='\n')

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())

prefectures = []
for i in range(m):
    p, y = map(str, input().split())
    prefectures.append({'i': i, 'p': p, 'y': y})

prefectures.sort(key=lambda x: (x['p'], x['y']))

ans = []
cnt = 1
for i in range(len(prefectures)):
    if i != 0:
        if prefectures[i-1]['p'] == prefectures[i]['p']:
            cnt += 1
        else:
            cnt = 1
    s = prefectures[i]['p'].zfill(6)+str(cnt).zfill(6)
    ans.append({'i': prefectures[i]['i'], 'p': s})


ans.sort(key=lambda x: x['i'])

for x in ans:
    print(x['p'])

Submission status: Wrong Answer

Solution code:
n,m = map(int,input().split())
py = [list(map(int,input().split())) +[i] for i in range(m)]
py.sort(key=lambda x: [x[0], x[1]])
ans_list = [0]*m
tmp = py[0][0]
cnt = 0
for p,y,idx in py:
    if tmp == p:
        cnt +=1
    else:
        cnt = 1
    ans_list[idx] = format(p ,'06') + format(cnt, '06')

for ans in ans_list:
  print(ans)

Submission status: Wrong Answer

Solution code:
n,m=map(int, input().split())
p=[1]*(n+1)
c=[]
for i in range(m):
  pi,x =map(int, input().split())
  c.append([i+1, pi, x, 0])
  #p[pi].append(x)
#for i in range(n):
# p[i]=sorted(p[i])
x_order = sorted(c, key=lambda e: e[2])
for e in x_order:
  e[3] = p[pi]
  p[pi] += 1

i_order = sorted(x_order)
for e in i_order:
  id=e[1]*1000000+e[3]
  print(str(id).zfill(12))

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
py=[]
for i in range(m):
    py.append(list(input().split()))
    py[i].append(i)
    str(py[i][1])

py.sort(key=lambda x :(x[0],x[1]))
ans=[]
city=0
order=1

for i in range(m):
    ans.append(py[i][0].zfill(6))
    if city==py[i][0]:
        order+=1
        ans[i]+=(str(order).zfill(6))
    else:
        city=py[i][0]
        order=1
        ans[i]+=(str(order).zfill(6)) 

real_ans=[0]*m
for i in range(m):
    real_ans[py[i][2]]=ans[i]

for i in range(m):
    print(real_ans[i])

Submission status: Wrong Answer

Solution code:
n,m=map(int, input().split())
p=[[] for i in range(n+1)]
c=[]
for i in range(m):
  pi,x =map(int, input().split())
  c.append((pi,x))
  p[pi].append(x)
for i in range(n):
  p[i]=sorted(p[i])
for e in c:
  id=e[0]*1000000+p[e[0]].index(e[1])+1
  print(str(id).zfill(12))

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
py=[]
for i in range(m):
    py.append(list(input().split()))
    py[i].append(i)
    str(py[i][1])
py.sort(key=lambda x :(x[0],x[1]))
ans=[]
city=0
order=1

for i in range(m):
    ans.append(py[i][0].zfill(6))
    if city==py[i][0]:
        order+=1
        ans[i]+=(str(order).zfill(6))
    else:
        city=py[i][0]
        order=1
        ans[i]+=(str(order).zfill(6)) 

real_ans=[0]*m
for i in range(m):
    real_ans[py[i][2]]=ans[i]

for i in range(m):
    print(real_ans[i])

Submission status: Wrong Answer

Solution code:
# ABC113C - ID
import sys
input = sys.stdin.readline

def main():
    N, M = tuple(map(int, input().split()))
    P = [[] for _ in range(N + 1)]  # prefectures
    for num in range(M):  # classify cities by prefectures
        pref, year = tuple(map(int, input().split()))
        P[pref] += [(year, num)]
    ans = [""] * M
    P = tuple(sorted(p) for p in P)  # sort by year
    for pref_idx, pref in enumerate(P):
        for city_idx, (_, num) in enumerate(pref, 1):
            x = "{:06}{:06}".format(pref_idx, city_idx)
            ans[num] = x
    print(*ans, sep="\n")
    print(type(P))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N, M = map(int, input().split())
L = []
for i in range(M):
    P, Y = map(int, input().split())
    L.append([P, Y])

L = sorted(L)

reset = 0
count = 0
for i in range(M):
    if L[i][0] != reset:
        reset = L[i][0]
        count = 1
    else:
        count += 1
    
    ans = str(reset).zfill(6) + str(count).zfill(6)
    print(ans)

Submission status: Wrong Answer

Solution code:
# ABC 113 C

import numpy as np

def resolve():
    N, M = map(int, input().split())

    arr = [[] for _ in range(N+1)]

    cities = []

    for _ in range(M):
        p, y = map(int, input().split())
        arr[p].append(y)
        cities.append([p, y])

    for a in arr:
        arr[1].sort()

    for city in cities:
        idx = arr[city[0]].index(city[1])+1
        print('%06d%06d' % (city[0], idx))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
t=[[] for _ in range(n)]
for i in range(m):
    p,y=map(int,input().split())
    t[p-1].append((y,i))
ans=[""]*m
for i,j in enumerate(t,1):
    j.sort()
    for k,(j,l) in enumerate(j,1):
        print(l)
        ans[l]=str(i).zfill(6)+str(k).zfill(6)
print("\n".join(ans))

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
N, M = n[0], n[1]

import numpy as np

def main():
    M_list = []
    y_array = np.array([[10000000000]*M]*N)
    for i in range(M):
        tmp = list(map(int, input().split()))
        M_list.append(tmp[0])
        y_array[tmp[0]-1,i] = tmp[1]

    num_array = np.zeros([N,M])
    ynum_array = np.ones([N,M])
    for k in range(N):
        #print(np.argsort(y_array[k]))
        num_array[k,:] = np.argsort(y_array[k])
        y_sorted = np.sort(y_array)
        tmp = 1
        for l in np.argsort(y_array[k]):
            if int(ynum_array[k][l]) == 10000000000:
                break
            ynum_array[k][l] = tmp
            tmp += 1

    for j in range(M):
        ac = (str(M_list[j]).zfill(5)) + (str(int(ynum_array[M_list[j]-1][j])).zfill(5))
        print(ac)
        
    #print(y_array)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import heapq
import sys
#input = sys.stdin.readline().strip
N, M = map(int, input().split())
clist = []
HQ = [[] for _ in range(N)]
for i in range(M):
    p, y = map(int, input().split())
    clist.append((p, y))
    heapq.heappush(HQ[p - 1], y)
print(HQ)

cmap = {}
for p, q in enumerate(HQ):
    cnt = 0
    for i in range(len(q)):
        y = heapq.heappop(q)
        cmap[str(p) + '_' + str(y)] = i + 1

for p, y in clist:
    idx = cmap[str(p - 1) + '_' + str(y)]
    print('{0:06d}'.format(p) + '{0:06d}'.format(idx))