Submission #66537

#	Time	Username	Problem	Language	Result	Execution time	Memory
66537		MANcity	Shortcut (IOI16_shortcut)	C++14	0 / 100	2 ms	376 KiB

shortcut

#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<cstring>
#include<vector>
#include "shortcut.h"
using namespace std;
#define for1(i,n) for(int i=1;i<=(int)n;i++)
#define for0(i,n) for(int i=0;i<=(int)n;i++)
#define forn(i,n) for(int i=n;i>=1;i--)
#define fo(i,x,y) for(int i=x;i<=(int)y;i++)
#define fr(i,x,y) for(int i=x;i>=(int)y;i--)
#define pb push_back
#define mp make_pair
#define LL long long
const LL Mod=1000*1000*1000+7;
int n;
LL d[10002];
LL x[10002];
LL c;
struct req
{
    LL x;
    LL y;
    LL k;
};
int stug(LL k)
{
    vector<req> V;
    for1(i,n)
    {
        fo(j,i+1,n)
        {
            if(abs(x[i]-x[j])+d[i]+d[j]>k)
            {
                if((k-d[i]-d[j]-c)<0)
                    return 0;
                req t;
                t.x=x[i];
                t.y=x[j];
                t.k=k-d[i]-d[j]-c;
                V.push_back(t);
            }
        }
    }
    int R=V.size();
    if(R==0)
        return 1;
    vector<pair<LL,LL> > G;
    vector<pair<LL,LL> > E;
    for0(i,V.size()-1)
    {
        LL e=(V[i].x-V[i].k)-V[i].y;
        LL u=(V[i].x+V[i].k)-V[i].y;
        G.pb(mp(e,-1));
        G.pb(mp(u,1));
        e=V[i].y+V[i].k+V[i].x;
        u=V[i].y-V[i].k+V[i].x;
        E.pb(mp(u,-1));
        E.pb(mp(e,1));
    }
    sort(G.begin(),G.end());
    LL S=0;
    LL u=0;
    LL l1;
    LL l2;
    for0(i,G.size()-1)
    {
        S-=G[i].second;
        if(S==R)
        {
          u=1;
          l1=G[i].first;
          break;
        }
    }
    if(u==0)
        return 0;
    S=0;
    forn(i,G.size()-1)
    {
        S+=G[i].second;
        if(S==R)
        {
            l2=G[i].first;
            break;
        }
    }
    sort(E.begin(),E.end());
    S=0;
    u=0;
    LL r1;
    LL r2;
    for0(i,E.size()-1)
    {
        S-=E[i].second;
        if(S==R)
        {
            u=1;
            r1=E[i].first;
            break;
        }
    }
    if(u==0)
        return 0;
    forn(i,E.size()-1)
    {
        S+=E[i].second;
        if(S==R)
        {
            r2=E[i].first;
            break;
        }
    }
    for1(i,n)
        fo(j,i+1,n)
            if((x[i]-x[j])>=l1 && (x[i]-x[j])<=l2 && (x[i]+x[j])>=r1 && (x[i]+x[j])<=r2)
                return 1;
    return 0;
}
long long find_shortcut(int n_0, vector<int> l, vector<int> d_0, int c_0)
{
    c=c_0;
    n=n_0;
    LL ma=0;
    for1(i,n)
    {
        d[i]=d_0[i-1];
        ma=max(ma,d[i]);
    }
    x[1]=0;
    for0(i,l.size()-1)
        x[i+2]=x[i+1]+l[i];
    LL r=1000000000000000;
    LL l1=1;
    while(1)
    {
        if(r==(l1+1))
        {
            if(stug(l1)==1)
                return l1;
            return r;
        }
        if(l1==r)
            return l1;
        LL m=(l1+r)/2;
        if(stug(m)==1)
            r=m;
        else
            l1=(m+1);
    }
    return 0;
}

Compilation message (stderr)

shortcut.cpp: In function 'int stug(long long int)':
shortcut.cpp:124:70: warning: 'r2' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if((x[i]-x[j])>=l1 && (x[i]-x[j])<=l2 && (x[i]+x[j])>=r1 && (x[i]+x[j])<=r2)
                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
shortcut.cpp:124:32: warning: 'l2' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if((x[i]-x[j])>=l1 && (x[i]-x[j])<=l2 && (x[i]+x[j])>=r1 && (x[i]+x[j])<=r2)
                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3