oj.uz

Submission #234023

# Submission time Handle Problem Language Result Execution time Memory
234023 2020-05-22T20:50:25 Z tleontest1 Dreaming (IOI13_dreaming) C++14
0 / 100
 42 ms 13180 KB 
#include <dreaming.h>
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t[li],l,mx[li],maxi;
int cev;
string s;
bool ok[li];
vector<PII> v[li];

inline void dfs(int node,int ata,int der,int basla){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		int co=v[node][i].se;
		if(go==ata)continue;
		dfs(go,node,der+co,basla);
	}
	if(basla==1)ok[node]=1;
	mx[basla]=max(mx[basla],der);
	maxi=max(maxi,mx[basla]);
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	for(int i=1;i<=m;i++){
		v[A[i]].pb(mp(B[i],T[i]));
		v[B[i]].pb(mp(A[i],T[i]));
	}
	FOR dfs(i,0,0,i);
	int mn=inf,mn1=inf;
	FOR{
		if(ok[i])mn=min(mn,mx[i]);
		else mn1=min(mn1,mx[i]);
	}
    return max(maxi,mn+mn1+L);
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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