結果
問題 | No.1477 Lamps on Graph |
ユーザー |
![]() |
提出日時 | 2021-10-21 02:50:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 336 ms / 2,000 ms |
コード長 | 2,766 bytes |
コンパイル時間 | 3,921 ms |
コンパイル使用メモリ | 188,012 KB |
最終ジャッジ日時 | 2025-01-25 02:11:37 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
#include <algorithm>#include <iomanip>#include <array>#include <bitset>#include <cassert>#include <cmath>#include <cstdio>#include <deque>#include <functional>#include <iostream>#include <iterator>#include <map>#include <queue>#include <set>#include <string>#include <sstream>#include <unordered_map>#include <unordered_set>#include <utility>#include <numeric>#include <vector>#include <climits>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using i64 = long long;template<class T, class U>bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }template<class T, class U>bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;vector<vector<int>> edge;vector<int> state;void solve(int now) {state[now] ^= 1;for(auto i : edge[now]) state[i] ^= 1;}int main() {int n, m;cin >> n >> m;state.resize(n);edge.resize(n);map<int,int> mii;vector<pair<int,int>> v;rep(i, n) {int a;cin >> a;mii[i] = a;v.emplace_back(a, i);}rep(i, m) {int j, k;cin >> j >> k;j--;k--;if(mii[j] < mii[k]) edge[j].push_back(k);if(mii[k] < mii[j]) edge[k].push_back(j);}int k;cin >> k;rep(i, k) {int b;cin >> b;b--;state[b] = 1;}sort(all(v));vector<int> ans;for(auto [i, j] : v) {// cout << "state : " << state << endl;if(state[j]) {solve(j);ans.push_back(j + 1);}}// cout << "ans" << endl;auto sum = accumulate(all(state), 0);if(sum == 0) {cout << int(ans.size()) << endl;cout << ans << endl;}else{cout << -1 << endl;}return 0;}