Lennot

input/code.cpp: In function 'int main()':
input/code.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j=0; j<lt[c].size(); ++j){
                    ^

#include <iostream>
#include <vector>
#include <queue>
#define F first
#define S second
using namespace std;
int n, m;

long long mn[101010][2];
vector<pair<int, int> > lt[101010];




int main(){
  ios_base::sync_with_stdio(0); cin.tie(0);
  for (int i=0; i<101010; ++i) for (int j=0; j<2; ++j) mn[i][j]=2000000000000000LL;
  
  
  cin >> n >> m;
  for (int i=0; i<m; ++i){
    int a, b, h;
    cin >> a >> b >> h;
    lt[a].push_back(make_pair(b, h));
  }
  
  priority_queue<pair<long long, int> > q; 
  q.push(make_pair(0, 1));
  while (q.size()){
    int c=q.top().S;
    int p=1;
    if (c<0){ c=-c; p=-p;}
    long long h=-q.top().F;
    q.pop();
    
    if (h>=min(mn[n][0], mn[n][1])) break;
    if (mn[c][(p+1)/2]<=h) continue;
    
    mn[c][(p+1)/2]=h;
    for (int j=0; j<lt[c].size(); ++j){
      long long h2=lt[c][j].S*(p+1)/2+h;
      q.push(make_pair(-h2, -lt[c][j].F*p));
    }
  }
  cout << min(mn[n][0], mn[n][1]) << "\n";
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED