oj.uz

Submission #133104

# Submission time Handle Problem Language Result Execution time Memory
133104 2019-07-20T07:28:01 Z briansu Race (IOI11_race) C++14
100 / 100
 875 ms 104256 KB 
#include "race.h"

//{
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}


const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=ll(1e9);

namespace pre{
  vector<ii> v[MAXn];
  ii p[MAXn];
  ll lf[MAXn];
  void dfs(ll now, ll f)
  {
    lf[now] = 1;
    for(ii k:v[now])if(k.X  != f)
    {
      p[k.X] = ii(now, k.Y);
      lf[now] = 0;
      dfs(k.X, now);
    }
  }
};

ll ans = INF, n, k;

void cal(vector<ii> &a, vector<ii> &b)
{
  ll it = SZ(b) - 1;
  REP(i, SZ(a))
  {
    while(it >= 0 && a[i].X + b[it].X > k)it --;
    if(it >= 0 && a[i].X + b[it].X == k)ans = min(ans, a[i].Y + b[it].Y);
  }
}

vector<ii> mg(vector<ii> &a, vector<ii> &b, ii d)// merge (a, b + d)
{
  for(auto &p:b)p.X = min(INF, p.X + d.X), p.Y += d.Y;
  vector<ii> c(SZ(a) + SZ(b));
  merge(ALL(a), ALL(b), c.begin());
  vector<ii> ret;
  for(auto &p:c)if(!SZ(ret) || p.X != ret.back().X)ret.pb(p);
  return ret;
}

ll u[MAXn], gct;
ii dis[MAXn];
vector<ll> v[MAXn];
vector<ii> dt[MAXn][2];

#define CLR(_a) (_a).clear(),(_a).shrink_to_fit()

void dfs(ll now)
{
  u[now] = 0;
  for(ll t:v[now])dfs(t);
  if(SZ(v[now]) == 1)
  {
    ll t = v[now][0];
    if(u[t] || now == 0)return;
    u[t] = u[now] = 1;
    gct --;
    cal(dt[t][0], dt[now][1]);
    dt[now][0] = mg(dt[now][0], dt[t][0], dis[now]);
    if(SZ(v[t])){
      dt[now][1] = mg(dt[t][1], dt[now][1], dis[t]);
      dis[now] = {dis[now].X + dis[t].X, dis[now].Y + dis[t].Y};
    }
    v[now] = v[t];
    CLR(v[t]);CLR(dt[t][0]);CLR(dt[t][1]);
    return;
  }
  vector<ll> a, b, nv;
  for(ll t:v[now])
  {
    if(u[t])nv.pb(t);
    else if(!SZ(v[t]))a.pb(t);
    else b.pb(t);
  }
  for(int i = 0;i < SZ(a);)
  {
    ll x, y;
    if(i < SZ(b))x = b[i], y = a[i], i ++;
    else if(i < SZ(a) - 1)x = a[i + 1], y = a[i], i += 2;
    else{
      nv.pb(a[i]);
      break;
    }
    u[x] = u[y] = 1;
    gct --;
    nv.pb(x);
    cal(dt[x][0], dt[y][0]);
    dt[x][0] = mg(dt[x][0], dt[y][0], {0, 0});
    if(SZ(v[x]))dt[x][1] = mg(dt[x][1], dt[y][0], dis[x]);
    CLR(v[y]);CLR(dt[y][0]);CLR(dt[y][1]);
  }
  if(SZ(b) > SZ(a))for(int i = SZ(a);i < SZ(b);i ++)nv.pb(b[i]);
  v[now] = nv;
}

int best_path(int N, int K, int H[][2], int L[])
{
  k = K;
  n = N;
  REP(i, n - 1)
  {
    pre::v[H[i][0]].pb(ii(H[i][1], L[i]));
    pre::v[H[i][1]].pb(ii(H[i][0], L[i]));
  }
  pre::dfs(0, -1);
  for(int i = 1;i < n;i ++)
  {
    v[pre::p[i].X].pb(i);
    if(pre::p[i].Y == k)ans = 1;
    dis[i] = {pre::p[i].Y, 1};
    dt[i][0].pb({pre::p[i].Y, 1});
    if(!pre::lf[i])dt[i][1].pb({pre::p[i].Y, 1});
  }
  gct = n - 1;
  ll iter = 0;
  while(gct > 1)
  {
    dfs(0);
    iter ++;
  }
  debug(iter);
  assert(iter <= 35);
  if(ans == INF)return -1;
  else return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19192 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19132 KB Output is correct
8 Correct 19 ms 19164 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 19 ms 19196 KB Output is correct
12 Correct 19 ms 19196 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 19 ms 19132 KB Output is correct
17 Correct 19 ms 19192 KB Output is correct
18 Correct 19 ms 19192 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19192 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19132 KB Output is correct
8 Correct 19 ms 19164 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 19 ms 19196 KB Output is correct
12 Correct 19 ms 19196 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 19 ms 19132 KB Output is correct
17 Correct 19 ms 19192 KB Output is correct
18 Correct 19 ms 19192 KB Output is correct
19 Correct 18 ms 19192 KB Output is correct
20 Correct 19 ms 19192 KB Output is correct
21 Correct 20 ms 19320 KB Output is correct
22 Correct 21 ms 19320 KB Output is correct
23 Correct 21 ms 19324 KB Output is correct
24 Correct 21 ms 19320 KB Output is correct
25 Correct 21 ms 19320 KB Output is correct
26 Correct 20 ms 19292 KB Output is correct
27 Correct 21 ms 19320 KB Output is correct
28 Correct 21 ms 19320 KB Output is correct
29 Correct 21 ms 19320 KB Output is correct
30 Correct 21 ms 19320 KB Output is correct
31 Correct 20 ms 19320 KB Output is correct
32 Correct 20 ms 19352 KB Output is correct
33 Correct 21 ms 19320 KB Output is correct
34 Correct 21 ms 19448 KB Output is correct
35 Correct 20 ms 19420 KB Output is correct
36 Correct 20 ms 19448 KB Output is correct
37 Correct 20 ms 19448 KB Output is correct
38 Correct 20 ms 19448 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19192 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19132 KB Output is correct
8 Correct 19 ms 19164 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 19 ms 19196 KB Output is correct
12 Correct 19 ms 19196 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 19 ms 19132 KB Output is correct
17 Correct 19 ms 19192 KB Output is correct
18 Correct 19 ms 19192 KB Output is correct
19 Correct 282 ms 33144 KB Output is correct
20 Correct 264 ms 33156 KB Output is correct
21 Correct 274 ms 33016 KB Output is correct
22 Correct 277 ms 32764 KB Output is correct
23 Correct 287 ms 33036 KB Output is correct
24 Correct 285 ms 30840 KB Output is correct
25 Correct 364 ms 49528 KB Output is correct
26 Correct 154 ms 61816 KB Output is correct
27 Correct 363 ms 47096 KB Output is correct
28 Correct 869 ms 104256 KB Output is correct
29 Correct 867 ms 100392 KB Output is correct
30 Correct 349 ms 46920 KB Output is correct
31 Correct 344 ms 46968 KB Output is correct
32 Correct 560 ms 47080 KB Output is correct
33 Correct 709 ms 51832 KB Output is correct
34 Correct 738 ms 51960 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 19192 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19192 KB Output is correct
4 Correct 19 ms 19192 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 19 ms 19192 KB Output is correct
7 Correct 19 ms 19132 KB Output is correct
8 Correct 19 ms 19164 KB Output is correct
9 Correct 19 ms 19192 KB Output is correct
10 Correct 19 ms 19192 KB Output is correct
11 Correct 19 ms 19196 KB Output is correct
12 Correct 19 ms 19196 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 19 ms 19192 KB Output is correct
16 Correct 19 ms 19132 KB Output is correct
17 Correct 19 ms 19192 KB Output is correct
18 Correct 19 ms 19192 KB Output is correct
19 Correct 18 ms 19192 KB Output is correct
20 Correct 19 ms 19192 KB Output is correct
21 Correct 20 ms 19320 KB Output is correct
22 Correct 21 ms 19320 KB Output is correct
23 Correct 21 ms 19324 KB Output is correct
24 Correct 21 ms 19320 KB Output is correct
25 Correct 21 ms 19320 KB Output is correct
26 Correct 20 ms 19292 KB Output is correct
27 Correct 21 ms 19320 KB Output is correct
28 Correct 21 ms 19320 KB Output is correct
29 Correct 21 ms 19320 KB Output is correct
30 Correct 21 ms 19320 KB Output is correct
31 Correct 20 ms 19320 KB Output is correct
32 Correct 20 ms 19352 KB Output is correct
33 Correct 21 ms 19320 KB Output is correct
34 Correct 21 ms 19448 KB Output is correct
35 Correct 20 ms 19420 KB Output is correct
36 Correct 20 ms 19448 KB Output is correct
37 Correct 20 ms 19448 KB Output is correct
38 Correct 20 ms 19448 KB Output is correct
39 Correct 282 ms 33144 KB Output is correct
40 Correct 264 ms 33156 KB Output is correct
41 Correct 274 ms 33016 KB Output is correct
42 Correct 277 ms 32764 KB Output is correct
43 Correct 287 ms 33036 KB Output is correct
44 Correct 285 ms 30840 KB Output is correct
45 Correct 364 ms 49528 KB Output is correct
46 Correct 154 ms 61816 KB Output is correct
47 Correct 363 ms 47096 KB Output is correct
48 Correct 869 ms 104256 KB Output is correct
49 Correct 867 ms 100392 KB Output is correct
50 Correct 349 ms 46920 KB Output is correct
51 Correct 344 ms 46968 KB Output is correct
52 Correct 560 ms 47080 KB Output is correct
53 Correct 709 ms 51832 KB Output is correct
54 Correct 738 ms 51960 KB Output is correct
55 Correct 39 ms 20600 KB Output is correct
56 Correct 36 ms 20600 KB Output is correct
57 Correct 155 ms 33196 KB Output is correct
58 Correct 110 ms 31248 KB Output is correct
59 Correct 198 ms 61944 KB Output is correct
60 Correct 875 ms 101784 KB Output is correct
61 Correct 373 ms 47172 KB Output is correct
62 Correct 353 ms 46916 KB Output is correct
63 Correct 576 ms 47096 KB Output is correct
64 Correct 751 ms 47252 KB Output is correct
65 Correct 704 ms 46576 KB Output is correct
66 Correct 868 ms 91640 KB Output is correct
67 Correct 256 ms 43108 KB Output is correct
68 Correct 541 ms 46256 KB Output is correct
69 Correct 540 ms 46232 KB Output is correct
70 Correct 516 ms 45184 KB Output is correct