# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027202 | pdao | One-Way Streets (CEOI17_oneway) | C++17 | 0 ms | 344 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>
#define int long long
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
signed main() {
int n, m, p;
cin >> n >> m;
vector<vector<pii>> adj(n + 1, vector<pii>(0));
vector<pii> changes (0);
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].pb({v, i});
adj[v].pb({u, i});
}
cin >> p;
for (int i = 0; i < p; i++) {
int l, r;
cin >> l >> r;
changes.pb({l, r});
}
char str[m];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |