# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401412 | 2021-05-10T07:31:00 Z | Hazem | Duathlon (APIO18_duathlon) | C++14 | 1000 ms | 1048580 KB |
#include <bits/stdc++.h> using namespace std; #define LL long long #define F first #define S second #define pii pair<int,int> #define piii pair<pair<int,int>,int> const int N = 2e5+10; const int M = 200; const LL INF = 1e9; const LL LINF = 1e14; const LL MOD = 1e9+7; const double PI = 3.141592653589793; vector<int>adj[N]; LL sizes[N],n,m; bool vis[N]; LL dfs(int i,int pre){ vis[i] = 1; LL ret = 0; for(auto x:adj[i]) if(x!=pre){ ret += dfs(x,i); sizes[i] += sizes[x]; } LL cur = n-1; for(auto x:adj[i]){ LL v = 0; if(x==pre)v = n-sizes[i]-1; else v = sizes[x]; cur -= v; ret += cur*v; } sizes[i]++; return ret; } int main(){ //freopen("out.txt","w",stdout); scanf("%d%d",&n,&m); for(int i=1;i<=m;i++){ int u,v; scanf("%d%d",&u,&v); adj[u].push_back(v); adj[v].push_back(u); } LL ans = 0; for(int i=1;i<=n;i++) if(!vis[i]) ans += dfs(i,i); printf("%lld\n",ans*2); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 526 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 526 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1123 ms | 676516 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 4940 KB | Output is correct |
2 | Correct | 4 ms | 4940 KB | Output is correct |
3 | Correct | 4 ms | 4940 KB | Output is correct |
4 | Correct | 4 ms | 5068 KB | Output is correct |
5 | Correct | 4 ms | 5068 KB | Output is correct |
6 | Correct | 4 ms | 5068 KB | Output is correct |
7 | Correct | 4 ms | 5072 KB | Output is correct |
8 | Correct | 4 ms | 5068 KB | Output is correct |
9 | Correct | 4 ms | 5024 KB | Output is correct |
10 | Incorrect | 4 ms | 4940 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 55 ms | 9080 KB | Output is correct |
2 | Correct | 56 ms | 9088 KB | Output is correct |
3 | Correct | 56 ms | 9000 KB | Output is correct |
4 | Correct | 56 ms | 9040 KB | Output is correct |
5 | Correct | 56 ms | 9040 KB | Output is correct |
6 | Correct | 64 ms | 14008 KB | Output is correct |
7 | Correct | 64 ms | 12344 KB | Output is correct |
8 | Correct | 64 ms | 11504 KB | Output is correct |
9 | Correct | 60 ms | 10684 KB | Output is correct |
10 | Incorrect | 54 ms | 9028 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 5052 KB | Output is correct |
2 | Correct | 4 ms | 4944 KB | Output is correct |
3 | Runtime error | 648 ms | 1048580 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 56 ms | 9056 KB | Output is correct |
2 | Correct | 58 ms | 8980 KB | Output is correct |
3 | Runtime error | 780 ms | 1048580 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 526 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 526 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |