Submission #217158

#	Time	Username	Problem	Language	Result	Execution time	Memory
217158		fedoseevtimofey	Making Friends on Joitter is Fun (JOI20_joitter2)	C++14	1 / 100	5074 ms	632 KiB

joitter2

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n, m;
  cin >> n >> m;
  vector <vector <int>> g(n, vector <int> (n));
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    g[u][v] = 1;
    bool fl = true;
    while (fl) {
      fl = false;
      for (int x = 0; x < n; ++x) {
        for (int y = 0; y < n; ++y) {
          for (int z = 0; z < n; ++z) {
            if (g[x][y] && g[y][z] && g[z][y]) {
              if (x != z && !g[x][z]) {
                g[x][z] = 1;
                fl = true;
              }
            }
          }
        }
      } 
    }
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        if (g[i][j]) {
          ++cnt;
        }
      }
    }
    cout << cnt << '\n';
  }
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 16
• Subtask 3: 0 / 83