oj.uz

Submission #57612

# Submission time Handle Problem Language Result Execution time Memory
57612 2018-07-15T12:29:31 Z red1108 None (KOI16_dist) C++17
100 / 100
 1348 ms 13216 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
struct star{
    ll xx,yy,dx,dy;
}input[30010];
ll n,maxday,top;
struct nowstar{
    ll x, y;
}now[30010],st[30010];
ll cross(ll a, ll b, ll c, ll d){return a*d-b*c;}
bool ccmp(nowstar A, nowstar B)
{
    if(A.x==B.x) return A.y<B.y;
    return A.x<B.x;
}
bool rcmp(nowstar A, nowstar B)
{
    if(cross(A.x-now[1].x,A.y-now[1].y,B.x-now[1].x,B.y-now[1].y)==0)
    {
        if (A.x==B.x) return A.y<B.y;
        return A.x<B.x;
    }
    return cross(A.x-now[1].x,A.y-now[1].y,B.x-now[1].x,B.y-now[1].y)>0;
}
ll dist(nowstar A, nowstar B){return (B.x-A.x)*(B.x-A.x)+(B.y-A.y)*(B.y-A.y);}
ll maxdis(ll day)
{
    ll i,j,ret=0,top=0;
    for(i=1;i<=n;i++)
    {
        now[i].x=input[i].xx+input[i].dx*day;
        now[i].y=input[i].yy+input[i].dy*day;
    }
    sort(now+1,now+n+1,ccmp);
    sort(now+2,now+n+1,rcmp);
    st[top++]=now[1];
    st[top++]=now[2];
    for(i=3;i<=n;i++)
    {
        if(now[i].x==now[i-1].x&&now[i].y==now[i-1].y) continue;
        while(top>=2&&cross(st[top-1].x-st[top-2].x,st[top-1].y-st[top-2].y,now[i].x-st[top-1].x,now[i].y-st[top-1].y)<=0) top--;
        st[top++]=now[i];
    }
    for(i=0,j=0;i<top;i++)
    {
        if(i==j) j=(j+1)%top;
        int ni=(i+1)%top,nj=(j+1)%top;
        while(cross(st[ni].x-st[i].x,st[ni].y-st[i].y,st[nj].x-st[j].x,st[nj].y-st[j].y)>0){nj=(nj+1)%top,j=(j+1)%top;}
        ret=max(ret,dist(st[i],st[j]));
    }
    return ret;
}
int main()
{
    ll i;
    scanf("%lld %lld",&n, &maxday);
    for(i=1;i<=n;i++)
    {
        scanf("%lld %lld %lld %lld", &input[i].xx, &input[i].yy, &input[i].dx, &input[i].dy);
    }
    ll l=0, r=maxday, x1, x2,ci=50;
    while(ci--&&l+1<r)
    {
        x1=((ll)2*l+r)/3;
        x2=((ll)2*r+l)/3;
        if(maxdis(x1)>maxdis(x2)) l=x1;
        else r=x2;
    }
    ll ans1=maxdis(l),ans2=l;
    for(i=l+1;i<=r;i++)
    {
        if(maxdis(i)<ans1)
        {
            ans1=maxdis(i);
            ans2=i;
        }
    }
    printf("%lld\n%lld", ans2,ans1);
}

Compilation message

dist.cpp: In function 'int main()':
dist.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld",&n, &maxday);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dist.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld %lld %lld", &input[i].xx, &input[i].yy, &input[i].dx, &input[i].dy);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 3 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 576 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 3 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 28 ms 652 KB Output is correct
12 Correct 25 ms 652 KB Output is correct
13 Correct 22 ms 652 KB Output is correct
14 Correct 22 ms 652 KB Output is correct
15 Correct 19 ms 652 KB Output is correct
16 Correct 39 ms 652 KB Output is correct
17 Correct 17 ms 800 KB Output is correct
18 Correct 11 ms 800 KB Output is correct
19 Correct 22 ms 800 KB Output is correct
20 Correct 22 ms 844 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 948 ms 2260 KB Output is correct
2 Correct 836 ms 2260 KB Output is correct
3 Correct 964 ms 2260 KB Output is correct
4 Correct 161 ms 2712 KB Output is correct
5 Correct 783 ms 2712 KB Output is correct
6 Correct 1348 ms 3300 KB Output is correct
7 Correct 676 ms 3300 KB Output is correct
8 Correct 451 ms 3640 KB Output is correct
9 Correct 972 ms 4784 KB Output is correct
10 Correct 860 ms 4956 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 520 KB Output is correct
7 Correct 3 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 28 ms 652 KB Output is correct
12 Correct 25 ms 652 KB Output is correct
13 Correct 22 ms 652 KB Output is correct
14 Correct 22 ms 652 KB Output is correct
15 Correct 19 ms 652 KB Output is correct
16 Correct 39 ms 652 KB Output is correct
17 Correct 17 ms 800 KB Output is correct
18 Correct 11 ms 800 KB Output is correct
19 Correct 22 ms 800 KB Output is correct
20 Correct 22 ms 844 KB Output is correct
21 Correct 948 ms 2260 KB Output is correct
22 Correct 836 ms 2260 KB Output is correct
23 Correct 964 ms 2260 KB Output is correct
24 Correct 161 ms 2712 KB Output is correct
25 Correct 783 ms 2712 KB Output is correct
26 Correct 1348 ms 3300 KB Output is correct
27 Correct 676 ms 3300 KB Output is correct
28 Correct 451 ms 3640 KB Output is correct
29 Correct 972 ms 4784 KB Output is correct
30 Correct 860 ms 4956 KB Output is correct
31 Correct 899 ms 5644 KB Output is correct
32 Correct 925 ms 6184 KB Output is correct
33 Correct 922 ms 6724 KB Output is correct
34 Correct 993 ms 7368 KB Output is correct
35 Correct 725 ms 8160 KB Output is correct
36 Correct 952 ms 9176 KB Output is correct
37 Correct 613 ms 9280 KB Output is correct
38 Correct 486 ms 9928 KB Output is correct
39 Correct 900 ms 10680 KB Output is correct
40 Correct 900 ms 11336 KB Output is correct
41 Correct 727 ms 12440 KB Output is correct
42 Correct 906 ms 13216 KB Output is correct