提出 #75255190

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>

#define LF putchar('\n')

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353LL; //1000000007LL;
static const LLONG INF_NUM = 1e18;
static const int CH_KIND = 'z' - 'a' + 1;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int x, int exp)
{
	_T ans = 1;
	_T base = x;
	while (exp > 0) {
		if (exp & 1) {
			ans = (ans * base);
		}
		base = (base * base);
		exp >>= 1;
	}
	return ans;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

struct stk {
    int under = -1;
    int upper = -1;
};

static void task()
{
    int N, Q;
    get(N, Q);

    std::vector<stk> cards(N);
    while (Q--) {
        int c, p;
        get(c, p); c--; p--;

        if (cards[c].under != -1) {
            cards[cards[c].under].upper = -1;
        }
        cards[c].under = p;
        cards[p].upper = c;
    }
    for (int i = 0; i < N; i++) {
        int num = 0;
        if (cards[i].under == -1) {
            num = 1;
            int upper = cards[i].upper;
            while (upper != -1) {
                num++;
                upper = cards[upper].upper;
            }
        }
        printf("%d ", num);
    }
    LF;
}

提出情報

ジャッジ結果