結果

問題 No.1477 Lamps on Graph
ユーザー Ogtsn99
提出日時 2021-04-16 20:46:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 219 ms / 2,000 ms
コード長 4,248 bytes
コンパイル時間 2,357 ms
コンパイル使用メモリ 203,392 KB
最終ジャッジ日時 2025-01-20 19:03:19
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
// p.real() or real(p) -> x, p.imag() or imag(p) -> y
using Vector2d = complex<Real>;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template<typename T>
int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template<typename T>
int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << pair_var.first << ' ' << pair_var.second;
return os;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << ' ';
return os;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << '\n';
return os;
}
template<typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df) os << vec;
return os;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
repi(itr, map_var) {
os << *itr << ' ';
itr++;
itr--;
}
return os;
}
template<typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
repi(itr, set_var) {
os << *itr << ' ';
itr++;
itr--;
}
return os;
}
void print() { cout << endl; }
template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
int n, m; cin>>n>>m;
vector<int> a(n); cin>>a;
UnWeightedGraph g(n);
rep(i, m) {
int a, b; cin>>a>>b;
a--, b--;
g[a].pb(b);
g[b].pb(a);
}
vector<int> on(n);
int k; cin>>k;
rep(i, k) {
int a; cin>>a;
a--;
on[a] = true;
}
priority_queue <pair <int, int> , vector <pair <int, int> >, greater <>> pq;
rep(i, n) {
if(on[i]) pq.push({a[i], i});
}
vector<int> ans;
while(!pq.empty()) {
int now = pq.top().S;
pq.pop();
if(!on[now]) continue;
on[now] = false;
for (auto nei : g[now]) {
if(a[now] < a[nei]) {
on[nei] = 1 - on[nei];
if(on[nei]) {
pq.push({a[nei], nei});
}
}
}
ans.pb(now);
}
print(ans.size());
rep(i, ans.size()) {
print(ans[i] + 1);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0