# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1139304 | seby1305 | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 52 ms | 7496 KiB |
#include <bits/stdc++.h>
#define ll long long
#define pi pair<int, char>
#define pint pair<int, int>
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
#define allsir(v) v+1, v+n+1
#define inf 1e9
using namespace std;
const string file = "";
ifstream fin(file+".in");
ofstream fout(file+".out");
const int dim = 250001, mod = 1e9+7;
int n, m, a, b, nod, i, drum[dim];
char c;
vector<pi> g[dim];
void bfs(int nod)
{
int i;
for (i = 1; i <= n; i++)
drum[i] = inf;
drum[nod] = 0;
queue<pint> q;
q.push({0, nod});
while (!q.empty())
# | 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... |