Submission #3609494

---

Source Code Expand

#include<iostream>

#include <vector>
#include <list>
#include<stack>
#include<queue>
#include<array>

#include <set>
#include<map>

#include<string>
#include<stdlib.h>
#include<memory>

#include<algorithm>
#include <functional>
#include<math.h>

#include<fstream>
#include<iomanip>

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#define FOR(k,m,n) for(ll (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define WAITING(str) int str;std::cin>>str;
#define DEBUGING(str) cout<<str<<endl

constexpr int INF = (1 << 30);
constexpr ll INFL = (1ll << 60);
constexpr ll MOD = 1000000007;// 10^9+7


//変数
ll N, M;
vector<pair<ll, ll>> py;
map<ll, vector<pair<ll, ll>>> info;




//サブ関数
//入力
void input()
{
	cin >> N >> M;
	REP(i, M)
	{
		ll a, b;
		cin >> a >> b;
		py.push_back({a,b});
		info[a].push_back({b,i});
	}
}


//計算
void calc()
{
	for(auto& row : info)sort(row.second.begin(), row.second.end());
	for(const auto& row : info)REP(i, row.second.size())py[row.second[i].second].second = i + 1;
	for(auto p : py)cout << setfill('0') << right << setw(6) << p.first
		<< setfill('0') << right << setw(6) << p.second << endl;
}


//出力
void output()
{

}


//デバッグ
void debug()
{
	int N;
	cin >> N;
}


//メイン関数
int main()
{
	input();
	calc();
	output();
	debug();

	return 0;
}

Submission Info

Judge Result