제출 #557536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557536		Mounir	Inside information (BOI21_servers)	C++14	5 / 100	256 ms	32296 KiB

servers

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;
 
const int N = 4005;
bool la[N][N];
int np[N];
 
signed main(){  
      int nServs, nReqs; cin >> nServs >> nReqs;
      for (int i = 1; i <= nServs; ++i)
            la[i][i] = true, np[i] = 1;
      nReqs += nServs - 1;
      while (nReqs--){
            char typeReq; cin >> typeReq;
            if (typeReq == 'S'){
                  int a, b; cin >> a >> b;
                  for (int i = 1; i <= nServs; ++i){
                        np[i] -= (la[a][i] + la[b][i]);
                        la[a][i] = la[b][i] = (la[a][i]|la[b][i]);
                        np[i] += (la[a][i] + la[b][i]);
                  }
            }
            else if (typeReq == 'Q'){
                  int a, d; cin >> a >> d;
                  if (la[a][d]) cout << "yes" << endl;
                  else cout << "no" << endl;
            }
            else {
                  int d; cin >> d;
                  cout << np[d] << endl;
            }
      }
      return 0;   
}

• 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