Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define int int64_t
- using namespace std;
- int n, m, k, a, b;
- set<pair<int, set<int>>> party;
- vector<pair<pair<int, int>, bool>> test;
- vector<int> tmi;
- /*void infect(int x, int tm){
- queue<int> q;
- for(int cur_tm = tm + a; cur_tm < tm + b; cur_tm++){
- if(party[].f)
- }
- }*/
- int32_t main(){
- int t;
- cin >> t;
- while(t--){
- cin >> n >> m >> k >> a >> b;
- party.clear();
- test.clear();
- tmi.resize(n);
- while(m--){
- int tm, v;
- cin >> tm >> v;
- set<int> visitors;
- while(v--){
- int x;
- cin >> x;
- x--;
- visitors.insert(x);
- }
- party.emplace(tm, visitors);
- }
- while(k--){
- pair<int, int> idf;
- bool res;
- cin >> idf.first >> idf.second >> res;
- idf.second--;
- test.emplace_back(idf, res);
- }
- /*for(int cur = 0; cur < n; cur++)
- for(int tm = 1; tm <= 10000; tm++){
- for(int i = 0; i < n; i++)
- tmi[i] = -1;
- infect(cur, tm);
- }*/
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment