| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 153225 |
2019-09-13T01:23:17 Z |
gs18103 |
None (KOI16_dist) |
C++14 |
|
218 ms |
2400 KB |
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pll;
ll arr[30303][4];
pll base;
int n, T;
ll ccw(pll a, pll b, pll c) {
return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
ll dis(pll a, pll b) {
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
ll cal_dis(int t) {
vector <pll> p, ch;
for(int i = 0; i < n; i++) {
p.emplace_back(arr[i][0] + arr[i][2] * (ll)t, arr[i][1] + arr[i][3] * (ll)t);
}
sort(all(p));
p.erase(unique(all(p)), p.end());
base = p[0];
sort(p.begin()+1, p.end(), [](pll a, pll b) {
if(ccw(base, a, b) == 0) return dis(base, a) < dis(base, b);
return ccw(base, a, b) > 0;
});
ch.push_back(base);
for(int i = 1; i < p.size(); i++) {
while(ch.size() >= 2) {
pll p1 = ch[ch.size()-2], p2 = ch[ch.size()-1];
if(ccw(p1, p2, p[i]) > 0) break;
ch.pop_back();
}
ch.push_back(p[i]);
}
int idx = 0;
while(idx+1 < ch.size() && ch[idx].x < ch[idx+1].x) idx++;
ll ret = 0;
for(int i = 0; i+1 < ch.size(); i++) {
while(idx+1 < ch.size()) {
if((double)(ch[idx+1].y-ch[idx].y)/(ch[idx+1].x-ch[idx].x) >
(double)(ch[i+1].y-ch[i].y)/(ch[i+1].x-ch[i].x)) break;
idx++;
}
ret = max(ret, dis(ch[i], ch[idx]));
}
return ret;
}
int search(int s, int e) {
if(s + 10 >= e) {
ll dis = 9000000000000000000LL;
for(int i = s; i <= e; i++) {
dis = min(dis, cal_dis(i));
}
for(int i = s; i <= e; i++) {
if(dis == cal_dis(i)) return i;
}
}
int t1 = (2 * s + e) / 3, t2 = (s + 2 * e) / 3;
ll dis1 = cal_dis(t1), dis2 = cal_dis(t2);
if(dis1 <= dis2) return search(s, t2);
else return search(t1, e);
}
int main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> T;
for(int i = 0; i < n; i++) {
for(int j = 0; j < 4; j++) {
cin >> arr[i][j];
}
}
int ans = search(0, T);
cout << ans << '\n' << cal_dis(ans);
}
Compilation message
dist.cpp: In function 'll cal_dis(int)':
dist.cpp:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < p.size(); i++) {
~~^~~~~~~~~~
dist.cpp:45:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(idx+1 < ch.size() && ch[idx].x < ch[idx+1].x) idx++;
~~~~~~^~~~~~~~~~~
dist.cpp:47:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i+1 < ch.size(); i++) {
~~~~^~~~~~~~~~~
dist.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(idx+1 < ch.size()) {
~~~~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
252 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
380 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
252 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
380 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Incorrect |
16 ms |
504 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
218 ms |
2320 KB |
Output is correct |
| 2 |
Incorrect |
136 ms |
2400 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
252 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
380 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Incorrect |
16 ms |
504 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
