Submission #75255190


Source Code Expand

#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;
}

Submission Info

Submission Time
Task D - Card Pile Query
User takumat
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1626 Byte
Status AC
Exec Time 120 ms
Memory 6052 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 26
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3816 KiB
sample01.txt AC 1 ms 3788 KiB
testcase00.txt AC 49 ms 5108 KiB
testcase01.txt AC 118 ms 6000 KiB
testcase02.txt AC 26 ms 4720 KiB
testcase03.txt AC 117 ms 5952 KiB
testcase04.txt AC 92 ms 5132 KiB
testcase05.txt AC 118 ms 6052 KiB
testcase06.txt AC 1 ms 3760 KiB
testcase07.txt AC 47 ms 3788 KiB
testcase08.txt AC 114 ms 5868 KiB
testcase09.txt AC 115 ms 5924 KiB
testcase10.txt AC 114 ms 5860 KiB
testcase11.txt AC 119 ms 5868 KiB
testcase12.txt AC 120 ms 5872 KiB
testcase13.txt AC 120 ms 5940 KiB
testcase14.txt AC 116 ms 5952 KiB
testcase15.txt AC 118 ms 5868 KiB
testcase16.txt AC 2 ms 3872 KiB
testcase17.txt AC 2 ms 3744 KiB
testcase18.txt AC 1 ms 3944 KiB
testcase19.txt AC 3 ms 4052 KiB
testcase20.txt AC 2 ms 3836 KiB
testcase21.txt AC 3 ms 3896 KiB
testcase22.txt AC 4 ms 3748 KiB
testcase23.txt AC 4 ms 3932 KiB