| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19674 | myungwoo | 악수 (kriii4_D) | C++14 | 6 ms | 1720 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 lld;
const int MOD = 1e9+7;
int N;
int v[6][6], F[11];
lld sum, all;
bool V[6];
void ff(int n)
{
V[n] = 1;
for (int i=1;i<=N;i++) if (v[n][i] && !V[i]) ff(i);
}
bool is_con()
{
for (int i=1;i<=N;i++) V[i] = 0;
ff(1);
for (int i=1;i<=N;i++) if (!V[i]) return 0;
return 1;
}
void dfs(int left)
{
int turn = N*(N-1)/2 - left;
if (is_con()){
sum += turn*F[left];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||