# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7761 | studenttest | 간선 파괴 (GA5_destroy) | C++98 | 2500 ms | 2672 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<vector>
using namespace std;
//for 60point code;
struct line{
line(){}
line(int en,int c):en(en),c(c){}
int en,c;
};
vector <line> edge[550];
int V,E,r,l,q,wr,re,Q[550];
int check[550];
void BFS(int x)
{
Q[0]=x;wr=1;re=0;check[x]=q+1;
while(wr!=re){
int i,sz=edge[Q[re]].size();
for(i=0;i<sz;i++){
line tx=edge[Q[re]][i];
if(check[tx.en]==q+1 || (tx.c>=l&&tx.c<=r))continue;
Q[wr++]=tx.en;
check[tx.en]=q+1;
}
re++;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |