2019 牛客多校第三场 H Magic Line
题目链接:https://ac.nowcoder.com/acm/contest/883/H
题目大意
给定 N 个不同的整数点,N 为偶数,求一条直线,这条直线能把这 N 个点对半分开,输出这条直线经过的两个整点坐标。
分析1
代码如下
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); 5 #define Rep(i,n) for (int i = 0; i < (n); ++i) 6 #define For(i,s,t) for (int i = (s); i <= (t); ++i) 7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i) 8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i) 9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i) 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i) 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i) 12 13 #define pr(x) cout << #x << " = " << x << " " 14 #define prln(x) cout << #x << " = " << x << endl 15 16 #define LOWBIT(x) ((x)&(-x)) 17 18 #define ALL(x) x.begin(),x.end() 19 #define INS(x) inserter(x,x.begin()) 20 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end()) 21 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // ?? x ?????? c 22 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower); 23 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper); 24 25 #define ms0(a) memset(a,0,sizeof(a)) 26 #define msI(a) memset(a,inf,sizeof(a)) 27 #define msM(a) memset(a,-1,sizeof(a)) 28 29 #define MP make_pair 30 #define PB push_back 31 #define ft first 32 #define sd second 33 34 template<typename T1, typename T2> 35 istream &operator>>(istream &in, pair<T1, T2> &p) { 36 in >> p.first >> p.second; 37 return in; 38 } 39 40 template<typename T> 41 istream &operator>>(istream &in, vector<T> &v) { 42 for (auto &x: v) 43 in >> x; 44 return in; 45 } 46 47 template<typename T> 48 ostream &operator<<(ostream &out, vector<T> &v) { 49 Rep(i, v.size()) out << v[i] << " \n"[i == v.size()]; 50 return out; 51 } 52 53 template<typename T1, typename T2> 54 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) { 55 out << "[" << p.first << ", " << p.second << "]" << "\n"; 56 return out; 57 } 58 59 inline int gc(){ 60 static const int BUF = 1e7; 61 static char buf[BUF], *bg = buf + BUF, *ed = bg; 62 63 if(bg == ed) fread(bg = buf, 1, BUF, stdin); 64 return *bg++; 65 } 66 67 inline int ri(){ 68 int x = 0, f = 1, c = gc(); 69 for(; c<48||c>57; f = c=='-'?-1:f, c=gc()); 70 for(; c>47&&c<58; x = x*10 + c - 48, c=gc()); 71 return x*f; 72 } 73 74 template<class T> 75 inline string toString(T x) { 76 ostringstream sout; 77 sout << x; 78 return sout.str(); 79 } 80 81 inline int toInt(string s) { 82 int v; 83 istringstream sin(s); 84 sin >> v; 85 return v; 86 } 87 88 //min <= aim <= max 89 template<typename T> 90 inline bool BETWEEN(const T aim, const T min, const T max) { 91 return min <= aim && aim <= max; 92 } 93 94 typedef long long LL; 95 typedef unsigned long long uLL; 96 typedef pair< double, double > PDD; 97 typedef pair< int, int > PII; 98 typedef pair< int, PII > PIPII; 99 typedef pair< string, int > PSI; 100 typedef pair< int, PSI > PIPSI; 101 typedef set< int > SI; 102 typedef set< PII > SPII; 103 typedef vector< int > VI; 104 typedef vector< double > VD; 105 typedef vector< VI > VVI; 106 typedef vector< SI > VSI; 107 typedef vector< PII > VPII; 108 typedef map< int, int > MII; 109 typedef map< int, string > MIS; 110 typedef map< int, PII > MIPII; 111 typedef map< PII, int > MPIII; 112 typedef map< string, int > MSI; 113 typedef map< string, string > MSS; 114 typedef map< PII, string > MPIIS; 115 typedef map< PII, PII > MPIIPII; 116 typedef multimap< int, int > MMII; 117 typedef multimap< string, int > MMSI; 118 //typedef unordered_map< int, int > uMII; 119 typedef pair< LL, LL > PLL; 120 typedef vector< LL > VL; 121 typedef vector< VL > VVL; 122 typedef priority_queue< int > PQIMax; 123 typedef priority_queue< int, VI, greater< int > > PQIMin; 124 const double EPS = 1e-8; 125 const LL inf = 0x7fffffff; 126 const LL infLL = 0x7fffffffffffffffLL; 127 const LL mod = 1e9 + 7; 128 const int maxN = 1e3 + 7; 129 const LL ONE = 1; 130 const LL evenBits = 0xaaaaaaaaaaaaaaaa; 131 const LL oddBits = 0x5555555555555555; 132 133 template<typename T> 134 struct Point{ 135 T X,Y; 136 Point< T >(T x = 0,T y = 0) : X(x), Y(y) {} 137 inline T setXY(T x, T y) { return X = x, Y = y; } 138 139 inline bool operator== (const Point<T>& x) const { return X == x.X && Y == x.Y; } 140 inline bool operator< (const Point<T>& x) const { 141 if(Y == x.Y)return X < x.X; 142 return Y < x.Y; 143 } 144 inline bool operator> (const Point<T>& x)const{return x < *this;} 145 146 inline Point<T> operator* (const T& k) { return Point<T>(k*X, k*Y); } 147 inline Point<T> operator/ (const T& k) { return Point<T>(X/k, Y/k); } 148 inline Point<T> operator+ (const Point<T>& x) { return Point<T>(X+x.X,Y+x.Y); } 149 inline Point<T> operator- (const Point<T>& x) { return Point<T>(X-x.X,Y-x.Y); } 150 151 T operator^(const Point<T> &x) const { return X*x.Y - Y*x.X; } 152 T operator*(const Point<T> &x) const { return X*x.X + Y*x.Y; } 153 }; 154 155 template<typename T> 156 istream &operator>> (istream &in, Point<T> &x) { 157 in >> x.X >> x.Y; 158 return in; 159 } 160 161 template<typename T> 162 ostream &operator<< (ostream &out, const Point<T> &x) { 163 out << "(" << x.X << ", " << x.Y << ")" << endl; 164 return out; 165 } 166 167 int T, N; 168 Point< LL > p[maxN]; 169 Point< LL > a(-179981887, -279985319), b; 170 171 inline bool cmp(const Point< LL > &x, const Point< LL > &y) { 172 return ((a - x) ^ (a - y)) > 0; 173 } 174 175 int main(){ 176 //freopen("MyOutput.txt","w",stdout); 177 //freopen("input.txt","r",stdin); 178 //INIT(); 179 scanf("%d", &T); 180 while(T--) { 181 scanf("%d", &N); 182 For(i, 1, N) cin >> p[i]; 183 sort(p + 1, p + 1 + N, cmp); 184 185 Point< LL > b = a * 3 - (p[N >> 1] + p[(N >> 1) + 1]); 186 187 printf("%lld %lld %lld %lld\n", a.X, a.Y, b.X, b.Y); 188 } 189 return 0; 190 }
View Code
分析2(正解)
代码如下
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); 5 #define Rep(i,n) for (int i = 0; i < (n); ++i) 6 #define For(i,s,t) for (int i = (s); i <= (t); ++i) 7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i) 8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i) 9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i) 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i) 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i) 12 13 #define pr(x) cout << #x << " = " << x << " " 14 #define prln(x) cout << #x << " = " << x << endl 15 16 #define LOWBIT(x) ((x)&(-x)) 17 18 #define ALL(x) x.begin(),x.end() 19 #define INS(x) inserter(x,x.begin()) 20 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end()) 21 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // ?? x ?????? c 22 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower); 23 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper); 24 25 #define ms0(a) memset(a,0,sizeof(a)) 26 #define msI(a) memset(a,inf,sizeof(a)) 27 #define msM(a) memset(a,-1,sizeof(a)) 28 29 #define MP make_pair 30 #define PB push_back 31 #define ft first 32 #define sd second 33 34 template<typename T1, typename T2> 35 istream &operator>>(istream &in, pair<T1, T2> &p) { 36 in >> p.first >> p.second; 37 return in; 38 } 39 40 template<typename T> 41 istream &operator>>(istream &in, vector<T> &v) { 42 for (auto &x: v) 43 in >> x; 44 return in; 45 } 46 47 template<typename T> 48 ostream &operator<<(ostream &out, vector<T> &v) { 49 Rep(i, v.size()) out << v[i] << " \n"[i == v.size()]; 50 return out; 51 } 52 53 template<typename T1, typename T2> 54 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) { 55 out << "[" << p.first << ", " << p.second << "]" << "\n"; 56 return out; 57 } 58 59 inline int gc(){ 60 static const int BUF = 1e7; 61 static char buf[BUF], *bg = buf + BUF, *ed = bg; 62 63 if(bg == ed) fread(bg = buf, 1, BUF, stdin); 64 return *bg++; 65 } 66 67 inline int ri(){ 68 int x = 0, f = 1, c = gc(); 69 for(; c<48||c>57; f = c=='-'?-1:f, c=gc()); 70 for(; c>47&&c<58; x = x*10 + c - 48, c=gc()); 71 return x*f; 72 } 73 74 template<class T> 75 inline string toString(T x) { 76 ostringstream sout; 77 sout << x; 78 return sout.str(); 79 } 80 81 inline int toInt(string s) { 82 int v; 83 istringstream sin(s); 84 sin >> v; 85 return v; 86 } 87 88 //min <= aim <= max 89 template<typename T> 90 inline bool BETWEEN(const T aim, const T min, const T max) { 91 return min <= aim && aim <= max; 92 } 93 94 typedef long long LL; 95 typedef unsigned long long uLL; 96 typedef pair< double, double > PDD; 97 typedef pair< int, int > PII; 98 typedef pair< int, PII > PIPII; 99 typedef pair< string, int > PSI; 100 typedef pair< int, PSI > PIPSI; 101 typedef set< int > SI; 102 typedef set< PII > SPII; 103 typedef vector< int > VI; 104 typedef vector< double > VD; 105 typedef vector< VI > VVI; 106 typedef vector< SI > VSI; 107 typedef vector< PII > VPII; 108 typedef map< int, int > MII; 109 typedef map< int, string > MIS; 110 typedef map< int, PII > MIPII; 111 typedef map< PII, int > MPIII; 112 typedef map< string, int > MSI; 113 typedef map< string, string > MSS; 114 typedef map< PII, string > MPIIS; 115 typedef map< PII, PII > MPIIPII; 116 typedef multimap< int, int > MMII; 117 typedef multimap< string, int > MMSI; 118 //typedef unordered_map< int, int > uMII; 119 typedef pair< LL, LL > PLL; 120 typedef vector< LL > VL; 121 typedef vector< VL > VVL; 122 typedef priority_queue< int > PQIMax; 123 typedef priority_queue< int, VI, greater< int > > PQIMin; 124 const double EPS = 1e-8; 125 const LL inf = 0x7fffffff; 126 const LL infLL = 0x7fffffffffffffffLL; 127 const LL mod = 1e9 + 7; 128 const int maxN = 1e3 + 7; 129 const LL ONE = 1; 130 const LL evenBits = 0xaaaaaaaaaaaaaaaa; 131 const LL oddBits = 0x5555555555555555; 132 133 template<typename T> 134 struct Point{ 135 T X,Y; 136 Point< T >(T x = 0,T y = 0) : X(x), Y(y) {} 137 inline T setXY(T x, T y) { return X = x, Y = y; } 138 139 inline bool operator== (const Point<T>& x) const { return X == x.X && Y == x.Y; } 140 inline bool operator< (const Point<T>& x) const { 141 if(X == x.X) return Y < x.Y; 142 return X < x.X; 143 } 144 inline bool operator> (const Point<T>& x)const{return x < *this;} 145 146 inline Point<T> operator* (const T& k) { return Point<T>(k*X, k*Y); } 147 inline Point<T> operator/ (const T& k) { return Point<T>(X/k, Y/k); } 148 inline Point<T> operator+ (const Point<T>& x) { return Point<T>(X+x.X,Y+x.Y); } 149 inline Point<T> operator- (const Point<T>& x) { return Point<T>(X-x.X,Y-x.Y); } 150 151 T operator^(const Point<T> &x) const { return X*x.Y - Y*x.X; } 152 T operator*(const Point<T> &x) const { return X*x.X + Y*x.Y; } 153 }; 154 155 template<typename T> 156 istream &operator>> (istream &in, Point<T> &x) { 157 in >> x.X >> x.Y; 158 return in; 159 } 160 161 template<typename T> 162 ostream &operator<< (ostream &out, const Point<T> &x) { 163 out << "(" << x.X << ", " << x.Y << ")" << endl; 164 return out; 165 } 166 167 int T, N; 168 Point< int > p[maxN]; 169 170 int main(){ 171 //freopen("MyOutput.txt","w",stdout); 172 //freopen("input.txt","r",stdin); 173 //INIT(); 174 scanf("%d", &T); 175 while(T--) { 176 scanf("%d", &N); 177 For(i, 1, N) cin >> p[i]; 178 sort(p + 1, p + 1 + N); 179 180 printf("%d %d %d %d\n", p[N >> 1].X - 1, p[N >> 1].Y + (int)1e8, p[(N >> 1) + 1].X + 1, p[(N >> 1) + 1].Y - (int)1e8); 181 } 182 return 0; 183 }
View Code
转载于:https://www.cnblogs.com/zaq19970105/p/11246403.html
2019 牛客多校第三场 H Magic Line相关推荐
- 2019牛客多校训练营第一场 H题 HOR 题解
题目描述: 输入描述: 输出描述: 示例1: 题解: 更多问题可关注牛客竞赛区,一个刷题.比赛.分享的社区. 传送门:https://ac.nowcoder.com/acm/contest/discu ...
- 2019牛客多校第三场 F.Planting Trees
题目链接 题目链接 题解 题面上面很明显的提示了需要严格\(O(n^3)\)的算法. 先考虑一个过不了的做法,枚举右下角的\((x,y)\),然后二分矩形面积,枚举其中一边,则复杂度是\(O(n^3 ...
- 2019 牛客多校第三场 B Crazy Binary String
题目链接:https://ac.nowcoder.com/acm/contest/883/B 题目大意 给定一个长度为 N 的 01 字符串,输出最长子串和子序列的长度,满足其中 0 和 1 的个数相 ...
- 24dian(牛客多校第三场)
24dian(牛客多校第三场) 题意: 给你n张牌,每张牌的大小为1 ~ 13,问这些牌与加减乘除任意组合(可以使用括号),且但所有的有效解在计算过程中都涉及到分数,即非整数,能否组成答案m,如果可以 ...
- 牛客多校第三场 B【Classical String Problem】
牛客多校第三场 B[Classical String Problem] 链接:https://ac.nowcoder.com/acm/contest/5668/B 来源:牛客网 题目描述 Given ...
- 2019牛客多校第四场 I题 后缀自动机_后缀数组_求两个串de公共子串的种类数
目录 求若干个串的公共子串个数相关变形题 对一个串建后缀自动机,另一个串在上面跑同时计数 广义后缀自动机 后缀数组 其他:POJ 3415 求两个串长度至少为k的公共子串数量 @(牛客多校第四场 I题 ...
- 2019牛客多校 第七场 B Irreducible Polynomial 多项式因式分解判断
链接:https://ac.nowcoder.com/acm/contest/887/B 来源:牛客网 Irreducible Polynomial 时间限制:C/C++ 1秒,其他语言2秒 空间限制 ...
- 2019牛客多校训练营第一场 E题 ABBA 题解
问题描述: 输入描述: 输出描述: 示例1: 题解: 更多问题可关注牛客竞赛区,一个刷题.比赛.分享的社区. 传送门:https://ac.nowcoder.com/acm/contest/discu ...
- 2019牛客多校第七场 C Governing sand
因为当时时间不怎么够就没写... 其实就是一个模拟题而已下面注释很清楚 链接:https://ac.nowcoder.com/acm/contest/887/C 来源:牛客网 时间限制:C/C++ 3 ...
- 牛客多校第三场A【Clam and fish】贪心
A[Clam and fish]贪心 链接:https://ac.nowcoder.com/acm/contest/5668/A 来源:牛客网 题目: There is a fishing game ...
最新文章
- UE4蓝图无代码编程游戏开发技能学习教程
- 【c语言】判断是否为友好数
- 数据结构-算法: 分配排序(基数分配排序法)
- Pandas数据处理实战:福布斯全球上市企业排行榜数据整理
- SQL语言之DDL语言学习-----数据定义语言学习
- POJ-3067 Japan(树状数组、线段树)
- windows隐藏python运行时的终端
- 04 理解SQL与T-SQL的概念测试分析 1214
- python必背入门代码-初学Python必背手册
- 线上IIS应用程序池自动关闭
- Spring中@Autowired注解的工作原理
- NPDP认证怎么考?有用吗?
- 计算机怎么改鼠标标志,图文帮你如何自定义电脑鼠标指针的图标
- JS基础—选项卡套选项卡(函数传参)
- 【转】Ogre 1.7版本重大改进by 诡辩
- Exception evaluating SpringEL expression
- 【python】详解multiprocessing多进程-Pool进程池模块(二)
- 项目管理-挣值分析方法学习总结
- 大开眼界的4款电脑软件,其中3款大小不到10M,功能却逆天
- 在javascript中 setInterval()、clearInterval()、clearTimeout()等等常用的函数的含义