| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 821259 | alexander707070 | Marshmallow Molecules (CCO19_day2problem2) | C++14 | 43 ms | 6728 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,br[MAXN];
vector<int> lines[MAXN];
int main(){
    
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a[i]>>b[i];
        lines[b[i]].push_back(a[i]);
    }
    for(int i=1;i<=n;i++){
        for(int f=0;f<lines[i].size();f++){
            ans+=br[lines[i][f]];
        }
        for(int f=0;f<lines[i].size();f++){
            br[lines[i][f]]++;
        }
    }
    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... | ||||
