| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1078776 | 2024-08-28T06:05:57 Z | Muhammad_Aneeq | 슈퍼트리 잇기 (IOI20_supertrees) | C++17 | 135 ms | 24144 KB |
#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p)
{
int n=p.size();
bool seen[n]={};
int head[n]={};
bool vis[n]={};
for (int i=0;i<n;i++)
head[i]=-1;
vector<vector<int>>b(n,vector<int>(n));
for (int i=0;i<n;i++)
{
if (!seen[i])
{
seen[i]=1;
head[i]=i;
for (int j=0;j<n;j++)
{
if (seen[j])
continue;
if (p[i][j]==1)
{
seen[j]=1;
b[i][j]=b[j][i]=1;
head[j]=i;
}
}
}
}
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
if (p[i][j]==1&&head[i]!=head[j])
return 0;
if (p[i][j]==0&&head[i]==head[j]&&head[i]!=-1)
return 0;
}
}
for (int i=0;i<n;i++)
{
if (vis[head[i]])
continue;
vector<int>x;
for (int j=0;j<n;j++)
{
if (p[i][j]==2&&!vis[head[j]])
{
x.push_back(head[j]);
vis[head[j]]=1;
}
}
if (x.size()<3)
continue;
int pa=head[i];
for (int j=0;j<x.size();j++)
{
int u=x[j],v=x[(j+1)%x.size()];
head[u]=head[v]=pa;
b[u][v]=b[v][u]=1;
}
}
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
int u=head[head[i]],v=head[head[j]];
if (u==v)
continue;
if (p[i][j]!=2&&b[u][v])
return 0;
if (p[i][j]==2&&!b[u][v])
return 0;
}
}
build(b);
return 1;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 6 ms | 1372 KB | Output is correct |
| 7 | Correct | 116 ms | 23476 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 6 ms | 1372 KB | Output is correct |
| 7 | Correct | 116 ms | 23476 KB | Output is correct |
| 8 | Correct | 0 ms | 344 KB | Output is correct |
| 9 | Correct | 0 ms | 348 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 5 ms | 1360 KB | Output is correct |
| 13 | Correct | 130 ms | 23380 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 348 KB | Output is correct |
| 16 | Correct | 3 ms | 860 KB | Output is correct |
| 17 | Correct | 58 ms | 13464 KB | Output is correct |
| 18 | Correct | 0 ms | 348 KB | Output is correct |
| 19 | Correct | 0 ms | 348 KB | Output is correct |
| 20 | Correct | 32 ms | 6276 KB | Output is correct |
| 21 | Correct | 128 ms | 23436 KB | Output is correct |
| 22 | Correct | 116 ms | 23376 KB | Output is correct |
| 23 | Correct | 128 ms | 23376 KB | Output is correct |
| 24 | Correct | 122 ms | 23412 KB | Output is correct |
| 25 | Correct | 70 ms | 13396 KB | Output is correct |
| 26 | Correct | 50 ms | 13508 KB | Output is correct |
| 27 | Correct | 135 ms | 23392 KB | Output is correct |
| 28 | Correct | 120 ms | 24144 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Incorrect | 0 ms | 348 KB | Answer gives possible 0 while actual possible 1 |
| 6 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 344 KB | Output is correct |
| 2 | Incorrect | 0 ms | 348 KB | Answer gives possible 0 while actual possible 1 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 6 ms | 1372 KB | Output is correct |
| 7 | Correct | 116 ms | 23476 KB | Output is correct |
| 8 | Correct | 0 ms | 344 KB | Output is correct |
| 9 | Correct | 0 ms | 348 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 5 ms | 1360 KB | Output is correct |
| 13 | Correct | 130 ms | 23380 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 348 KB | Output is correct |
| 16 | Correct | 3 ms | 860 KB | Output is correct |
| 17 | Correct | 58 ms | 13464 KB | Output is correct |
| 18 | Correct | 0 ms | 348 KB | Output is correct |
| 19 | Correct | 0 ms | 348 KB | Output is correct |
| 20 | Correct | 32 ms | 6276 KB | Output is correct |
| 21 | Correct | 128 ms | 23436 KB | Output is correct |
| 22 | Correct | 116 ms | 23376 KB | Output is correct |
| 23 | Correct | 128 ms | 23376 KB | Output is correct |
| 24 | Correct | 122 ms | 23412 KB | Output is correct |
| 25 | Correct | 70 ms | 13396 KB | Output is correct |
| 26 | Correct | 50 ms | 13508 KB | Output is correct |
| 27 | Correct | 135 ms | 23392 KB | Output is correct |
| 28 | Correct | 120 ms | 24144 KB | Output is correct |
| 29 | Correct | 0 ms | 348 KB | Output is correct |
| 30 | Correct | 0 ms | 348 KB | Output is correct |
| 31 | Correct | 0 ms | 348 KB | Output is correct |
| 32 | Correct | 0 ms | 348 KB | Output is correct |
| 33 | Incorrect | 0 ms | 348 KB | Answer gives possible 0 while actual possible 1 |
| 34 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 344 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 6 ms | 1372 KB | Output is correct |
| 7 | Correct | 116 ms | 23476 KB | Output is correct |
| 8 | Correct | 0 ms | 344 KB | Output is correct |
| 9 | Correct | 0 ms | 348 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 5 ms | 1360 KB | Output is correct |
| 13 | Correct | 130 ms | 23380 KB | Output is correct |
| 14 | Correct | 0 ms | 348 KB | Output is correct |
| 15 | Correct | 0 ms | 348 KB | Output is correct |
| 16 | Correct | 3 ms | 860 KB | Output is correct |
| 17 | Correct | 58 ms | 13464 KB | Output is correct |
| 18 | Correct | 0 ms | 348 KB | Output is correct |
| 19 | Correct | 0 ms | 348 KB | Output is correct |
| 20 | Correct | 32 ms | 6276 KB | Output is correct |
| 21 | Correct | 128 ms | 23436 KB | Output is correct |
| 22 | Correct | 116 ms | 23376 KB | Output is correct |
| 23 | Correct | 128 ms | 23376 KB | Output is correct |
| 24 | Correct | 122 ms | 23412 KB | Output is correct |
| 25 | Correct | 70 ms | 13396 KB | Output is correct |
| 26 | Correct | 50 ms | 13508 KB | Output is correct |
| 27 | Correct | 135 ms | 23392 KB | Output is correct |
| 28 | Correct | 120 ms | 24144 KB | Output is correct |
| 29 | Correct | 0 ms | 348 KB | Output is correct |
| 30 | Correct | 0 ms | 348 KB | Output is correct |
| 31 | Correct | 0 ms | 348 KB | Output is correct |
| 32 | Correct | 0 ms | 348 KB | Output is correct |
| 33 | Incorrect | 0 ms | 348 KB | Answer gives possible 0 while actual possible 1 |
| 34 | Halted | 0 ms | 0 KB | - |