# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212759 | Alexa2001 | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 1326 ms | 1048580 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>
using namespace std;
typedef long long ll;
const int Nmax = 1e5 + 5;
set<int> in[Nmax], cIn[Nmax], cOut[Nmax];
vector<int> who[Nmax];
int n, m;
int where[Nmax];
ll ans = 0;
ll take2(int x)
{
return (ll) x * (x-1);
}
void unite(int x, int y)
{
if(x == y) return;
if(cIn[x].find(y) == cIn[x].end() || cOut[x].find(y) == cOut[x].end()) return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |