fork download 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "diduduadi"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 2e5 + 5;
  39. int n, m, q, num, T[N];
  40. array<int, 4> Q[N];
  41. vector<ii> people[N];
  42. int tmp[N];
  43.  
  44. int check(int drink) {
  45.     int ans = 0, cnt = 0;
  46.     for(ii per : people[drink]) {
  47.           tmp[per.fi] = T[per.fi];
  48.      }
  49.      bool ok = false;
  50.     for(ii per : people[drink]) {
  51.         if (T[per.fi] <= per.se) ok = true;
  52.         if (T[per.fi]  < inf) cnt++;
  53.         if (T[per.fi] <= inf) ans++;
  54.         T[per.fi] = inf + 1;
  55.     }
  56.     for(ii per : people[drink]) T[per.fi] = tmp[per.fi];
  57.     return (cnt == num && !ok ? ans : -1);
  58. }
  59.  
  60. void init(void) {
  61.     cin >> n >> m >> q;
  62.     FOR(i, 1, m) people[i].clear();
  63.     FOR(i, 1, n) T[i] = inf;
  64.     num = 0;
  65.     FOR(i, 1, q) {
  66.         char t;
  67.         cin >> t;
  68.         if (t == '+') {
  69.             int per, drink, time;
  70.             cin >> per >> drink >> time;
  71.             people[drink].pb({per, time});
  72.         }
  73.         else {
  74.             int per, time;
  75.             cin >> per >> time;
  76.             T[per] = time;
  77.             num++;
  78.         }
  79.     }
  80. }
  81.  
  82. void process(void) {
  83.     FOR(i, 1, m) sort(all(people[i]));
  84.     int ans = -1;
  85.     FOR(i, 1, m) maximize(ans, check(i));
  86.     cout << ans << ' ';
  87. }
  88.  
  89. int main() {
  90.     ios_base::sync_with_stdio(0);
  91.     cin.tie(0); cout.tie(0);
  92.     if (fopen(task".inp", "r")) {
  93.         freopen(task".inp", "r", stdin);
  94.         freopen(task".out", "w", stdout);
  95.     }
  96.     int subtask, tc = 1;
  97.     cin >> subtask >> tc;
  98.     while(tc--) {
  99.         init();
  100.         process();
  101.     }
  102.     return 0;
  103. }
Success #stdin #stdout 0.01s 8804KB
comments (?)
stdin 
Standard input is empty
stdout 
-1
https://ideone.com/ianJKU
language:
C++14 (gcc 8.3)
created:
14 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!