# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226849 | MKopchev | Making Friends on Joitter is Fun (JOI20_joitter2) | C++14 | 5092 ms | 588 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>
using namespace std;
const int nmax=2e3+42;
int n,m;
long long output=0;
bool adj[nmax][nmax];
void add(int u,int v)
{
if(adj[u][v])return;
adj[u][v]=1;
output++;
while(1)
{
bool stop=1;
for(int x=1;x<=n;x++)
for(int y=1;y<=n;y++)
for(int z=1;z<=n;z++)
if(x!=y&&x!=z&&y!=z&&adj[x][y]&&adj[y][z]&&adj[z][y]&&adj[x][z]==0)
{
output++;
adj[x][z]=1;
stop=0;
}
if(stop)return;
}
}
int main()
{
scanf("%i%i",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%i%i",&u,&v);
add(u,v);
printf("%lld\n",output);
}
return 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... |