#include<bits/stdc++.h> using namespace std; #define PII pair<int,int> #define st first #define nd second #define LL long long #define pushb push_back #define popb pop_back #define cerr if(1) cout #define sz(x) (int)x.size() #define _upgrade ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) const int MXN=1e5; int t, n; int L[MXN+5], A[MXN+5], B[MXN+5]; int main( ) { _upgrade; cin>>t; while( t-- ) { cin>>n; for( int i=0; i<n; i++ ) cin>>L[i]>>A[i]>>B[i]; LL sum1=0, sum2=0; for( int i=0; i<n; i++ ) sum1+=(LL)L[i]*A[i], sum2+=(LL)L[i]*B[i]; int maxa=0, mina=1e9; for( int i=0; i<n; i++ ) maxa=max(maxa,A[i]), mina=min(mina,A[i]); int maxb=0, minb=1e9; for( int i=0; i<n; i++ ) maxb=max(maxb,B[i]), minb=min(minb,B[i]); if( maxb>maxa || minb<mina ){ cout<<"NIE\n"; continue; } if( sum1!=sum2 ){ cout<<"NIE\n"; continue; } cout<<"TAK\n"; } }
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 | #include<bits/stdc++.h> using namespace std; #define PII pair<int,int> #define st first #define nd second #define LL long long #define pushb push_back #define popb pop_back #define cerr if(1) cout #define sz(x) (int)x.size() #define _upgrade ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) const int MXN=1e5; int t, n; int L[MXN+5], A[MXN+5], B[MXN+5]; int main( ) { _upgrade; cin>>t; while( t-- ) { cin>>n; for( int i=0; i<n; i++ ) cin>>L[i]>>A[i]>>B[i]; LL sum1=0, sum2=0; for( int i=0; i<n; i++ ) sum1+=(LL)L[i]*A[i], sum2+=(LL)L[i]*B[i]; int maxa=0, mina=1e9; for( int i=0; i<n; i++ ) maxa=max(maxa,A[i]), mina=min(mina,A[i]); int maxb=0, minb=1e9; for( int i=0; i<n; i++ ) maxb=max(maxb,B[i]), minb=min(minb,B[i]); if( maxb>maxa || minb<mina ){ cout<<"NIE\n"; continue; } if( sum1!=sum2 ){ cout<<"NIE\n"; continue; } cout<<"TAK\n"; } } |