#include <bits/stdc++.h>
#define MAX 500000
#define pb push_back
using namespace std;
/*
input
6 5
1 2 T
2 3 T
2 4 T
5 6 T
4 6 T
*/
struct miestas{
bool aplankytas;
vector<int> autikai;
vector<int> traukiniai;
miestas() : aplankytas(false) {}
};
vector<miestas> miestai;
void paieska_gilyn(int i)
{
miestai[i].aplankytas = true; // nes visad save aplankom
for(int kaimynas : miestai[i].traukiniai)
{
if(miestai[kaimynas].aplankytas) // jeigu aplankytas jau, tai skipinam
continue;
paieska_gilyn(kaimynas); // einam lankyt kaimyno kaimynu
}
}
int main()
{
int N, M; // N - miestai, M - transp. linijos
cin >> N >> M;
miestai.resize(N); // bus tik N miestu
for(int i = 0; i < M; i++)
{
int a, b;
char t;
cin >> a >> b >> t;
if(t == 'T')
{
miestai[a-1].traukiniai.pb(b-1); // sitose eilutese is indekso ir pb args atemam 1, nes miestai sunumeruoti 1 -> N, o vektoriaus indeksai 0 -> N-1
miestai[b-1].traukiniai.pb(a-1);
}
else if(t == 'A')
{
miestai[a-1].autikai.pb(b-1);
miestai[b-1].autikai.pb(a-1);
}
}
paieska_gilyn(0);
for(int i = 0; i < N; i++)
if(!miestai[i].aplankytas)
{
cout << 0;
return 0;
}
cout << N;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
603 ms |
38508 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
304 KB |
Output is correct |
4 |
Correct |
13 ms |
25972 KB |
Output is correct |
5 |
Correct |
1 ms |
1024 KB |
Output is correct |
6 |
Correct |
133 ms |
5728 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
25972 KB |
Output is correct |
2 |
Correct |
1 ms |
1024 KB |
Output is correct |
3 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
304 KB |
Output is correct |
3 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
304 KB |
Output is correct |
3 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
603 ms |
38508 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
304 KB |
Output is correct |
4 |
Correct |
13 ms |
25972 KB |
Output is correct |
5 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |