Submission #536249

#TimeUsernameProblemLanguageResultExecution timeMemory
536249groshiDreaming (IOI13_dreaming)C++17
Compilation error
0 ms0 KiB
#include<iostream> #include<vector> #include "dreaming.h" using namespace std; bool odw[110000]; struct wi{ vector<int> Q; int maxx1=0,maxx2=0,skad1=0,skad2=0; int maxx=0; int ojc=0; int czym=0; int odw2=0; int odw3=0; }*w; int dfs(int x) { odw[x]=1; int wynik=0; for(int i=0;i<w[x].Q.size();i+=2) { int pom=w[x].Q[i]; if(odw[pom]==1) continue; w[pom].ojc=x; w[pom].czym=w[x].Q[i+1]; int ile=dfs(pom); if(ile+w[x].Q[i+1]>w[x].maxx1) { w[x].maxx2=w[x].maxx1; w[x].skad2=w[x].skad1; w[x].maxx1=ile+w[x].Q[i+1]; w[x].skad1=pom; } else if(ile+w[x].Q[i+1]>w[x].maxx2) { w[x].maxx2=ile+w[x].Q[i+1]; w[x].skad2=pom; } wynik=max(wynik,ile+w[x].Q[i+1]); } return wynik; } void dfs2(int x) { w[x].odw2=1; for(int i=0;i<w[x].Q.size();i+=2) { int pom=w[x].Q[i]; if(w[pom].odw2==1) continue; if(w[x].skad1==pom && w[x].maxx2+w[x].Q[i+1]>w[pom].maxx1) { w[pom].maxx2=w[pom].maxx1; w[pom].skad2=w[pom].skad1; w[pom].maxx1=w[x].maxx2+w[x].Q[i+1]; w[pom].skad1=x; } else if(w[x].skad1==pom && w[x].maxx2+w[x].Q[i+1]>w[pom].maxx2) { w[pom].maxx2=w[x].maxx2+w[x].Q[i+1]; w[pom].skad2=x; } else if(w[x].skad1!=pom && w[x].maxx1+w[x].Q[i+1]>w[pom].maxx1) { w[pom].maxx2=w[pom].maxx1; w[pom].skad2=w[pom].skad1; w[pom].maxx1=w[x].maxx1+w[x].Q[i+1]; w[pom].skad1=x; } else if(w[x].skad1!=pom && w[x].maxx2+w[x].Q[i+1]>w[pom].maxx2) { w[pom].maxx2=w[x].maxx2+w[x].Q[i+1]; w[pom].skad2=x; } dfs2(pom); } } int dfs3(int x) { w[x].odw3=1; int wypisz=0; wypisz=w[x].maxx1; for(int i=0;i<w[x].Q.size();i+=2) { int pom=w[x].Q[i]; if(w[pom].odw3==1) continue; int cos=dfs3(pom); wypisz=min(wypisz,cos); } return wypisz; } int travelTime(int n,int m,int l,vector<int> A,vector<int> B,vector<int> T) { w=new wi[n+3]; for(int i=0;i<m;i++) { w[A[i]].Q.push_back(B[i]); w[A[i]].Q.push_back(T[i]); w[B[i]].Q.push_back(A[i]); w[B[i]].Q.push_back(T[i]); } for(int i=0;i<n;i++) { if(odw[i]==1) continue; int maxx=dfs(i); } for(int i=0;i<n;i++) { if(w[i].odw2==1) continue; dfs2(i); } int jeden=0,dwa=0; for(int i=0;i<n;i++) { if(w[i].odw3==1) continue; int ile=dfs3(i); if(ile>jeden) { dwa=jeden; jeden=ile; } else if(ile>dwa) { dwa=ile; } } return jeden+dwa+l; return 0; }

Compilation message (stderr)

dreaming.cpp: In function 'int dfs(int)':
dreaming.cpp:19:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i=0;i<w[x].Q.size();i+=2)
      |                 ~^~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs2(int)':
dreaming.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0;i<w[x].Q.size();i+=2)
      |                 ~^~~~~~~~~~~~~~
dreaming.cpp: In function 'int dfs3(int)':
dreaming.cpp:83:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(int i=0;i<w[x].Q.size();i+=2)
      |                 ~^~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
dreaming.cpp:107:13: warning: unused variable 'maxx' [-Wunused-variable]
  107 |         int maxx=dfs(i);
      |             ^~~~
/usr/bin/ld: /tmp/ccUawbtI.o: in function `main':
grader.c:(.text.startup+0xd1): undefined reference to `travelTime'
collect2: error: ld returned 1 exit status