fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2026-02-28 14:46:39
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2026-02-28 14:54:55
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name ""
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = 510;
  54. int n,a[N][7];
  55.  
  56. namespace hungeazy {
  57.  
  58.     vi g[N];
  59.     int mx[N],my[N],d[N];
  60.  
  61.     bool dominate(int i, int j)
  62.     {
  63.         bool check = false;
  64.         FOR(k,1,6)
  65.         {
  66.             if (a[i][k] < a[j][k]) return false;
  67.             if (a[i][k] > a[j][k])
  68.                 check = true;
  69.         }
  70.         return check;
  71.     }
  72.  
  73.     bool BFS()
  74.     {
  75.         queue<int> q;
  76.         FOR(i,1,n)
  77.             if (!mx[i]) q.push(i), d[i] = 0;
  78.             else d[i] = -1;
  79.         bool kt = false;
  80.         while (!q.empty())
  81.         {
  82.             int u = q.front();
  83.             q.pop();
  84.             for (int v : g[u])
  85.                 if (!my[v]) kt = true;
  86.                 else if (d[my[v]] < 0)
  87.                 {
  88.                     d[my[v]] = d[u]+1;
  89.                     q.push(my[v]);
  90.                 }
  91.         }
  92.         return kt;
  93.     }
  94.  
  95.     bool DFS(int u)
  96.     {
  97.         for (int v : g[u])
  98.             if (!my[v])
  99.             {
  100.                 mx[u] = v;
  101.                 my[v] = u;
  102.                 return true;
  103.             }
  104.             else if (d[my[v]] == d[u]+1 and DFS(my[v])) 
  105.             {
  106.                 mx[u] = v;
  107.                 my[v] = u;
  108.                 return true;
  109.             }   
  110.         return false;
  111.     }
  112.  
  113.     int calc()
  114.     {
  115.         while (BFS())
  116.             FOR(i,1,n)
  117.                 if (!mx[i]) DFS(i);
  118.         int ans = 0;
  119.         FOR(i,1,n) ans += (mx[i] != 0);
  120.         return ans;
  121.     }
  122.  
  123.     void solve(void)
  124.     {
  125.         FOR(i,1,n)
  126.             FOR(j,1,n)
  127.                 if (i != j and dominate(i,j))
  128.                     g[i].pb(j);
  129.         int match = calc();
  130.         cout << match;
  131.     }
  132.  
  133. }
  134.  
  135. bool M2;
  136. signed main()
  137. {
  138.     fast;
  139.     if (fopen(name".inp","r"))
  140.     {
  141.         freopen(name".inp","r",stdin);
  142.         freopen(name".out","w",stdout);
  143.     }
  144.     cin >> n;
  145.     FOR(i,1,n)
  146.         FOR(j,1,6) cin >> a[i][j];
  147.     hungeazy::solve();
  148.     time();
  149.     memory();
  150.     return 0;
  151. }
  152. // ██░ ██  █    ██  ███▄    █   ▄████
  153. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  154. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  155. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  156. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  157. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  158. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  159. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  160. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0s 5304KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:4.41ms.
0.0506821 MB
https://ideone.com/4mjKjJ
language:
C++14 (gcc 8.3)
created:
1 day 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!