Submission #41173

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
41173	2018-02-13 11:35:51	IvanC	Commuter Pass (JOI18_commuter_pass)	C++14	100 / 100	1073 ms	31740 KiB

commuter_pass

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>
#define MT make_tuple
using namespace std;
const int MAXN = 1e5 + 10;
typedef long long ll;
typedef tuple<ll,ll,ll> trinca;
typedef pair<ll,ll> ii;
vector<ii> grafo[MAXN];
ll N,M,processado[MAXN][8],dist[MAXN][8],ans,S,T,U,V,menorcaminho;
void Dijskra(ll origem,ll idx){
  priority_queue<ii, vector<ii> , greater<ii> > pq;
  pq.push(ii(0,origem));
  while(!pq.empty()){
    ll percorrido = pq.top().first, v = pq.top().second;
    pq.pop();
    if(processado[v][idx]) continue;
    processado[v][idx] = 1;
    dist[v][idx] = percorrido;
    for(int i = 0;i<grafo[v].size();i++){
      ll u = grafo[v][i].first, w = grafo[v][i].second;
      if(!processado[u][idx]) pq.push(ii(w + percorrido,u));
    }
  }
}
void solve(ll origem,ll qualsoma,ll idx, ll qualminimiza, ll qualtenta ){
  priority_queue<trinca, vector<trinca> , greater<trinca> > pq;
  pq.push(MT(0,(ll)1e18,origem));
  while(!pq.empty()){
    trinca davez = pq.top();
    pq.pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

commuter_pass.cpp: In function 'void Dijskra(ll, ll)':
commuter_pass.cpp:19:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0;i<grafo[v].size();i++){
                  ^
commuter_pass.cpp: In function 'void solve(ll, ll, ll, ll, ll)':
commuter_pass.cpp:39:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0;i<grafo[v].size();i++){
                  ^

• Subtask 1: 16 / 16
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 45 / 45