# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139813 | gramathegod | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 3096 ms | 28084 KiB |
#include <iostream>
#include <vector>
#include <queue>
#define MAX 500005
using namespace std;
int n, m, ok = 1;
vector<vector<pair<int, int>>> graph(MAX);
void add(vector<vector<pair<int, int>>> &graph, int u, int v, int w) {
graph[u].emplace_back(v, w);
graph[v].emplace_back(u, w);
}
bool check[MAX];
void bfs(int init) {
vector<char> cost(MAX, 0);
vector<bool> visited(MAX, 0);
int u, s, v, vw;
queue<int> q;
pair<int, int> nou;
q.push(init);
cost[init] = 0;
while (!q.empty()) {
u = q.front();
q.pop();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |