이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> adj;
bitset<50> st, stck;
long long ans;
void dfs (int u, int k) {
if (u == k) {
st |= stck;
}
stck[u] = 1;
for (int v : adj[u]) {
if (!stck[v]) {
dfs(v, k);
}
}
stck[u] = 0;
}
int main (){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("SuhaibSawalha1","r",stdin);
cin >> n >> m;
adj.resize(n);
while (m--) {
int u, v;
cin >> u >> v, --u, --v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int u = 0; u < n; ++u) {
for (int v = 0; v < n; ++v) {
if (u ^ v) {
dfs(u, v);
ans += max(0, (int)st.count() - 1);
st.reset();
}
}
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |