Submission #74030567

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

// #include <atcoder/all>
// using mint = atcoder::modint998244353;
// using namespace atcoder;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    
    set<int> st;
    for (int i=0; i<k; i++) st.insert(i);

    vector<int> a(m), b(m);
    for (int i=0; i<m; i++) {
      cin >> a[i] >> b[i];
      a[i]--; b[i]--;
      
      if (st.contains(a[i]) || st.contains(b[i])) {
        st.insert(a[i]);
        st.insert(b[i]);
      }
    }
    
    cout << st.size() << endl;
    
    

    return 0;
}

Submission Info

Judge Result