oj.uz

Submission #729231

# Submission time Handle Problem Language Result Execution time Memory
729231 2023-04-23T17:08:59 Z grogu Shortcut (IOI16_shortcut) C++14
0 / 100
 1 ms 724 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
#define endl '\n'
#define here cerr<<"=========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#define ll long long
#define pb push_back
#define popb pop_back
#define all(a_) a_.begin(),a_.end()
#define pll pair<ll,ll>
#define sc second
#define fi first
#define llinf 1000000000000000LL
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i = l;i<=r;i++) cerr<<a[i]<< " ";cerr<<endl;}

using namespace std;
#define maxn 10005
ll n,c,tsz;
vector<pll> g[maxn];
vector<ll> cyc,ps,curr;
ll cyclen;
bool naso = 0;
bool inc[maxn];
bool vis[maxn];
ll len[maxn][maxn];
ll id[maxn];
ll in[maxn],out[maxn];
ll st[maxn][20];
ll dept[maxn];
ll mx[maxn][2];
ll lg2[maxn];
void init(ll m){
    ll lg = 0;
    ll mm = 1;
    while(mm<=m) mm*=2,lg++;
    for(ll j = 0;j<=lg;j++) for(ll i = 1;i<=m*8;i++) st[i][j] = -llinf;
    for(ll i = 0;i<=m;i++) st[i][0] = ps[i] + mx[cyc[i%(cyc.size())]][0];
    for(ll j = 1;j<=lg;j++){
        for(ll i = 0;i<=m;i++){
            st[i][j] = max(st[i][j-1],st[i+(1<<j)][j-1]);
        }
    }
}
ll get(ll l,ll r){
    if(l>r) return -llinf;
    ll len = r-l+1;
    ll x = lg2[len];
    ll len2 = (1<<x);
    ll ans = min(st[l][x],st[r+1-len2][x]);
    return ans;
}
ll ti = 0;
ll cur;
void dfs2(ll u,ll par,ll poc){
    id[u] = poc;
    st[u][0] = par;
    in[u] = ++ti;
    if(g[u].size()==1) mx[u][0] = 0;
    for(pll p : g[u]){
        ll s = p.fi;
        ll w = len[u][s];
        if(inc[s]) continue;
        if(s==par) continue;
        dept[s] = dept[u] + w;
        dfs2(s,u,poc);
        vector<ll> v;
        v.pb(mx[s][0] + w);
        v.pb(mx[s][0] + w);
        v.pb(mx[u][0]);
        v.pb(mx[u][1]);
        cur = max(cur,mx[u][0] + mx[s][0] + w);
        sort(all(v));
        mx[u][0] = v[3];
        mx[u][1] = v[2];
    }
    out[u] = ti-1;
}
ll dis[maxn];
void dfs3(ll u,ll par){
    for(pll p : g[u]){
        ll s = p.fi;
        ll w = len[u][s];
        if(s==par) continue;
        dis[s] = dis[u] + w;
        dfs3(s,u);
    }
}
ll naj(ll x){
    for(ll i = 1;i<=tsz;i++) dis[i] = llinf;
    dis[x] = 0;
    dfs3(x,x);
    ll ans = x;
    for(ll i = 1;i<=tsz;i++) if(dis[i]>dis[ans]) ans = i;
    return ans;
}
ll find_shortcut(int N, vector<int> L, vector<int> D, int C)
{
    for(ll i = 0;i<11;i++)
        lg2[(1<<i)] = i;
    for(ll i = 2;i<maxn;i++){
        if(!lg2[i]) lg2[i] = lg2[i-1];
    }
    n = N;
    tsz = n;
    c = C;
    for(ll i = 0;i<n;i++) if(D[i]) tsz++;
    for(ll i = 0;i<=tsz;i++) for(ll j = 0;j<=tsz;j++) len[i][j] = llinf;
    for(ll i = 1;i<n;i++){
        g[i].pb({i+1,L[i-1]});
        g[i+1].pb({i,L[i-1]});
        len[i][i+1] = len[i+1][i] = L[i-1];
    }
    tsz = n;
    for(ll i = 1;i<=n;i++) if(D[i-1]){
        g[i].pb({++tsz,D[i-1]});
        g[tsz].pb({i,D[i-1]});
        len[i][tsz] = len[tsz][i] = D[i-1];
    }
    ll ans = llinf;
    for(ll i = 1;i<=n;i++){
        for(ll j = i+2;j<=n;j++){
            g[i].pb({j,c});
            g[j].pb({i,c});
            len[i][j] = len[j][i] = c;
            ti = 0;
            for(ll k = 1;k<=tsz;k++) vis[k] = inc[k] = id[k] = in[k] = out[k] = dept[k] = 0;
            for(ll k = 1;k<=tsz;k++) mx[k][0] = mx[k][1] = -llinf;
            cyclen = 0;
            cyc.clear();
            ps.clear();
            ps.pb(0);
            for(ll k = i;k<=j;k++) cyc.pb(k),inc[k] = 1;
            for(ll k = 1;k<cyc.size();k++) ps.pb(ps[k-1] + len[cyc[k]][cyc[k-1]]);
            cyclen = ps.back() + len[cyc[0]][cyc.back()];
            ps.pb(cyclen);
            for(ll k = 1;k<cyc.size();k++) ps.pb(ps.back() + len[cyc[k]][cyc[k-1]]);
            cur = 0;
            ll m = ps.size()-1;
            for(ll k = 0;k<cyc.size();k++){
                ll y = cyc[k];
                st[y][0] = y;
                dfs2(y,y,k);
                if(g[y].size()==2) mx[y][0] = 0;
            }
            init(m);
            ll f = 0;
            for(ll e = 0;e<cyc.size();e++){
                while(f<ps.size()-1&&ps[f+1]-ps[e]<=cyclen/2) f++;
                cur = max(cur,mx[cyc[e%(cyc.size())]][0] - ps[e] + get(e+1,f));
            }
            ps.clear();
            ps.pb(0);
            reverse(all(cyc));
            for(ll k = 1;k<cyc.size();k++) ps.pb(ps[k-1] + len[cyc[k]][cyc[k-1]]);
            cyclen = ps.back() + len[cyc[0]][cyc.back()];
            ps.pb(cyclen);
            for(ll k = 1;k<cyc.size();k++) ps.pb(ps.back() + len[cyc[k]][cyc[k-1]]);
            init(m);
            f = 0;
            for(ll e = 0;e<cyc.size();e++){
                while(f<ps.size()-1&&ps[f+1]-ps[e]<=cyclen/2) f++;
                cur = max(cur,mx[cyc[e%(cyc.size())]][0] - ps[e] + get(e+1,f));
            }
            ans = min(ans,cur);
            len[i][j] = len[j][i] = llinf;
            g[i].popb();
            g[j].popb();
        }
    }
    for(ll i = 1;i<n;i++){
        len[i][i+1] = len[i+1][i] = min((ll)L[i-1],c);
        ll x = naj(1);
        ll y = naj(x);
        ans = min(ans,dis[y]);
        len[i][i+1] = len[i+1][i] = L[i-1];
    }
    return ans;
}
/**
4 10
10 20 20
0 40 0 30

9 30
10 10 10 10 10 10 10 10
20 0 30 0 0 40 0 40 0

3 3
1 1
1 1 1

5 1
1 1 1 1
0 0 0 0 0
**/

Compilation message

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:126:62: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  126 |             for(ll k = 1;k<=tsz;k++) vis[k] = inc[k] = id[k] = in[k] = out[k] = dept[k] = 0;
      |                                                        ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortcut.cpp:133:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |             for(ll k = 1;k<cyc.size();k++) ps.pb(ps[k-1] + len[cyc[k]][cyc[k-1]]);
      |                          ~^~~~~~~~~~~
shortcut.cpp:136:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |             for(ll k = 1;k<cyc.size();k++) ps.pb(ps.back() + len[cyc[k]][cyc[k-1]]);
      |                          ~^~~~~~~~~~~
shortcut.cpp:139:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |             for(ll k = 0;k<cyc.size();k++){
      |                          ~^~~~~~~~~~~
shortcut.cpp:147:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |             for(ll e = 0;e<cyc.size();e++){
      |                          ~^~~~~~~~~~~
shortcut.cpp:148:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |                 while(f<ps.size()-1&&ps[f+1]-ps[e]<=cyclen/2) f++;
      |                       ~^~~~~~~~~~~~
shortcut.cpp:154:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |             for(ll k = 1;k<cyc.size();k++) ps.pb(ps[k-1] + len[cyc[k]][cyc[k-1]]);
      |                          ~^~~~~~~~~~~
shortcut.cpp:157:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |             for(ll k = 1;k<cyc.size();k++) ps.pb(ps.back() + len[cyc[k]][cyc[k-1]]);
      |                          ~^~~~~~~~~~~
shortcut.cpp:160:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |             for(ll e = 0;e<cyc.size();e++){
      |                          ~^~~~~~~~~~~
shortcut.cpp:161:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |                 while(f<ps.size()-1&&ps[f+1]-ps[e]<=cyclen/2) f++;
      |                       ~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB n = 4, 80 is a correct answer
2 Correct 1 ms 724 KB n = 9, 110 is a correct answer
3 Correct 1 ms 596 KB n = 4, 21 is a correct answer
4 Correct 1 ms 596 KB n = 3, 4 is a correct answer
5 Correct 1 ms 596 KB n = 2, 62 is a correct answer
6 Correct 1 ms 596 KB n = 2, 3 is a correct answer
7 Correct 1 ms 596 KB n = 3, 29 is a correct answer
8 Correct 1 ms 596 KB n = 2, 3 is a correct answer
9 Correct 1 ms 596 KB n = 2, 3 is a correct answer
10 Correct 1 ms 596 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 596 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 596 KB n = 3, 3000000000 is a correct answer
14 Incorrect 1 ms 596 KB n = 4, incorrect answer: jury 3000000001 vs contestant 4000000000
15 Halted 0 ms 0 KB -