oj.uz

답안 #197020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197020 2020-01-18T06:37:09 Z dennisstar 먼 별 (KOI16_dist) C++11
100 / 100
 548 ms 4596 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define eb emplace_back
#define all(V) (V).begin(), (V).end()
#define unq(V) (V).erase(unique(all(V)), (V).end())
#define fastio ios::sync_with_stdio(false); cin.tie(0)
using namespace std;
typedef long long ll;
typedef vector<ll> vlm;
typedef vector<int> vim;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

int N, T;
ll x[30010], y[30010], dx[30010], dy[30010];

pll operator -(pll p1, pll p2) { return pll(p1.fi-p2.fi, p1.se-p2.se); }

int ccw(pll v1, pll v2) {
	if (v1.fi*v2.se-v1.se*v2.fi > 0) return 1; //ccw
	else if (v1.fi*v2.se-v1.se*v2.fi < 0) return -1; //cw
	else return 0; //collinear
}
int ccw1(pll p1, pll p2, pll p3) { return ccw(p2-p1, p3-p1); }
int ccw2(pll p1, pll p2, pll p3, pll p4) { return ccw(p2-p1, p4-p3); }
ll sq(ll k) { return k*k; }

vector<pll> make_ch(vector<pll> P) { //convex hull
	sort(all(P)); unq(P);
	vector<pll> ch;
	for (auto &i:P) {
		while (ch.size()>1 && ccw1(ch[ch.size()-2], ch.back(), i)!=1) ch.pop_back();
		ch.eb(i);
	}
	reverse(all(P)); int tp=ch.size();
	for (auto &i:P) {
		while (tp<ch.size() && ccw1(ch[ch.size()-2], ch.back(), i)!=1) ch.pop_back();
		ch.eb(i);
	}
	ch.pop_back();
	return ch;
}

ll dist(vector<pll> P) {
	P=make_ch(P); ll ret=sq(P[0].fi-P[1].fi)+sq(P[0].se-P[1].se);
	for (int i=0, j=1; i<P.size(); i++) {
		if (i==j) j++;
		while (ccw2(P[i], P[(i+1)%P.size()], P[j], P[(j+1)%P.size()])==1) j=(j+1)%P.size();
		ret=max(ret, sq(P[i].fi-P[j].fi)+sq(P[i].se-P[j].se));
	}
	return ret;
}

ll solve(int t) {
	vector<pll> P;
	for (int i=1; i<=N; i++) P.eb(x[i]+dx[i]*t, y[i]+dy[i]*t);
	return dist(P);
}

int main() {
	scanf("%d %d", &N, &T);
	for (int i=1; i<=N; i++) scanf("%lld %lld %lld %lld", &x[i], &y[i], &dx[i], &dy[i]);
	vector<pll> p;
	int s=0, e=T, mi=0;
	while (s<e-10) {
		int m1=(s*2+e)/3, m2=(s+e*2)/3;
		ll r1=solve(m1), r2=solve(m2);
		if (r1>r2) s=m1;
		else e=m2;
	}
	pll ans=pll((1ll<<60), (1ll<<60));
	for (int i=s; i<=e; i++) ans=min(ans, pll(solve(i), (ll)i));
	printf("%lld\n%lld\n", ans.se, ans.fi);
	return 0;
}

Compilation message

dist.cpp: In function 'std::vector<std::pair<long long int, long long int> > make_ch(std::vector<std::pair<long long int, long long int> >)':
dist.cpp:39:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (tp<ch.size() && ccw1(ch[ch.size()-2], ch.back(), i)!=1) ch.pop_back();
          ~~^~~~~~~~~~
dist.cpp: In function 'll dist(std::vector<std::pair<long long int, long long int> >)':
dist.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0, j=1; i<P.size(); i++) {
                     ~^~~~~~~~~
dist.cpp: In function 'int main()':
dist.cpp:66:16: warning: unused variable 'mi' [-Wunused-variable]
  int s=0, e=T, mi=0;
                ^~
dist.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &T);
  ~~~~~^~~~~~~~~~~~~~~~~
dist.cpp:64:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1; i<=N; i++) scanf("%lld %lld %lld %lld", &x[i], &y[i], &dx[i], &dy[i]);
                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2 ms 380 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2 ms 380 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 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 Correct 12 ms 632 KB Output is correct
12 Correct 21 ms 504 KB Output is correct
13 Correct 10 ms 504 KB Output is correct
14 Correct 12 ms 504 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 508 KB Output is correct
19 Correct 9 ms 376 KB Output is correct
20 Correct 12 ms 376 KB Output is correct

Subtask #3
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 2876 KB Output is correct
2 Correct 86 ms 3308 KB Output is correct
3 Correct 85 ms 3440 KB Output is correct
4 Correct 111 ms 4368 KB Output is correct
5 Correct 67 ms 3568 KB Output is correct
6 Correct 107 ms 4416 KB Output is correct
7 Correct 43 ms 3356 KB Output is correct
8 Correct 40 ms 3180 KB Output is correct
9 Correct 90 ms 4348 KB Output is correct
10 Correct 86 ms 3496 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2 ms 380 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 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 Correct 12 ms 632 KB Output is correct
12 Correct 21 ms 504 KB Output is correct
13 Correct 10 ms 504 KB Output is correct
14 Correct 12 ms 504 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 508 KB Output is correct
19 Correct 9 ms 376 KB Output is correct
20 Correct 12 ms 376 KB Output is correct
21 Correct 91 ms 2876 KB Output is correct
22 Correct 86 ms 3308 KB Output is correct
23 Correct 85 ms 3440 KB Output is correct
24 Correct 111 ms 4368 KB Output is correct
25 Correct 67 ms 3568 KB Output is correct
26 Correct 107 ms 4416 KB Output is correct
27 Correct 43 ms 3356 KB Output is correct
28 Correct 40 ms 3180 KB Output is correct
29 Correct 90 ms 4348 KB Output is correct
30 Correct 86 ms 3496 KB Output is correct
31 Correct 379 ms 3596 KB Output is correct
32 Correct 388 ms 3480 KB Output is correct
33 Correct 381 ms 3456 KB Output is correct
34 Correct 393 ms 3600 KB Output is correct
35 Correct 326 ms 3568 KB Output is correct
36 Correct 548 ms 4524 KB Output is correct
37 Correct 185 ms 3568 KB Output is correct
38 Correct 156 ms 3568 KB Output is correct
39 Correct 263 ms 3568 KB Output is correct
40 Correct 382 ms 3584 KB Output is correct
41 Correct 540 ms 4596 KB Output is correct
42 Correct 381 ms 4424 KB Output is correct