oj.uz

답안 #218232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218232 2020-04-01T15:08:24 Z Haunted_Cpp Monthly railway pass (LMIO18_menesinis_bilietas) C++17
100 / 100
 444 ms 43768 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;

const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

const int N = 5e5 + 5;

vvi g (N);
vvi bus (N);
vi color (N, -1);

bool vis [N], valid_color [N];
int group = 0;

void dfs (int node) {
  vis[node] = true;
  color[node] = group;
  GO (to, g[node]) {
    if (!vis[to]) {
      vis[to] = true;
      dfs (to);
    }
  }
}

int Get = 0;
int ordem_visita = 1;
int unique_color [N];

void solve (int node) {
  vis[node] = true;
  if (unique_color[color[node]] != ordem_visita) ++Get;
  unique_color[color[node]] = ordem_visita;
  GO (to, bus[node]) {
    if (unique_color[color[to]] != ordem_visita) ++Get;
    unique_color[color[to]] = ordem_visita;
  }
  GO (to, g[node]) {
    if (!vis[to]) {
      vis[to] = true;
      solve (to);
    }
  }
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  F0R (i, m) {
    char tipo;
    int st, et;
    cin >> st >> et >> tipo;
    --st; --et;
    if (tipo == 'T') {
      g[st].eb(et);
      g[et].eb(st);
    } else {
      bus[st].eb(et);
      bus[et].eb(st);
    }
  }
  F0R (i, n) {
    if (!vis[i]) {
      dfs (i);
      ++group;
    }
  }
  int res = 0;
  F0R (i, N) {
    vis[i] = unique_color[i] = 0;
  }
  F0R (i, n) {
    if (!vis[i]) {
      Get = 0;
      solve (i);
      if (Get == group) valid_color[color[i]] = true;
      ++ordem_visita;
    }
  }
  F0R (i, n) {
    if (valid_color[color[i]]) ++res;
  }
  cout << res << '\n';
  return 0;
}

Compilation message

menesinis_bilietas.cpp: In function 'int main()':
menesinis_bilietas.cpp:115:30: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     vis[i] = unique_color[i] = 0;
              ~~~~~~~~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 444 ms 43768 KB Output is correct
2 Correct 21 ms 28288 KB Output is correct
3 Correct 20 ms 28288 KB Output is correct
4 Correct 25 ms 28288 KB Output is correct
5 Correct 20 ms 28288 KB Output is correct
6 Correct 71 ms 31224 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 28288 KB Output is correct
2 Correct 21 ms 28288 KB Output is correct
3 Correct 20 ms 28288 KB Output is correct
4 Correct 22 ms 28416 KB Output is correct
5 Correct 20 ms 28288 KB Output is correct
6 Correct 123 ms 32864 KB Output is correct
7 Correct 254 ms 42984 KB Output is correct
8 Correct 27 ms 28928 KB Output is correct
9 Correct 29 ms 28920 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 28288 KB Output is correct
2 Correct 20 ms 28288 KB Output is correct
3 Correct 20 ms 28288 KB Output is correct
4 Correct 21 ms 28408 KB Output is correct
5 Correct 23 ms 28540 KB Output is correct
6 Correct 21 ms 28416 KB Output is correct
7 Correct 20 ms 28288 KB Output is correct
8 Correct 21 ms 28288 KB Output is correct
9 Correct 24 ms 28544 KB Output is correct
10 Correct 20 ms 28288 KB Output is correct
11 Correct 21 ms 28288 KB Output is correct
12 Correct 20 ms 28288 KB Output is correct
13 Correct 21 ms 28288 KB Output is correct
14 Correct 20 ms 28288 KB Output is correct
15 Correct 21 ms 28288 KB Output is correct
16 Correct 21 ms 28288 KB Output is correct
17 Correct 20 ms 28288 KB Output is correct
18 Correct 21 ms 28288 KB Output is correct
19 Correct 20 ms 28288 KB Output is correct
20 Correct 22 ms 28416 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 28288 KB Output is correct
2 Correct 20 ms 28288 KB Output is correct
3 Correct 20 ms 28288 KB Output is correct
4 Correct 21 ms 28408 KB Output is correct
5 Correct 23 ms 28540 KB Output is correct
6 Correct 21 ms 28416 KB Output is correct
7 Correct 20 ms 28288 KB Output is correct
8 Correct 21 ms 28288 KB Output is correct
9 Correct 24 ms 28544 KB Output is correct
10 Correct 20 ms 28288 KB Output is correct
11 Correct 21 ms 28288 KB Output is correct
12 Correct 20 ms 28288 KB Output is correct
13 Correct 21 ms 28288 KB Output is correct
14 Correct 20 ms 28288 KB Output is correct
15 Correct 21 ms 28288 KB Output is correct
16 Correct 29 ms 28928 KB Output is correct
17 Correct 127 ms 33912 KB Output is correct
18 Correct 60 ms 30584 KB Output is correct
19 Correct 59 ms 31096 KB Output is correct
20 Correct 44 ms 30072 KB Output is correct
21 Correct 87 ms 31352 KB Output is correct
22 Correct 21 ms 28288 KB Output is correct
23 Correct 20 ms 28288 KB Output is correct
24 Correct 21 ms 28288 KB Output is correct
25 Correct 20 ms 28288 KB Output is correct
26 Correct 22 ms 28416 KB Output is correct
27 Correct 20 ms 28288 KB Output is correct
28 Correct 27 ms 28928 KB Output is correct
29 Correct 29 ms 28920 KB Output is correct
30 Correct 71 ms 31224 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 28288 KB Output is correct
2 Correct 20 ms 28288 KB Output is correct
3 Correct 20 ms 28288 KB Output is correct
4 Correct 21 ms 28408 KB Output is correct
5 Correct 23 ms 28540 KB Output is correct
6 Correct 21 ms 28416 KB Output is correct
7 Correct 20 ms 28288 KB Output is correct
8 Correct 21 ms 28288 KB Output is correct
9 Correct 24 ms 28544 KB Output is correct
10 Correct 20 ms 28288 KB Output is correct
11 Correct 21 ms 28288 KB Output is correct
12 Correct 20 ms 28288 KB Output is correct
13 Correct 21 ms 28288 KB Output is correct
14 Correct 20 ms 28288 KB Output is correct
15 Correct 21 ms 28288 KB Output is correct
16 Correct 29 ms 28928 KB Output is correct
17 Correct 127 ms 33912 KB Output is correct
18 Correct 60 ms 30584 KB Output is correct
19 Correct 59 ms 31096 KB Output is correct
20 Correct 44 ms 30072 KB Output is correct
21 Correct 87 ms 31352 KB Output is correct
22 Correct 444 ms 43768 KB Output is correct
23 Correct 21 ms 28288 KB Output is correct
24 Correct 20 ms 28288 KB Output is correct
25 Correct 25 ms 28288 KB Output is correct
26 Correct 21 ms 28288 KB Output is correct
27 Correct 20 ms 28288 KB Output is correct
28 Correct 22 ms 28416 KB Output is correct
29 Correct 20 ms 28288 KB Output is correct
30 Correct 123 ms 32864 KB Output is correct
31 Correct 254 ms 42984 KB Output is correct
32 Correct 51 ms 30712 KB Output is correct
33 Correct 282 ms 37240 KB Output is correct
34 Correct 220 ms 35448 KB Output is correct
35 Correct 27 ms 28928 KB Output is correct
36 Correct 29 ms 28920 KB Output is correct
37 Correct 71 ms 31224 KB Output is correct