結果

問題 No.1477 Lamps on Graph
ユーザー 👑 hitonanodehitonanode
提出日時 2021-04-16 20:06:15
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 80 ms / 2,000 ms
コード長 4,924 bytes
コンパイル時間 2,171 ms
コンパイル使用メモリ 211,660 KB
実行使用メモリ 11,348 KB
最終ジャッジ日時 2023-09-15 20:14:26
合計ジャッジ時間 6,075 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,356 KB
testcase_01 AC 2 ms
4,356 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 1 ms
4,356 KB
testcase_05 AC 1 ms
4,360 KB
testcase_06 AC 2 ms
4,352 KB
testcase_07 AC 2 ms
4,360 KB
testcase_08 AC 1 ms
4,356 KB
testcase_09 AC 1 ms
4,352 KB
testcase_10 AC 2 ms
4,356 KB
testcase_11 AC 1 ms
4,356 KB
testcase_12 AC 43 ms
6,848 KB
testcase_13 AC 40 ms
6,604 KB
testcase_14 AC 51 ms
7,476 KB
testcase_15 AC 23 ms
4,928 KB
testcase_16 AC 17 ms
4,976 KB
testcase_17 AC 16 ms
5,136 KB
testcase_18 AC 41 ms
8,152 KB
testcase_19 AC 37 ms
7,136 KB
testcase_20 AC 15 ms
4,356 KB
testcase_21 AC 35 ms
7,260 KB
testcase_22 AC 10 ms
4,356 KB
testcase_23 AC 29 ms
5,348 KB
testcase_24 AC 57 ms
8,128 KB
testcase_25 AC 20 ms
4,676 KB
testcase_26 AC 51 ms
8,572 KB
testcase_27 AC 27 ms
5,300 KB
testcase_28 AC 32 ms
6,364 KB
testcase_29 AC 30 ms
5,624 KB
testcase_30 AC 21 ms
5,596 KB
testcase_31 AC 17 ms
5,248 KB
testcase_32 AC 65 ms
11,348 KB
testcase_33 AC 62 ms
10,992 KB
testcase_34 AC 56 ms
11,292 KB
testcase_35 AC 80 ms
10,560 KB
testcase_36 AC 73 ms
10,588 KB
testcase_37 AC 69 ms
10,564 KB
testcase_38 AC 73 ms
10,508 KB
testcase_39 AC 77 ms
10,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> A(N);
    cin >> A;
    vector<pint> a2i;
    REP(i, N) a2i.emplace_back(A[i], i);
    sort(ALL(a2i));
    vector<int> state(N);

    vector<vector<int>> to(N);
    while (M--) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        to[u].emplace_back(v), to[v].emplace_back(u);
    }

    int K;
    cin >> K;
    while (K--) {
        int b;
        cin >> b;
        b--;
        state[b] = 1;
    }

    vector<int> ret;
    for (auto [a, i] : a2i) {
        if (state[i]) {
            ret.emplace_back(i + 1);
            for (auto j : to[i]) if (A[j] > A[i]) state[j] ^= 1;
        }
    }
    cout << ret.size() << '\n';
    for (auto x : ret) cout << x << '\n';
}
0