# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2835 | mh5664 | 간선 파괴 (GA5_destroy) | C++98 | 2500 ms | 2676 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;
const int MAXN = 700;
vector<pair<int,int> > data[MAXN + 1];
int q[MAXN + 1];
int r = -1, f = -1;
bool ch[MAXN + 1];
int main ()
{
int n, m;
scanf ("%d %d", &n, &m);
for (int i = 0; i < m; ++i)
{
int x, y;
scanf ("%d %d", &x, &y);
data[x - 1].push_back (make_pair (y - 1, i + 1));
data[y - 1].push_back (make_pair (x - 1, i + 1));
}
int k;
scanf ("%d", &k);
for (int i = 0; i < k; ++i)
{
int x, y;
scanf ("%d %d", &x, &y);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |