oj.uz

답안 #886457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886457 2023-12-12T07:48:10 Z HuyQuang_re_Zero Shortcut (IOI16_shortcut) C++14
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define IDB pair <db,int>
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
using namespace std;
#include "shortcut.h"
ll n,c,i,j,u,v,x[1000005],h[1000005],tight1,tight2,tight3,tight4;
II mx_sum1,mx_sum2,mx_sub1,mx_sub2;
const ll oo=round(1e18);
ll Add_edge(int u,int v)
{

}
bool check(ll k)
{
    if(k==tight3) return 1;
    tight1=tight2=-1e18;
    for(i=1;i<=n;i++)
    {
        if(mx_sum2.snd!=i) j=mx_sum2.snd; else j=mx_sum1.snd;
        if(h[j]+x[j]+h[i]-x[i]<=k) continue;
        tight1=max(tight1,h[j]+x[j]+h[i]+x[i]);
    }
    for(j=1;j<=n;j++)
    {
        if(mx_sub2.snd!=j) i=mx_sub2.snd; else i=mx_sub1.snd;
        if(h[j]+x[j]+h[i]-x[i]<=k) continue;
        tight2=max(tight2,h[j]-x[j]+h[i]-x[i]);
    }
    ll l=n+1,r=0,opt=oo;
    for(i=1;i<=n;i++)
    {
        while(l>1 && x[l-1]>=-x[i]-k+c+tight1) l--;
        while(r<n && x[r+1]<=min(k-c-tight2-x[i],k-c-tight3+x[i])) r++;
        while(r>0 && x[r]>min(k-c-tight2-x[i],k-c-tight3+x[i])) r--;
        if(l>r || l>i) continue;
        ll j=min(r,i);
        if(opt>x[i]-x[j])
        {
            opt=x[i]-x[j];
            u=j; v=i;
        }
    }
    if(opt==oo) return 0;
    return Add_edge(u,v)<=k;
}
ll find_shortcut(int _n,vector <int> len,vector <int> d,int _c)
{
    n=_n; c=_c;
    ll dis=0;
    for(i=0;i<len.size();i++) x[i+1]=dis,dis+=len[i];
    x[n]=dis;
    for(i=0;i<d.size();i++) h[i+1]=d[i];
    mx_sum1=mx_sum2=mx_sub1=mx_sub2={ -oo,0 };
    for(i=1;i<=n;i++)
    {
        if(mx_sum1.fst<h[i]+x[i]) mx_sum1={ h[i]+x[i],i };
        if(mx_sum1.fst>mx_sum2.fst) swap(mx_sum1,mx_sum2);
        if(mx_sub1.fst<h[i]-x[i]) mx_sub1={ h[i]-x[i],i };
        if(mx_sub1.fst>mx_sub2.fst) swap(mx_sub1,mx_sub2);
    }
    ll ma=-1e18;
    for(i=1;i<=n;i++)
    {
        tight3=max(tight3,h[i]+x[i]+ma);
        ma=max(ma,h[i]-x[i]);
    }
    ll l=0,r=tight3;
    while(l<r)
    {
        ll mid=(l+r)>>1;
        if(check(mid)) r=mid; else l=mid+1;
    }
    return l;
}

/*
int main()
{
    freopen("shortcut.inp","r",stdin);
    freopen("shortcut.out","w",stdout);
    int n,c,x;
    vector <int> l,d;
    cin>>n>>c;
    for(i=1;i<n;i++) cin>>x,l.push_back(x);
    for(i=1;i<=n;i++) cin>>x,d.push_back(x);
    cout<<find_shortcut(n,l,d,c);
}
*/

Compilation message

shortcut.cpp: In function 'long long int Add_edge(int, int)':
shortcut.cpp:25:1: warning: no return statement in function returning non-void [-Wreturn-type]
   25 | }
      | ^
shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:63:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(i=0;i<len.size();i++) x[i+1]=dis,dis+=len[i];
      |             ~^~~~~~~~~~~
shortcut.cpp:65:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(i=0;i<d.size();i++) h[i+1]=d[i];
      |             ~^~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -