Submission #639608

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
639608	2022-09-10 17:36:31	teesla	Monthly railway pass (LMIO18_menesinis_bilietas)	C++14	30 / 100	3093 ms	29920 KiB

menesinis_bilietas

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int>ii;
const int maxn=1e5+10;
vector<ii>adj[5*maxn];
int visitado[5*maxn];
int n,m;
void bfs(int x){
  visitado[x]=0;
  priority_queue<ii,vector<ii>,greater<ii>> fila;
  fila.push({0,x});
  while(!fila.empty()){
    int atual=fila.top().second,dist=fila.top().first;
    fila.pop();
    if(visitado[atual]!=-1 and dist>visitado[atual]) continue;
    visitado[atual]=dist;
    if(visitado[atual]>1)continue;
    for(int i=0; i<adj[atual].size(); i++){
      int viz=adj[atual][i].first, d=adj[atual][i].second;
      if(dist+d>1)continue;
      else if(visitado[viz]==-1 and dist+d<=1){
        visitado[viz]=d+dist;
        fila.push({d+dist,viz});
      }
      else if(visitado[viz]>dist+d){
        visitado[viz]=dist+d;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

menesinis_bilietas.cpp: In function 'void bfs(int)':
menesinis_bilietas.cpp:22:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |   for(int i=0; i<adj[atual].size(); i++){
      |                ~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 6
• Subtask 3: 30 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 19