Submission #471713

#	Time	Username	Problem	Language	Result	Execution time	Memory
471713		NhatMinh0208	Dreaming (IOI13_dreaming)	C++14	0 / 100	62 ms	16708 KiB

dreaming

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "dreaming.h"

vector<pii(int)> gt[100001];
int dp[100001];
int mx[100001];
int used[100001];
int rmin[100001];
int n,m,i,j,k,t,t1,u,v,a,b,res;
multiset<int> bruh;


void calc1(int x, int p) {
    // cout<<"calc 1 "<<x<<' '<<p<<endl;
    used[x]=t1;
    for (auto g: gt[x]) if (g.fi-p) {
        calc1(g.fi,x);
        dp[x]=max(dp[x],dp[g.fi]+g.se);
    }
}

void calc2(int x, int p) {
    // cout<<"calc 2 "<<x<<' '<<p<<endl;
    vector<pii(int)> ok;
    for (auto g : gt[x]) ok.push_back({dp[g.fi]+g.se,g.fi});
    sort(ok.begin(),ok.end());
    reverse(ok.begin(),ok.end());
    for (auto g: ok) mx[x]=max(mx[x],g.fi);
    if (ok.size()>0) {
        for (int i=0;i<ok.size();i++) {
            if (i==0) {
                if (ok.size()>1) dp[x]=ok[1].fi;
                else dp[x]=0;
            }
            else dp[x]=ok[0].fi;
            if (ok[i].se-p) calc2(ok[i].se,x);
        }
    }
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    n=N;
    m=M;
    t=L;
    for (i=0;i<m;i++) {
        gt[A[i]].push_back({B[i],T[i]});
        gt[B[i]].push_back({A[i],T[i]});
    }
    for (i=0;i<n;i++) if (!used[i]) {
        t1++;
        calc1(i,-1);
        calc2(i,-1);
    }
    res=0;
    for (i=0;i<n;i++) {
        res=max(res,mx[i]);
        // cout<<mx[i]<<' ';
    }
    // cout<<endl;
    for (i=1;i<=t1;i++) rmin[i]=2000000000;
    for (i=0;i<n;i++) {
        rmin[used[i]]=min(rmin[used[i]],mx[i]);
    }
    // for (i=1;i<=t1;i++) cout<<rmin[i]<<' ';
    // cout<<endl;
    if (t1==1) return res;
    else if (t1==2) {
        return max(res,rmin[1]+rmin[2]+2*t);
    } else {
        b=2e9;
        for (i=2;i<=t1;i++) bruh.insert(rmin[i]);
        for (i=1;i<=t1;i++) {
            a=0;
            auto it1=bruh.end(); it1--;
            auto it2=bruh.end(); it2--; it2--;
            a=max(a,(*it1)+(*it2)+4);
            a=max(a,(*it1)+(rmin[i])+2);
            b=min(b,a);
            bruh.insert(rmin[i]);
            if (i<t1) {
                bruh.erase(bruh.lower_bound(rmin[i+1]));
            }
        }
        return max(res,b);
    }
}
// Normie28;

Compilation message (stderr)

dreaming.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
dreaming.cpp: In function 'void calc2(int, int)':
dreaming.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |         for (int i=0;i<ok.size();i++) {
      |                      ~^~~~~~~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23