Submission #942122

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
942122	2024-03-10 09:34:54	Mathias	Monthly railway pass (LMIO18_menesinis_bilietas)	C++14	100 / 100	347 ms	52672 KiB

menesinis_bilietas

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5+7;
vector<int>g[MAXN];
vector<pair<int,int> >bus;
int sajz[MAXN],res[MAXN],t[MAXN];
map<pair<int,int>, bool> w;
int ans,cnt;
void DFS(int x,int nr){
  t[x]=nr;
  //cout<<x<<' ';
  sajz[nr]++;
  for(auto s:g[x]) if(!t[s]) DFS(s,nr);
}
int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  int n,m,s1,s2,a,b; char c;
  cin>>n>>m;
  for(int i=1;i<=m;i++){
    cin>>a>>b>>c;
    if(c=='T'){
      g[a].push_back(b); g[b].push_back(a);
    }
    else bus.push_back({a,b});
  }
  for(int i=1;i<=n;i++){
    if(t[i]==0){
      //cout<<"\ni="<<i<<'\n';
      DFS(i,++cnt);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 6 / 6
• Subtask 3: 30 / 30
• Subtask 4: 35 / 35
• Subtask 5: 19 / 19