//#pragma comment(linker, "/stack:200000000") #ifndef LOCAL #pragma GCC optimize("O3") #endif //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifdef LOCAL ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define pb push_back #define mp make_pair #define st first #define nd second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define un(x) x.erase(unique(ALL(x)),x.end()) #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define TRAV(i,v)for(auto &i:(v)) #define REMIN(x,v) x=min(x,v); #define REMAX(x,v) x=max(x,v); mt19937_64 rng(134569); int rd(int l, int r) {return uniform_int_distribution<int>(l, r)(rng);} using ll=long long; using pii=pair<int,int>; using pll=pair<ll,ll>; using vi=vector<int>; using vll=vector<ll>; const int MOD=1e9+7;//998244353; int tot[2][1<<21]; const int mx=(1<<20); int main() { ios_base::sync_with_stdio(0);cin.tie(0); cout << fixed << setprecision(11); cerr << fixed << setprecision(6); int n;cin>>n; FOR(i,n) { int w,r,t; cin>>r>>w>>t; tot[r-1][mx+w-t]++; } int sum=0; FOR(i, (1<<21)) sum+=max(tot[0][i], tot[1][i]); cout<<n-sum<<"\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | //#pragma comment(linker, "/stack:200000000") #ifndef LOCAL #pragma GCC optimize("O3") #endif //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifdef LOCAL ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define pb push_back #define mp make_pair #define st first #define nd second #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define un(x) x.erase(unique(ALL(x)),x.end()) #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define TRAV(i,v)for(auto &i:(v)) #define REMIN(x,v) x=min(x,v); #define REMAX(x,v) x=max(x,v); mt19937_64 rng(134569); int rd(int l, int r) {return uniform_int_distribution<int>(l, r)(rng);} using ll=long long; using pii=pair<int,int>; using pll=pair<ll,ll>; using vi=vector<int>; using vll=vector<ll>; const int MOD=1e9+7;//998244353; int tot[2][1<<21]; const int mx=(1<<20); int main() { ios_base::sync_with_stdio(0);cin.tie(0); cout << fixed << setprecision(11); cerr << fixed << setprecision(6); int n;cin>>n; FOR(i,n) { int w,r,t; cin>>r>>w>>t; tot[r-1][mx+w-t]++; } int sum=0; FOR(i, (1<<21)) sum+=max(tot[0][i], tot[1][i]); cout<<n-sum<<"\n"; return 0; } |