Submission #13249440

---

Source Code Expand

#include<iostream>
#include<cmath>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>

using namespace std;

typedef long long ll;

typedef std::pair<int, int> ipair;
bool lessPair(const ipair& l, const ipair& r){return l.second < r.second;}
bool morePair(const ipair& l, const ipair& r){return l.second > r.second;}

template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const ll MOD = 1e9 + 7;
// const long long INF = 1LL<<60;
void add(long long &a, long long b) { a += b; if (a >= MOD) a -= MOD; }
void sub(long long &a, long long b) { a -= b; if (a < 0) a += MOD; }
void mul(long long &a, long long b) { a *= b; a %= MOD; }
ll llmin(ll a, ll b) { if (a < b) return a; else return b; }
ll llmax(ll a, ll b) { if (a < b) return b; else return a; }
ll llabs(ll a) { if (a >= 0) return a; else return - a; }
ll llmodpow(ll a, ll n) {
   if (n == 0) return 1;
   ll tmp = llmodpow(a, n / 2);
   mul(tmp, tmp);
   if (n & 1) mul(tmp, a);
   return tmp;
}

int main() {
   int N, Q;
   cin >> N >> Q;
   char F[N][N];
   fill(F[0], F[N], 'N');
   int s, a, b;
   for (int q = 0; q < Q; q++) {
      cin >> s;
      if (s == 1) {
         cin >> a >> b;
         a--;
         b--;
         F[a][b] = 'Y';
      } else if (s == 2) {
         cin >> a;
         a--;
         for (int i = 0; i < N; i++) {
            if (F[i][a] == 'Y') F[a][i] = 'Y';
         }
      } else {
         cin >> a;
         a--;
         stack<int> st;
         for (int i = 0; i < N; i++) {
            if (F[a][i] == 'Y') {
               st.push(i);
            }
         }
         while (!st.empty()) {
            int i = st.top();
            st.pop();
            for (int j = 0; j < N; j++) {
               if (F[i][j] == 'Y') {
                  // cout << i << " " << j << endl;
                  F[a][j] = 'Y';
               }
            }
         }
      }
   }
   for (int i = 0; i < N; i++) F[i][i] = 'N';
   for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
         cout << F[i][j];
      }
      cout << endl;
   }
   return 0;
}

Submission Info

Judge Result