//Jakub Staroń #include <iostream> #include <sstream> #include <string> #include <vector> #include <map> #include <set> #include <list> #include <deque> #include <queue> #include <stack> #include <algorithm> #include <cstdlib> #include <cmath> #include <ctime> #include <cstdio> #ifdef COMPILING_HOME #define DEBUG_MODE #define HAVE_NEW_STANDARD #endif #ifdef HAVE_NEW_STANDARD #include <unordered_map> #include <unordered_set> #else #include <tr1/unordered_map> #include <tr1/unordered_set> using namespace std::tr1; #endif #define hash_map unordered_map #define hash_multimap unordered_multimap #define hash_set unordered_set #define hash_multiset unordered_multiset using namespace std; typedef char int8; typedef unsigned char uint8; typedef short int int16; typedef unsigned short int uint16; typedef int int32; typedef unsigned int uint32; typedef long long int64; typedef unsigned long long uint64; typedef std::pair<int32,int32> int32_pair; typedef std::pair<uint32, uint32> uint32_pair; typedef std::pair<int64,int64> int64_pair; typedef std::pair<uint64,uint64> uint64_pair; typedef std::vector<bool> bit_vector; #ifdef HAVE_NEW_STANDARD #define let(a,b) auto a = (b) #else #define let(a,b) __typeof (b) a = (b) #endif #ifdef DEBUG_MODE #define pause system("pause") #define clear_screen system("cls") #define print(x) cerr << #x << " = " << x << endl #define label_print(label, value) cerr << label << ' ' << value << endl #define debug(x) x #define line cerr << "Line " << __LINE__ << endl #include <cassert> #else #define pause #define clear_screen #define print(x) #define label_print(label, value) #define debug(x) #define assert(x) #define line #endif #define rep(i,x) for(uint32 i = 0 ; i < (x) ; i++) #define for_range(i,begin,end) for( let(i, (begin) ) ; i != (end) ; ++i ) #define foreach(i, c) for_range(i, c.begin(), c.end()) #define abs(a) ( (a) < 0 ? -(a) : (a) ) #define all(c) (c).begin(),(c).end() #define sort_all(x) sort( all(x) ) #define divide(a,b) ( ( (b)%(a) ) == 0 ) #define mp(x,y) make_pair(x,y) #define pb(x) push_back(x) #define min(a,b) ( (a) < (b)? (a) : (b) ) #define max(a,b) ( (a) > (b)? (a) : (b) ) #define min3(a,b,c) ( min((a), min((b),(c))) ) #define max3(a,b,c) ( max((a), max((b),(c))) ) #define sig(x) ( (x) == 0 ? 0 : ( (x) < 0 ? -1 : 1 ) ) const double epsilon = 1e-5; template<class T> void unique(std::vector<T>& v) { sort_all(v); v.resize( std::unique(all(v)) - v.begin() ); } ostream& newline(ostream& str) { str.put('\n'); return str; } template<typename T1, typename T2> istream& operator>>(istream& stream, std::pair<T1, T2>& pair) { stream >> pair.first >> pair.second; return stream; } template<typename T1, typename T2> ostream& operator<<(ostream& stream, const std::pair<T1, T2>& pair) { #ifdef DEBUG_MODE stream << "(" << pair.first << ", " << pair.second << ")"; #else stream << pair.first << ' ' << pair.second; #endif return stream; } typedef pair<uint32_pair, uint32_pair> lustro_type; class Application { public: Application() { } void Run() { WczytajDane(); lustro_type result = L[0]; for_range(i, 1, N) { result = maximize(result, L[i]); } rep(i, N) { if(result == L[i]) { cout << "TAK" << newline; return; } } cout << "NIE" << newline; } lustro_type maximize(const lustro_type& a, const lustro_type& b) { return mp( maximize(a.first, b.first), maximize(a.second, b.second) ); } uint32_pair maximize(const uint32_pair& a, const uint32_pair& b) { return mp( min(a.first, b.first), max(a.second, b.second) ); } void WczytajDane() { cin >> N; L.resize(N); rep(i, N) { cin >> L[i]; } } uint32 N; vector<lustro_type> L; }; int main() { ios::sync_with_stdio(0); uint32 t; cin >> t; rep(i, t) { Application application; application.Run(); } 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 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 | //Jakub Staroń #include <iostream> #include <sstream> #include <string> #include <vector> #include <map> #include <set> #include <list> #include <deque> #include <queue> #include <stack> #include <algorithm> #include <cstdlib> #include <cmath> #include <ctime> #include <cstdio> #ifdef COMPILING_HOME #define DEBUG_MODE #define HAVE_NEW_STANDARD #endif #ifdef HAVE_NEW_STANDARD #include <unordered_map> #include <unordered_set> #else #include <tr1/unordered_map> #include <tr1/unordered_set> using namespace std::tr1; #endif #define hash_map unordered_map #define hash_multimap unordered_multimap #define hash_set unordered_set #define hash_multiset unordered_multiset using namespace std; typedef char int8; typedef unsigned char uint8; typedef short int int16; typedef unsigned short int uint16; typedef int int32; typedef unsigned int uint32; typedef long long int64; typedef unsigned long long uint64; typedef std::pair<int32,int32> int32_pair; typedef std::pair<uint32, uint32> uint32_pair; typedef std::pair<int64,int64> int64_pair; typedef std::pair<uint64,uint64> uint64_pair; typedef std::vector<bool> bit_vector; #ifdef HAVE_NEW_STANDARD #define let(a,b) auto a = (b) #else #define let(a,b) __typeof (b) a = (b) #endif #ifdef DEBUG_MODE #define pause system("pause") #define clear_screen system("cls") #define print(x) cerr << #x << " = " << x << endl #define label_print(label, value) cerr << label << ' ' << value << endl #define debug(x) x #define line cerr << "Line " << __LINE__ << endl #include <cassert> #else #define pause #define clear_screen #define print(x) #define label_print(label, value) #define debug(x) #define assert(x) #define line #endif #define rep(i,x) for(uint32 i = 0 ; i < (x) ; i++) #define for_range(i,begin,end) for( let(i, (begin) ) ; i != (end) ; ++i ) #define foreach(i, c) for_range(i, c.begin(), c.end()) #define abs(a) ( (a) < 0 ? -(a) : (a) ) #define all(c) (c).begin(),(c).end() #define sort_all(x) sort( all(x) ) #define divide(a,b) ( ( (b)%(a) ) == 0 ) #define mp(x,y) make_pair(x,y) #define pb(x) push_back(x) #define min(a,b) ( (a) < (b)? (a) : (b) ) #define max(a,b) ( (a) > (b)? (a) : (b) ) #define min3(a,b,c) ( min((a), min((b),(c))) ) #define max3(a,b,c) ( max((a), max((b),(c))) ) #define sig(x) ( (x) == 0 ? 0 : ( (x) < 0 ? -1 : 1 ) ) const double epsilon = 1e-5; template<class T> void unique(std::vector<T>& v) { sort_all(v); v.resize( std::unique(all(v)) - v.begin() ); } ostream& newline(ostream& str) { str.put('\n'); return str; } template<typename T1, typename T2> istream& operator>>(istream& stream, std::pair<T1, T2>& pair) { stream >> pair.first >> pair.second; return stream; } template<typename T1, typename T2> ostream& operator<<(ostream& stream, const std::pair<T1, T2>& pair) { #ifdef DEBUG_MODE stream << "(" << pair.first << ", " << pair.second << ")"; #else stream << pair.first << ' ' << pair.second; #endif return stream; } typedef pair<uint32_pair, uint32_pair> lustro_type; class Application { public: Application() { } void Run() { WczytajDane(); lustro_type result = L[0]; for_range(i, 1, N) { result = maximize(result, L[i]); } rep(i, N) { if(result == L[i]) { cout << "TAK" << newline; return; } } cout << "NIE" << newline; } lustro_type maximize(const lustro_type& a, const lustro_type& b) { return mp( maximize(a.first, b.first), maximize(a.second, b.second) ); } uint32_pair maximize(const uint32_pair& a, const uint32_pair& b) { return mp( min(a.first, b.first), max(a.second, b.second) ); } void WczytajDane() { cin >> N; L.resize(N); rep(i, N) { cin >> L[i]; } } uint32 N; vector<lustro_type> L; }; int main() { ios::sync_with_stdio(0); uint32 t; cin >> t; rep(i, t) { Application application; application.Run(); } return 0; } |