# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7360 | netsion | 경비원 (GA8_guard) | C++98 | 2000 ms | 20712 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 <stdio.h>
int data[2240];
int map1[2240][2240];
int now,n;
int ndata[2240];
int tot=0;
int check[2240];
void aa(int cnt,int la)
{
int i,j;
if(cnt==now)
{
for(i=0; i<cnt; i++)
{
for(j=i; j<cnt; j++)
{
if(i==j) continue;
if(map1[ndata[i]][ndata[j]]!=1) return;
}
}
tot++;
return;
}
for(i=la; i<=n; i++)
{
if(check[i]==0)
{
check[i]=1;
ndata[cnt]=i;
aa(cnt+1,i);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |