| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 930393 | boris_mihov | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 51 ms | 856 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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <set>
#include <map>
typedef long long llong;
const int MAXN = 50 + 10;
const int MAXM = 30000 + 10;
const int MOD = 1e9 + 7;
int n, m;
bool active[MAXN][MAXN];
int from[MAXM];
int to[MAXM];
void run()
{
bool shouldCall = false;
for (int x1 = 1 ; x1 <= n ; ++x1)
{
for (int x2 = 1 ; x2 <= n ; ++x2)
{
for (int x3 = 1 ; x3 <= n ; ++x3)
{
if (x1 == x2 || x2 == x3 || x1 == x3) continue;
if (active[x1][x2] && active[x2][x3] && active[x3][x2] && !active[x1][x3])
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||