oj.uz

답안 #1021712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021712 2024-07-13T03:05:08 Z lHog Monthly railway pass (LMIO18_menesinis_bilietas) C++17
0 / 100
 362 ms 41636 KB 
#include <bits/stdc++.h>
using namespace std;
vector <long long> adjlist[1000001];
bool visited [1000001];
void dfs(long long cur){
    for(const long long&e:adjlist[cur]){
        if(!visited[e]){
            visited[e]=1;
            dfs(e);
        }
    }
}
int main() {
    long long n,e,a,b,s=0;
    cin>>n>>e;
    char mmmm;
    for(long long i=0;i<e;i++){
        cin>>a>>b>>mmmm;
        adjlist[a].push_back(b);
        adjlist[b].push_back(a);
    }
    for(long long i=0;i<n;i++){
        if(!visited[i]){
            dfs(i);
            s++;
        }
    }
    if (s >= 1) cout << n;
    else cout << 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 41636 KB Output is correct
2 Correct 10 ms 23900 KB Output is correct
3 Incorrect 11 ms 23900 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 23900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Incorrect 11 ms 23900 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Incorrect 11 ms 23900 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 41636 KB Output is correct
2 Correct 10 ms 23900 KB Output is correct
3 Incorrect 11 ms 23900 KB Output isn't correct
4 Halted 0 ms 0 KB -