# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117570 | johutha | One-Way Streets (CEOI17_oneway) | C++14 | 499 ms | 38216 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 <vector>
#include <iostream>
#include <algorithm>
#define int int64_t
using namespace std;
struct edge
{
int from, to, nr;
bool bridge = false;
char ch = 'U';
int getend(int fr)
{
if (fr == from) return to;
return from;
}
bool l = false;
bool r = false;
void print()
{
cout << from << " -> " << to << ", b=" << bridge << ", lr=" << l << r << "\n";
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |