# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920975 | WongYiKai | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 401 ms | 114360 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll visited[600000];
ll type[600000];
ll c=1;
ll sets[600000];
vector<ll> adj[600000],adj2[600000];
void dfs(ll vertex){
visited[vertex] = 1;
type[vertex] = c;
sets[c]++;
for (auto item:adj[vertex]){
if (visited[item]==0){
dfs(item);
}
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,m;
cin >> n >> m;
for (int i=0;i<m;i++){
ll a,b;
char t;
cin >> a >> b >> t;
if (t=='T'){
# | 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... |