# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585283 | krit3379 | One-Way Streets (CEOI17_oneway) | C++17 | 176 ms | 22196 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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005
struct A{
int a,flag,id;
};
int dp[N];
vector<A> g[N];
bitset<N> vis,cycle,both,res;
map<pair<int,int>,int> mp;
pair<int,int> edge[N];
void dfs(int s,int f){
vis[s]=true;
for(auto [x,flag,id]:g[s]){
if(x==f)continue;
if(vis[x]&&!cycle[id])cycle[id]=true,dp[s]++,dp[x]--;
else if(!vis[x])dfs(x,s);
}
}
void sol1(int s,int f){
vis[s]=true;
for(auto [x,flag,id]:g[s]){
if(x==f||vis[x])continue;
sol1(x,s);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |