# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2795 | mhkim4886 | 간선 파괴 (GA5_destroy) | C++98 | 28 ms | 3668 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 <algorithm>
typedef struct _edge
{
int start, end;
int num;
} Edge;
bool Compare(const Edge &a, const Edge &b)
{
return a.start < b.start;
}
int main()
{
int V, E, Q, dst[60000][3];
Edge edge[150000];
scanf("%d %d", &V, &E);
for(int i = 1; i <= E; i++)
{
int a, b;
scanf("%d %d", &a, &b);
if(a <= b)
{
edge[i].start = a;
edge[i].end = b;
edge[i].num = i;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |