# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821141 | alexander707070 | Marshmallow Molecules (CCO19_day2problem2) | C++14 | 4045 ms | 85512 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 100007
using namespace std;
int n,m,a[MAXN],b[MAXN],ans;
bool between[5007][5007];
vector<int> lines[MAXN];
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a[i]>>b[i];
between[a[i]][b[i]]++;
lines[a[i]].push_back(b[i]);
}
for(int i=1;i<=n;i++){
sort(lines[i].begin(),lines[i].end());
for(int f=0;f<lines[i].size();f++){
for(int k=f+1;k<lines[i].size();k++){
if(!between[lines[i][f]][lines[i][k]]){
ans++;
between[lines[i][f]][lines[i][k]]=true;
lines[lines[i][f]].push_back(lines[i][k]);
}
}
}
}
cout<<ans+m<<"\n";
return 0;
}
Compilation message (stderr)
# | 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... |