ProgMe

Untitled

Feb 17th, 2021
171
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.22 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #define int int64_t
  3.  
  4. using namespace std;
  5.  
  6. int n, m, k, a, b;
  7. set<pair<int, set<int>>> party;
  8. vector<pair<pair<int, int>, bool>> test;
  9. vector<int> tmi;
  10.  
  11. /*void infect(int x, int tm){
  12. queue<int> q;
  13. for(int cur_tm = tm + a; cur_tm < tm + b; cur_tm++){
  14. if(party[].f)
  15. }
  16. }*/
  17.  
  18. int32_t main(){
  19. int t;
  20. cin >> t;
  21. while(t--){
  22. cin >> n >> m >> k >> a >> b;
  23. party.clear();
  24. test.clear();
  25. tmi.resize(n);
  26. while(m--){
  27. int tm, v;
  28. cin >> tm >> v;
  29. set<int> visitors;
  30. while(v--){
  31. int x;
  32. cin >> x;
  33. x--;
  34. visitors.insert(x);
  35. }
  36. party.emplace(tm, visitors);
  37. }
  38. while(k--){
  39. pair<int, int> idf;
  40. bool res;
  41. cin >> idf.first >> idf.second >> res;
  42. idf.second--;
  43. test.emplace_back(idf, res);
  44. }
  45. /*for(int cur = 0; cur < n; cur++)
  46. for(int tm = 1; tm <= 10000; tm++){
  47. for(int i = 0; i < n; i++)
  48. tmi[i] = -1;
  49. infect(cur, tm);
  50. }*/
  51. }
  52. }
Advertisement
Add Comment
Please, Sign In to add comment