oj.uz

Submission #1062540

# Submission time Handle Problem Language Result Execution time Memory
1062540 2024-08-17T08:24:10 Z TlenekWodoru Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 133 ms 24152 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
int spojna[1009];
int spojna2[1009];
int maxx[1009];
vector<int>V[1009];
int n,h1,h2;
int construct(vector<vector<int>> p)
{
    n=p.size();
    vector<vector<int>>graf(n,vector<int>(n,0));
    for(int i=0;i<n;i++)
    {
        if(p[i][i]!=1){return 0;}
        for(int j=i+1;j<n;j++)
        {
            if(p[i][j]!=p[j][i]||p[i][j]==3){return 0;}
        }
    }
    h1=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<i;j++)
        {
            if(p[i][j]==0||i==j){continue;}
            if(spojna[i]!=0&&spojna[i]!=spojna[j]){return 0;}
            else if(spojna[i]==0){spojna[i]=spojna[j];}
        }
        if(spojna[i]==0){spojna[i]=++h1;}
    }
    h2=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<i;j++)
        {
            if(p[i][j]!=1||i==j){continue;}
            if(spojna2[i]!=0&&spojna2[i]!=spojna2[j]){return 0;}
            else if(spojna2[i]==0){spojna2[i]=spojna2[j];}
        }
        if(spojna2[i]==0){spojna2[i]=++h2;}
    }
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(spojna[i]==spojna[j]&&p[i][j]==0){return 0;}
            if(spojna2[i]==spojna2[j]&&p[i][j]!=1){return 0;}
            if(spojna2[i]==spojna2[j]&&spojna[i]!=spojna[j]){return 0;}
            if(spojna[i]==spojna[j]&&spojna2[i]!=spojna2[j]&&p[i][j]!=2){return 0;}
        }
    }
    memset(maxx,-1,sizeof(maxx));
    for(int i=0;i<n;i++)
    {
        maxx[spojna2[i]]=max(maxx[spojna2[i]],i);
    }
    for(int i=0;i<n;i++)
    {
        int u=maxx[spojna2[i]];
        if(u==i){continue;}
        graf[i][u]=1;
        graf[u][i]=1;
    }
    for(int i=1;i<=h1;i++)
    {
        vector<int>U;
        for(int j=0;j<n;j++)
        {
            if(spojna[j]!=i||maxx[spojna2[j]]!=j){continue;}
            U.push_back(j);
        }
        if((int)U.size()<=1){continue;}
        for(int j=0;j<(int)U.size();j++)
        {
            int u=U[j],last;
            if(j==0){last=U.back();}
            else{last=U[j-1];}
            graf[u][last]=1;
            graf[last][u]=1;
        }
    }
    build(graf);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 114 ms 23968 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 114 ms 23968 KB Output is correct
8 Correct 1 ms 856 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 344 KB Output is correct
12 Correct 5 ms 1404 KB Output is correct
13 Correct 115 ms 24080 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 56 ms 14244 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 6300 KB Output is correct
21 Correct 117 ms 24144 KB Output is correct
22 Correct 112 ms 24152 KB Output is correct
23 Correct 133 ms 24084 KB Output is correct
24 Correct 115 ms 24144 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 50 ms 14028 KB Output is correct
27 Correct 119 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Incorrect 1 ms 344 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 29 ms 6224 KB Output is correct
5 Correct 122 ms 24144 KB Output is correct
6 Correct 113 ms 24144 KB Output is correct
7 Correct 120 ms 24020 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 30 ms 6228 KB Output is correct
10 Correct 115 ms 24148 KB Output is correct
11 Correct 117 ms 23888 KB Output is correct
12 Correct 132 ms 24148 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 29 ms 6424 KB Output is correct
17 Correct 115 ms 24144 KB Output is correct
18 Correct 119 ms 24148 KB Output is correct
19 Correct 114 ms 24148 KB Output is correct
20 Correct 115 ms 24148 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 114 ms 23968 KB Output is correct
8 Correct 1 ms 856 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 344 KB Output is correct
12 Correct 5 ms 1404 KB Output is correct
13 Correct 115 ms 24080 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 56 ms 14244 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 6300 KB Output is correct
21 Correct 117 ms 24144 KB Output is correct
22 Correct 112 ms 24152 KB Output is correct
23 Correct 133 ms 24084 KB Output is correct
24 Correct 115 ms 24144 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 50 ms 14028 KB Output is correct
27 Correct 119 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Incorrect 1 ms 344 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 114 ms 23968 KB Output is correct
8 Correct 1 ms 856 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 344 KB Output is correct
12 Correct 5 ms 1404 KB Output is correct
13 Correct 115 ms 24080 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 56 ms 14244 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 6300 KB Output is correct
21 Correct 117 ms 24144 KB Output is correct
22 Correct 112 ms 24152 KB Output is correct
23 Correct 133 ms 24084 KB Output is correct
24 Correct 115 ms 24144 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 50 ms 14028 KB Output is correct
27 Correct 119 ms 24144 KB Output is correct
28 Correct 115 ms 24148 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Incorrect 1 ms 344 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -