# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938980 | iskhakkutbilim | One-Way Streets (CEOI17_oneway) | C++17 | 306 ms | 39880 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;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 2e5;
const int mod = 1e9 + 7;
/*
5 6
1 2
1 2
4 3
2 3
1 3
5 1
2
4 5
1 3
*/
// BBRBBL
signed main(){
int n, m; cin >> n >> m;
vector<pair<int, int> > g[n+1];
vector<pair<int, int> > edge;
vector<int> dir(m, 0);
map<pair<int, int>, int> mp;
for(int i = 0;i < m; i++){
int a, b; cin >> a >> b;
edge.push_back({a, b});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |