# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107825 | degelo | Dreaming (IOI13_dreaming) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
//#include"dreaming.h"
#define maxn 100005
using namespace std;
int dist[maxn][3],marc[maxn][3];
vector<int> grafo[maxn],peso[maxn],cc[maxn],raios;
void dfs(int v,int k,int id){
marc[v][id]=k;
for(int i=0;i<grafo[v].size();i++){
int viz=grafo[v][i];
int p=peso[v][i];
if(marc[viz][id]==0){
dist[viz][id]=dist[v][id]+p;
dfs(viz,k,id);
}
}
}
int travelTime(int N,int M,int L,int A[],int B[],int T[]){
int k=1;
for(int i=0;i<M;i++){
grafo[A[i]].push_back(B[i]);
peso[A[i]].push_back(T[i]);
grafo[B[i]].push_back(A[i]);
peso[B[i]].push_back(T[i]);
}
for(int i=0;i<N;i++){
if(marc[i][0]==0){
dist[i][0]=0;
dfs(i,k,0);
k++;