#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;
#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, nTask;
int a[MAX];
int numQuery;
bitset<MAX> mark;
vector<int> in[MAX], out[MAX];
int need[MAX];
void Whisper(){
cin >> nTask >> nArr;
queue<int> q, unlocked;
for (int i = 1; i <= nArr; ++i){
cin >> a[i]; mark[a[i]] = 1;
q.push(a[i]);
}
cin >> numQuery;
int pos = 1;
for (int t = 1; t <= numQuery; ++t){
int l, r; cin >> l >> r;
need[pos] = l;
FOR(i, 1, l){
int x; cin >> x;
in[x].push_back(pos);
}
FOR(i, 1, r){
int x; cin >> x;
out[pos].push_back(x);
}
++pos;
}
while (!q.empty()){
int top = q.front(); q.pop();
for (auto&v : in[top]){
if (need[v]) --need[v];
if (need[v] == 0){
unlocked.push(v);
}
}
while (!unlocked.empty()){
int x = unlocked.front(); unlocked.pop();
for (auto&v : out[x]){
if (!mark[v])
q.push(v), mark[v] = 1;
}
}
}
cout << mark.count() << '\n';
for (int i = 1; i <= nTask; ++i) if(mark[i]) cout << i << " ";
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5720 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
7516 KB |
Output is correct |
| 2 |
Correct |
13 ms |
8028 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
9760 KB |
Output is correct |
| 2 |
Correct |
24 ms |
10088 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
10836 KB |
Output is correct |
| 2 |
Correct |
29 ms |
11296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
11860 KB |
Output is correct |
| 2 |
Correct |
34 ms |
11100 KB |
Output is correct |
