# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097488 | alexander707070 | Newspapers (CEOI21_newspapers) | C++14 | 1078 ms | 221520 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 MAXN 200007
using namespace std;
int n,m,a,b;
vector<int> v[MAXN],to[1<<22];
bool li[1<<22];
bool dfs(int x,int y){
if(x==y)return true;
li[x]=true;
for(int i:to[x]){
if(!li[i] and dfs(i,y))return true;
}
return false;
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b;
a--; b--;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=0;i<(1<<n);i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |