# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3878 | Qwaz | Cactus? Not cactus? (kriii1_C) | C++98 | 68 ms | 11856 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 <cstdio>
#include <vector>
struct edge {
int to, num;
};
const int MAX=100020;
int n, m;
std::vector < edge > to[MAX];
void input(){
scanf("%d%d", &n, &m);
int i;
for(i=0; i<m; i++){
int f, s;
scanf("%d%d", &f, &s);
edge t;
t.num = i;
t.to = s;
to[f].push_back(t);
t.to = f;
to[s].push_back(t);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |