# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469254 | islingr | One-Way Streets (CEOI17_oneway) | C++17 | 77 ms | 15424 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 <bits/stdc++.h>
using namespace std;
template<class T> bool uin(T& a, const T& b) { return a > b ? a = b, true : false; }
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
vector<int> l(m), r(m), in(n), low(n), s(n);
for (int e = 0; e < m; ++e) {
cin >> l[e] >> r[e]; --l[e]; --r[e];
g[l[e]].push_back(e);
g[r[e]].push_back(e);
}
int q; cin >> q;
while (q--) {
int u, v; cin >> u >> v; --u; --v;
++s[u]; --s[v];
}
string ans(m, 'B');
int timer = 0;
constexpr char dir[2] = {'L', 'R'};
auto dfs = [&](const auto &self, int u, int p) -> void {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |