# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1139683 | tone_alexandru | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 3 ms | 832 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, char>> adj[10005];
queue<int> q;
bool saveT[10005], saveA[10005];
int minim[10005];
int main()
{
int n, m;
cin>>n>>m;
int a, b;
char type;
for(int i=0; i<m; i++)
{
cin>>a>>b>>type;
adj[a].push_back({b, type});
adj[b].push_back({a, type});
}
int cnt = 0;
for(int i=1; i<=n; i++)
{
for(int i=1; i<=n; i++)
minim[i] = 21e8, saveA[i] = 0, saveT[i] = 0;
minim[i] = 0;
# | 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... |