# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568043 | 2022-05-24T14:29:17 Z | LittleCube | Making Friends on Joitter is Fun (JOI20_joitter2) | C++14 | 1 ms | 468 KB |
#include <bits/stdc++.h> #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define F first #define S second using namespace std; int N, M, adj[2005][2005]; vector<pii> v; signed main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> N >> M; for(int i = 1; i <= M; i++) { int A, B, ans = 0; cin >> A >> B; adj[A][B] = 1; v.emplace_back(pii(A, B)); for(int j = 0; j < v.size(); j++) { auto [x, y] = v[j]; for(int z = 1; z <= N; z++) if(adj[y][z] && adj[z][y] && x != z && adj[x][z] == 0) { adj[x][z] = 1; v.emplace_back(pii(x, z)); } } for(int x = 1; x <= N; x++) for(int y = 1; y <= N; y++) if(adj[x][y]) for(int z = 1; z <= N; z++) if(adj[y][z] && adj[z][y] && x != z && adj[x][z] == 0) assert(false); cout << v.size() << '\n'; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |