oj.uz

Submission #217158

# Submission time Handle Problem Language Result Execution time Memory
217158 2020-03-29T07:03:22 Z fedoseevtimofey Making Friends on Joitter is Fun (JOI20_joitter2) C++14
1 / 100
 5000 ms 632 KB 
#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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 818 ms 632 KB Output is correct
8 Correct 807 ms 440 KB Output is correct
9 Correct 806 ms 504 KB Output is correct
10 Correct 36 ms 384 KB Output is correct
11 Correct 42 ms 384 KB Output is correct
12 Correct 31 ms 384 KB Output is correct
13 Correct 39 ms 504 KB Output is correct
14 Correct 37 ms 384 KB Output is correct
15 Correct 38 ms 384 KB Output is correct
16 Correct 37 ms 384 KB Output is correct
17 Correct 36 ms 384 KB Output is correct
18 Correct 33 ms 384 KB Output is correct
19 Correct 36 ms 384 KB Output is correct
20 Correct 96 ms 504 KB Output is correct
21 Correct 790 ms 384 KB Output is correct
22 Correct 102 ms 384 KB Output is correct
23 Correct 341 ms 384 KB Output is correct
24 Correct 145 ms 384 KB Output is correct
25 Correct 652 ms 384 KB Output is correct
26 Correct 21 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 26 ms 384 KB Output is correct
29 Correct 26 ms 384 KB Output is correct
30 Correct 35 ms 384 KB Output is correct
31 Correct 673 ms 632 KB Output is correct
32 Correct 41 ms 384 KB Output is correct
33 Correct 658 ms 384 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 818 ms 632 KB Output is correct
8 Correct 807 ms 440 KB Output is correct
9 Correct 806 ms 504 KB Output is correct
10 Correct 36 ms 384 KB Output is correct
11 Correct 42 ms 384 KB Output is correct
12 Correct 31 ms 384 KB Output is correct
13 Correct 39 ms 504 KB Output is correct
14 Correct 37 ms 384 KB Output is correct
15 Correct 38 ms 384 KB Output is correct
16 Correct 37 ms 384 KB Output is correct
17 Correct 36 ms 384 KB Output is correct
18 Correct 33 ms 384 KB Output is correct
19 Correct 36 ms 384 KB Output is correct
20 Correct 96 ms 504 KB Output is correct
21 Correct 790 ms 384 KB Output is correct
22 Correct 102 ms 384 KB Output is correct
23 Correct 341 ms 384 KB Output is correct
24 Correct 145 ms 384 KB Output is correct
25 Correct 652 ms 384 KB Output is correct
26 Correct 21 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 26 ms 384 KB Output is correct
29 Correct 26 ms 384 KB Output is correct
30 Correct 35 ms 384 KB Output is correct
31 Correct 673 ms 632 KB Output is correct
32 Correct 41 ms 384 KB Output is correct
33 Correct 658 ms 384 KB Output is correct
34 Execution timed out 5074 ms 508 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 818 ms 632 KB Output is correct
8 Correct 807 ms 440 KB Output is correct
9 Correct 806 ms 504 KB Output is correct
10 Correct 36 ms 384 KB Output is correct
11 Correct 42 ms 384 KB Output is correct
12 Correct 31 ms 384 KB Output is correct
13 Correct 39 ms 504 KB Output is correct
14 Correct 37 ms 384 KB Output is correct
15 Correct 38 ms 384 KB Output is correct
16 Correct 37 ms 384 KB Output is correct
17 Correct 36 ms 384 KB Output is correct
18 Correct 33 ms 384 KB Output is correct
19 Correct 36 ms 384 KB Output is correct
20 Correct 96 ms 504 KB Output is correct
21 Correct 790 ms 384 KB Output is correct
22 Correct 102 ms 384 KB Output is correct
23 Correct 341 ms 384 KB Output is correct
24 Correct 145 ms 384 KB Output is correct
25 Correct 652 ms 384 KB Output is correct
26 Correct 21 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 26 ms 384 KB Output is correct
29 Correct 26 ms 384 KB Output is correct
30 Correct 35 ms 384 KB Output is correct
31 Correct 673 ms 632 KB Output is correct
32 Correct 41 ms 384 KB Output is correct
33 Correct 658 ms 384 KB Output is correct
34 Execution timed out 5074 ms 508 KB Time limit exceeded
35 Halted 0 ms 0 KB -