#include #include using namespace std; // using mint = long double; // using mint = modint998244353; // using mint = modint1000000007; typedef long long ll; typedef pair P; typedef pair T; typedef pair > Pd; const ll INF = 1e18; const ll fact_table = 3200008; priority_queue pql; priority_queue

pqp; //big priority queue // priority_queue , greater > pqls; priority_queue , greater

> pqps; //small priority queue //top pop ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1}; //↓,→,↑,← /* #define endl "\n" #ifdef ENJAPMA #undef endl #endif */ #define p(x) cout<= (b); i--) typedef vector vec; typedef vector> mat; // vec v(n) -> 長さnのベクトルを宣言 // mat dp(h, vec(w)) -> h * w の行列を宣言 // const ll mod = 998244353ll; const ll mod = 1000000007ll; ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;} vec rv(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;} void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;} void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;} void line() { p("--------------------"); return;} /* ll fact[fact_table + 5], rfact[fact_table + 5]; void c3_init() { fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod; } */ bool icpc = false; bool multicase = false; ll n, m; ll box[200005], color[200005]; ll parent[500005], sizes[500005]; void init(ll n) { for (ll i = 0; i <= n; i++) { parent[i] = i; } } ll find(ll x) { if (parent[x] == x) { return x; } else { return parent[x] = find(parent[x]); } } void unite(ll x, ll y) { x = find(x); y = find(y); if (x == y)return; if (sizes[x] < sizes[y])swap(x, y); parent[y] = x; sizes[x] += sizes[y]; } bool same(ll x, ll y) { return find(x) == find(y); } ll size(ll x) { return sizes[find(x)]; } vec G[500005]; bool solve() { cin >> n >> m; init(n + 10); for (int i = 0; i < n; i++) { cin >> box[i] >> color[i]; G[color[i]].pb(i); } ll ans = 0; for (int i = 1; i <= n; i++) { for (int j=0;j+1> q; } else { q = 1; } while (q--) { // pu("Case ");pu("#");pu(testcase);pu(": "); solve(); testcase++; } // solve(); return 0; }