| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 2832 | ansol4328 | 간선 파괴 (GA5_destroy) | C++98 | 2500 ms | 3012 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<stdio.h>
#include<memory.h>
#include<stdlib.h>
int n, m, xy[702][702];
int cnt;
int bfs(int l, int e)
{
int q[702], check[702], f, r, num;
int i ,j;
int c=0;
memset(check,0,sizeof(check));
for(i=1 ; i<=n ; i++)
{
if(check[i]==0)
{
c++;
f=0;
r=1;
q[r]=i;
check[i]=1;
do
{
f++;
num=q[f];
for(j=1 ; j<=n ; j++)
{
if((xy[num][j]!=0 && xy[num][j]<l && check[j]==0) || (xy[num][j]!=0 && xy[num][j]>e && check[j]==0))
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||