結果
問題 | No.1477 Lamps on Graph |
ユーザー | packer_jp |
提出日時 | 2021-04-16 20:43:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 268 ms / 2,000 ms |
コード長 | 3,782 bytes |
コンパイル時間 | 2,282 ms |
コンパイル使用メモリ | 212,344 KB |
実行使用メモリ | 16,492 KB |
最終ジャッジ日時 | 2023-09-15 21:48:06 |
合計ジャッジ時間 | 9,014 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 119 ms
9,908 KB |
testcase_13 | AC | 121 ms
9,340 KB |
testcase_14 | AC | 146 ms
11,144 KB |
testcase_15 | AC | 60 ms
6,972 KB |
testcase_16 | AC | 42 ms
6,080 KB |
testcase_17 | AC | 45 ms
5,860 KB |
testcase_18 | AC | 173 ms
10,608 KB |
testcase_19 | AC | 112 ms
9,036 KB |
testcase_20 | AC | 41 ms
5,716 KB |
testcase_21 | AC | 151 ms
9,312 KB |
testcase_22 | AC | 24 ms
4,696 KB |
testcase_23 | AC | 77 ms
7,912 KB |
testcase_24 | AC | 178 ms
12,176 KB |
testcase_25 | AC | 56 ms
6,372 KB |
testcase_26 | AC | 165 ms
11,580 KB |
testcase_27 | AC | 67 ms
7,640 KB |
testcase_28 | AC | 87 ms
8,772 KB |
testcase_29 | AC | 86 ms
7,932 KB |
testcase_30 | AC | 98 ms
6,964 KB |
testcase_31 | AC | 60 ms
6,352 KB |
testcase_32 | AC | 268 ms
16,340 KB |
testcase_33 | AC | 222 ms
15,820 KB |
testcase_34 | AC | 258 ms
16,492 KB |
testcase_35 | AC | 237 ms
15,036 KB |
testcase_36 | AC | 227 ms
14,904 KB |
testcase_37 | AC | 186 ms
14,652 KB |
testcase_38 | AC | 200 ms
14,624 KB |
testcase_39 | AC | 226 ms
15,000 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define reps(i, n) for (int i = 1; i <= (int)(n); i++) #define all(a) (a).begin(), (a).end() #define uniq(a) (a).erase(unique(all(a)), (a).end()) #define bit(n) (1LL << (n)) #define dump(a) cerr << #a " = " << (a) << endl #define fin(a) \ cout << (a) << endl; \ return 0 using vint = vector<int>; using pint = pair<int, int>; using vpint = vector<pint>; template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; constexpr double PI = 3.1415926535897932384626433832795028; constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; int sign(int a) { return (a > 0) - (a < 0); } int cdiv(int a, int b) { return (a - 1 + b) / b; } template <typename T> T sq(T a) { return a * a; } template <typename T, typename U> bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template <typename T, typename U> bool chmin(T &a, const U &b) { if (b < a) { a = b; return true; } return false; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) { os << "(" << a.first << ", " << a.second << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const deque<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } struct setup { static constexpr int PREC = 20; setup() { cout << fixed << setprecision(PREC); cerr << fixed << setprecision(PREC); }; } setup; signed main() { int n, m; cin >> n >> m; vint a(n); vector<pint> ai(n); rep(i, n) { cin >> a[i]; ai[i] = {a[i], i}; } sort(all(ai)); vint u(m), v(m); vector adj(n, vint()); rep(i, m) { cin >> u[i] >> v[i], u[i]--, v[i]--; adj[u[i]].emplace_back(v[i]); adj[v[i]].emplace_back(u[i]); } int k; cin >> k; vint b(k), s(n); rep(i, k) { cin >> b[i], b[i]--; s[b[i]] = 1; } vint ans; for (auto [_, i] : ai) { if (s[i] == 1) { ans.emplace_back(i); for (int to : adj[i]) { if (a[i] < a[to]) { s[to] = 1 - s[to]; } } } } cout << ans.size() << endl; for (int x : ans) cout << x + 1 << endl; }