Submission #1870558
Source Code Expand
#include <bits/stdc++.h> #define rank tipa_rank #define pb push_back #define mp make_pair #define ll long long #define ull unsigned long long #define INF 1000000000 #define EPS 1e-6 #define free tipa_free #define EPS2 1e-8 using namespace std; const ll MOD = INF + 7; using namespace std; ll ans = 0; int n , m; int visited[100000]; ll trees , cycles , free; vector<vector<int> > g(100000); int edgesCnt = 0 , verticesCnt; void dfs(int u) { verticesCnt++; visited[u] = 1; for(int i = 0; i < g[u].size(); i++) { edgesCnt++; int v = g[u][i]; if(!visited[v]) dfs(v); } } int main() { scanf("%d %d" , &n , &m); for(int i = 0; i < m; i++) { int u , v; scanf("%d %d" , &u , &v); u--;v--; g[u].pb(v); g[v].pb(u); } for(int i = 0; i < n; i++) { if(!visited[i]) { //edgesCnt++; edgesCnt = 0 , verticesCnt = 0; dfs(i); edgesCnt /= 2; if(!edgesCnt) free++; else if(edgesCnt == verticesCnt - 1) { trees++; } else cycles++; } } //cout << trees << " " << cycles << " " << free << endl; int x = n * 2 - 1; for(int i = 0; i < free; i++) { ans += x; x -= 2; } ans += cycles * (trees + cycles) + trees * (cycles + 2 * trees); cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | C - Squared Graph |
User | vjudge4 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1210 Byte |
Status | WA |
Exec Time | 76 ms |
Memory | 8960 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:34:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d" , &n , &m); ^ ./Main.cpp:38:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d" , &u , &v); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 800 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 2 ms | 2560 KB |
in10.txt | AC | 3 ms | 2944 KB |
in11.txt | AC | 2 ms | 2560 KB |
in12.txt | AC | 20 ms | 6016 KB |
in13.txt | AC | 20 ms | 6144 KB |
in14.txt | AC | 37 ms | 6144 KB |
in15.txt | AC | 6 ms | 3328 KB |
in16.txt | AC | 26 ms | 4608 KB |
in17.txt | WA | 22 ms | 5504 KB |
in18.txt | WA | 51 ms | 6784 KB |
in19.txt | AC | 41 ms | 6528 KB |
in2.txt | AC | 2 ms | 2560 KB |
in20.txt | AC | 41 ms | 6656 KB |
in21.txt | AC | 76 ms | 8960 KB |
in22.txt | AC | 48 ms | 5760 KB |
in23.txt | AC | 35 ms | 4864 KB |
in24.txt | AC | 3 ms | 2944 KB |
in25.txt | AC | 75 ms | 8960 KB |
in26.txt | AC | 2 ms | 2560 KB |
in27.txt | AC | 3 ms | 2560 KB |
in28.txt | AC | 75 ms | 8960 KB |
in3.txt | AC | 2 ms | 2560 KB |
in4.txt | AC | 2 ms | 2560 KB |
in5.txt | AC | 51 ms | 5632 KB |
in6.txt | AC | 5 ms | 3328 KB |
in7.txt | AC | 5 ms | 3072 KB |
in8.txt | WA | 8 ms | 3840 KB |
in9.txt | AC | 24 ms | 4736 KB |
sample1.txt | AC | 2 ms | 2560 KB |
sample2.txt | AC | 2 ms | 2560 KB |