Submission #47741252

---

Source Code Expand

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

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    Num m {0};
    is >> n >> m;

    Num winner {-1};
    Vec counts(n, 0);
    for(Num i{0}; i<m; ++i) {
        Num x {0};
        is >> x;
        --x;

        Num new_winner = x;
        counts.at(x) += 1;

        if (i > 0) {
            new_winner = (
                (x == winner) ||
                (counts.at(x) > counts.at(winner)) ||
                ((counts.at(x) == counts.at(winner)) & (x < winner))) ?
                x : winner;
        }

        os << (new_winner + 1) << "\n";
        winner = new_winner;
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result