# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567992 | LittleCube | Making Friends on Joitter is Fun (JOI20_joitter2) | C++14 | 0 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(auto [x, y] : v)
for(int z = 1; z <= N; z++)
if(adj[y][z] && adj[z][y] && x != z && adj[x][z] == 0)
{
adj[x][z] = 2;
v.emplace_back(pii(x, z));
}
cout << v.size() << '\n';
v.resize(i);
for(int x = 1; x <= N; x++)
for(int y = 1; y <= N; y++)
{
ans += adj[x][y] > 0;
if(adj[x][y] == 2)
adj[x][y] = 0;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |