# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
571674 | 2022-06-02T13:54:30 Z | MODDI | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 660 ms | 6028 KB |
#include <bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define mp make_pair #define pb push_back using namespace std; int n, m; vi train[50000], bus[50000]; int main(){ cin>>n>>m; for(int i = 0; i < m; i++){ int a, b; char tip; cin>>a>>b>>tip; a--; b--; if(tip == 'T') { train[a].pb(b); train[b].pb(a); } else{ bus[a].pb(b); bus[b].pb(a); } } int rez =0; for(int i = 0; i < n; i++){ queue<pii> q; q.push(mp(i, 0)); bool vis[n]; memset(vis, false, sizeof(vis)); vis[i] = true; set<int> city; while(!q.empty()){ int at = q.front().first; int take = q.front().second; city.insert(at); q.pop(); for(auto next : train[at]){ if(!vis[next]){ vis[next] = true; q.push(mp(next, take)); } } if(take == 0){ for(auto next : bus[at]){ if(!vis[next]){ vis[next] = true; q.push(mp(next, 1)); } } } } if(city.size() == n){ rez = i; break; } } cout<<rez+1<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 5076 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 660 ms | 6028 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2644 KB | Output is correct |
2 | Incorrect | 2 ms | 2644 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2644 KB | Output is correct |
2 | Incorrect | 2 ms | 2644 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2644 KB | Output is correct |
2 | Incorrect | 2 ms | 2644 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |