#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
using pii=array<int,2>;
using tii=array<int,3>;
const ll inf=1e18;
const int N=5005;
int n,m,g[N][N],ans;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin>>n>>m;
for(int a,b,i=1;i<=m;i++){
cin>>a>>b;
g[a][b]=1;
}
for(int u=1;u<=n;u++){
vector<int> V;
for(int v=u+1;v<=n;v++) if(g[u][v]) V.emplace_back(v);
int sz=V.size();
for(int i=0;i<sz;i++) for(int j=i+1;j<sz;j++) g[V[i]][V[j]]=1;
}
for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) if(g[i][j]) ans++;
cout<<ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
324 KB |
Output is correct |
| 3 |
Correct |
1 ms |
720 KB |
Output is correct |
| 4 |
Correct |
1 ms |
724 KB |
Output is correct |
| 5 |
Correct |
2 ms |
724 KB |
Output is correct |
| 6 |
Correct |
2 ms |
724 KB |
Output is correct |
| 7 |
Correct |
1 ms |
724 KB |
Output is correct |
| 8 |
Correct |
1 ms |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
720 KB |
Output is correct |
| 11 |
Correct |
2 ms |
724 KB |
Output is correct |
| 12 |
Correct |
1 ms |
720 KB |
Output is correct |
| 13 |
Correct |
1 ms |
724 KB |
Output is correct |
| 14 |
Correct |
1 ms |
724 KB |
Output is correct |
| 15 |
Correct |
1 ms |
724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
324 KB |
Output is correct |
| 3 |
Correct |
1 ms |
720 KB |
Output is correct |
| 4 |
Correct |
1 ms |
724 KB |
Output is correct |
| 5 |
Correct |
2 ms |
724 KB |
Output is correct |
| 6 |
Correct |
2 ms |
724 KB |
Output is correct |
| 7 |
Correct |
1 ms |
724 KB |
Output is correct |
| 8 |
Correct |
1 ms |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
720 KB |
Output is correct |
| 11 |
Correct |
2 ms |
724 KB |
Output is correct |
| 12 |
Correct |
1 ms |
720 KB |
Output is correct |
| 13 |
Correct |
1 ms |
724 KB |
Output is correct |
| 14 |
Correct |
1 ms |
724 KB |
Output is correct |
| 15 |
Correct |
1 ms |
724 KB |
Output is correct |
| 16 |
Execution timed out |
4091 ms |
68192 KB |
Time limit exceeded |
| 17 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
468 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
324 KB |
Output is correct |
| 3 |
Correct |
1 ms |
720 KB |
Output is correct |
| 4 |
Correct |
1 ms |
724 KB |
Output is correct |
| 5 |
Correct |
2 ms |
724 KB |
Output is correct |
| 6 |
Correct |
2 ms |
724 KB |
Output is correct |
| 7 |
Correct |
1 ms |
724 KB |
Output is correct |
| 8 |
Correct |
1 ms |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
720 KB |
Output is correct |
| 11 |
Correct |
2 ms |
724 KB |
Output is correct |
| 12 |
Correct |
1 ms |
720 KB |
Output is correct |
| 13 |
Correct |
1 ms |
724 KB |
Output is correct |
| 14 |
Correct |
1 ms |
724 KB |
Output is correct |
| 15 |
Correct |
1 ms |
724 KB |
Output is correct |
| 16 |
Execution timed out |
4091 ms |
68192 KB |
Time limit exceeded |
| 17 |
Halted |
0 ms |
0 KB |
- |
