제출 #850701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850701		d4xn	Inside information (BOI21_servers)	C++17	5 / 100	2560 ms	524288 KiB

servers

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include <bits/stdc++.h>

using namespace std;

const int N = 5e4;

int n, k;
bitset<N> bt[N];

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    bt[i][i] = 1;
  }

  for (int i = 0; i < n+k-1; i++) {
    char tp;
    cin >> tp;
    if (tp == 'S') {
      int x, y;
      cin >> x >> y;
      x--; y--;

      // bt[x] = bt[y] = (bt[x] | bt[y]);
      bt[x] |= bt[y];
      bt[y] |= bt[x];
    }
    else if (tp == 'Q') {
      int x, z;
      cin >> x >> z;
      x--; z--;

      if (bt[x][z]) cout << "yes\n";
      else cout << "no\n";
    }
    else {
      int z;
      cin >> z;
      z--;

      int ans = 0;
      for (int i = 0; i < n; i++) {
        if (bt[i][z]) ans++;
      }
      cout << ans << "\n";
    }
  }
}

• Subtask 1: 2.5 / 2.5
• Subtask 2: 2.5 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5