oj.uz

Submission #1041890

# Submission time Handle Problem Language Result Execution time Memory
1041890 2024-08-02T09:30:51 Z MarwenElarbi Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 115 ms 28244 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int nax=1005;
vector<int> adj[nax];
vector<int> comp[nax];
int parent[nax];
int find(int x){
    if(x==parent[x]) return x;
    return parent[x]=find(parent[x]);
}
bool sameset(int x,int y){
    return find(x)==find(y);
}
void joinset(int x,int y){
    x=find(x);
    y=find(y);
    if(comp[y].size()<comp[x].size()) swap(comp[x],comp[y]);
    for(auto u:comp[x]) comp[y].pb(u);
    parent[x]=y;
}
int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    std::vector<std::vector<int>> ans(n,vector<int> (n,0));
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            if(p[i][j]>0) adj[i].pb(j);
        }
    }
    for (int i = 0; i < n; ++i)
    {
        parent[i]=i;
    }
    for (int i = 0; i < n; ++i)
    {
        for(auto u:adj[i])
            if(!sameset(u,i)) joinset(u,i);
    }
    bool test=true;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            if(p[i][j]==0&&sameset(i,j)) test=false;
        }
    }
    if(!test) return test;
    for (int i = 0; i < n; ++i)
    {
        parent[i]=i;
        adj[i].clear();
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            if(p[i][j]==1) adj[i].pb(j);
        }
    }
    for (int i = 0; i < n; ++i)
    {
        for(auto u:adj[i])
            if(!sameset(u,i)) joinset(u,i);
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            if(p[i][j]==2&&sameset(i,j)) test=false;
        }
    }
    if(!test) return test;
    for (int i = 0; i < n; ++i)
    {
        if(comp[find(i)].empty()) comp[find(i)].pb(find(i));
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if(i==j) continue;
            if(p[i][j]==2&&!sameset(i,j)){
                joinset(i,j);
            }
        }
    }
    bool vis[n];
    memset(vis,0,sizeof vis);
    for (int i = 0; i < n; ++i)
    {
        if(!vis[find(i)]){
            int x=find(i);
            vis[x]=true;
            if(comp[x].size()==1) continue;
            if(comp[x].size()==2){
                test=false;
                break;
            }
            for (int j = 0; j < comp[x].size(); ++j)
            {
                adj[comp[x][j]].pb(comp[x][(j+1)%(int)comp[x].size()]);
                adj[comp[x][(j+1)%(int)comp[x].size()]].pb(comp[x][j]);
            }
        }
    }
    if(!test) return 0;
    for (int i = 0; i < n; ++i)
    {
        for(auto u:adj[i]) ans[i][u]=1;
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:106:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |             for (int j = 0; j < comp[x].size(); ++j)
      |                             ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.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 Incorrect 0 ms 348 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.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 Incorrect 0 ms 348 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 0 ms 488 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 101 ms 23996 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 107 ms 28244 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 984 KB Output is correct
17 Correct 61 ms 16700 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 28 ms 6328 KB Output is correct
22 Correct 110 ms 24512 KB Output is correct
23 Correct 101 ms 24144 KB Output is correct
24 Correct 115 ms 27216 KB Output is correct
25 Correct 52 ms 14132 KB Output is correct
26 Correct 50 ms 14760 KB Output is correct
27 Correct 103 ms 24144 KB Output is correct
28 Correct 111 ms 26196 KB Output is correct
29 Correct 45 ms 14160 KB Output is correct

Subtask #4
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 Incorrect 0 ms 348 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 Incorrect 0 ms 348 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 Incorrect 0 ms 348 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -