oj.uz

Submission #317263

# Submission time Handle Problem Language Result Execution time Memory
317263 2020-10-29T08:34:16 Z zaneyu Dreaming (IOI13_dreaming) C++14
18 / 100
 94 ms 9208 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<int,int>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
vector<pii> v[maxn];
bool vis[maxn];
int n;
vector<int> vv;
int bfs(int u,int dist[]){
    queue<int> q;
    q.push(u);
    dist[u]=0;
    int lst=-1;
    vv.clear();
    while(!q.empty()){
        int z=q.front();
        q.pop();
        vv.pb(z);
        for(auto x:v[z]){
            if(dist[x.f]>dist[z]+x.s){
                dist[x.f]=dist[z]+x.s;
                q.push(x.f);
            }
        }
    }
    int mx=-1;
    for(int i:vv) if(dist[i]>mx){
        mx=dist[i],lst=i;
    }
    return lst;
}
int bfs(int u,int dist[],vector<int> &ppl){
    queue<int> q;
    q.push(u);
    dist[u]=0;
    int lst=-1;
    while(!q.empty()){
        int z=q.front();
        q.pop();
        ppl.pb(z);
        for(auto x:v[z]){
            if(dist[x.f]>dist[z]+x.s){
                dist[x.f]=dist[z]+x.s;
                q.push(x.f);
            }
        }
    }
    int mx=-1;
    for(int i:ppl) if(dist[i]>mx){
        mx=dist[i],lst=i;
    }
    return lst;
}
int da[maxn],db[maxn],dc[maxn],dd[maxn];
vector<int> ppl;
int travelTime(int N, int m, int l, int A[], int B[], int T[]) {
    n=N;
    REP(i,m){
        v[A[i]].pb({B[i],T[i]});
        v[B[i]].pb({A[i],T[i]});
    }
    vector<int> dst;
    REP(i,n) da[i]=db[i]=dc[i]=dd[i]=INF,vis[i]=0;
    REP(i,n){
        if(!vis[i]){
            int u=bfs(i,dc);
            int vv=bfs(u,da);
            ppl.clear();
            bfs(vv,db,ppl);
            int mn=INF;
            int z=0;
            for(auto x:ppl){
                //cout<<x<<'\n';
                vis[x]=1;
                if(da[x]+db[x]==da[vv]){
                    if(mn>max(da[x],db[x])){
                        mn=max(da[x],db[x]);
                        z=x;
                    }
                }
            }
            //cout<<'\n';
            //cout<<mn<<'\n';
            //cout<<'\n';
            u=bfs(z,dd);
            dst.pb(dd[u]);
        }
    }
    sort(ALL(dst));
    reverse(ALL(dst));
    int mx=dst[0];
    if(sz(dst)>=2) MXTO(mx,dst[0]+dst[1]+l);
    if(sz(dst)>=3) MXTO(mx,dst[1]+dst[2]+2*l);
    return mx;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 9208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 9208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 9208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6908 KB Output is correct
2 Correct 94 ms 7160 KB Output is correct
3 Correct 88 ms 6904 KB Output is correct
4 Correct 88 ms 7032 KB Output is correct
5 Correct 87 ms 7032 KB Output is correct
6 Correct 94 ms 7416 KB Output is correct
7 Correct 66 ms 7160 KB Output is correct
8 Correct 62 ms 6908 KB Output is correct
9 Correct 85 ms 6808 KB Output is correct
10 Correct 88 ms 7192 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 48 ms 5116 KB Output is correct
13 Correct 51 ms 5088 KB Output is correct
14 Correct 48 ms 4980 KB Output is correct
15 Correct 83 ms 4980 KB Output is correct
16 Correct 83 ms 4980 KB Output is correct
17 Correct 47 ms 4980 KB Output is correct
18 Correct 84 ms 4976 KB Output is correct
19 Correct 84 ms 5108 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 4 ms 2816 KB Output is correct
23 Correct 86 ms 4980 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 9208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 9208 KB Output isn't correct
2 Halted 0 ms 0 KB -