oj.uz

Submission #733486

# Submission time Handle Problem Language Result Execution time Memory
733486 2023-04-30T23:20:02 Z tigar Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 1000 ms 1842072 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

typedef long long ll;
vector<int> jedan[1010], dva[1010];
bool check[1010];
int components[1010];
vector<int>lin, cc;
map<int, pair<int, int> >comp;

bool provera(int x, std::vector<std::vector<int>>p, int cmp)
{
    components[x]=cmp;
    lin.push_back(x);
    int n=p.size();
    for(int i=0; i<jedan[x].size(); i++)
    {
        if(check[jedan[x][i]])continue;
        check[jedan[x][i]]=true;
        components[jedan[x][i]]=cmp;
        for(int j=0; j<n; j++)
        {
            if(p[jedan[x][i]][j]!=p[x][j])return false;
        }
    }
    for(int i=0; i<dva[x].size(); i++)
    {
        if(check[dva[x][i]])continue;
        check[dva[x][i]]=true;
        components[dva[x][i]]=cmp;
        for(int j=0; j<n; j++)
        {
            if(p[dva[x][i]][j]!=0 and p[x][j]==0)return false;
            if(p[dva[x][i]][j]==0 and p[x][j]!=0)return false;
        }
        if(!provera(dva[x][i], p, cmp))return false;
    }
    return true;
}

int construct(std::vector<std::vector<int>>p)
{
    int n=p.size();
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(p[i][j]==1)jedan[i].push_back(j);
            else if(p[i][j]==2)dva[i].push_back(j);
            else if(p[i][j]==3)return 0;
        }
    }
    for(int i=0; i<n; i++)
    {
        if(check[i])continue;
        comp[i]={-1, 0};
        cc.push_back(i);
        if(!provera(i, p, i))return 0;
    }

    vector<vector<int> > ans(n);
    for(int i=0; i<n; i++){ans[i].resize(n, 0);}
    for(int i=0; i<lin.size(); i++)
    {
        for(int j=1; j<jedan[lin[i]].size(); j++)
        {
            ans[jedan[lin[i]][j]][jedan[lin[i]][j-1]]=1;
            ans[jedan[lin[i]][j-1]][jedan[lin[i]][j]]=1;
        }
    }
    for(int i=0; i<lin.size(); i++)
    {
        int c=components[lin[i]];
        if(comp[c].first==-1)comp[c]={lin[i], lin[i]};
        else
        {
            ans[comp[c].second][lin[i]]=1;
            ans[lin[i]][comp[c].second]=1;
            comp[c].second=lin[i];
        }
    }
    for(int i=0; i<cc.size(); i++)
    {
        if(ans[comp[cc[i]].first][comp[cc[i]].second]==1)return 0;
        ans[comp[cc[i]].first][comp[cc[i]].second]=1;
        ans[comp[cc[i]].second][comp[cc[i]].first]=1;
    }
    for(int i=0; i<n; i++)
    {
        ans[i][i]=0;
    }
    build(ans);
    return 1;
}

/*int main()
{
    int n; cin>>n;
    vector<vector<int> >p;
    for(int i=0; i<n; i++)
    {
        vector<int>pp(n);
        for(int j=0; j<n; j++)
        {
            cin>>pp[j];
        }
        p.push_back(pp);
    }
    cout<<construct(p);
}*/

Compilation message

supertrees.cpp: In function 'bool provera(int, std::vector<std::vector<int> >, int)':
supertrees.cpp:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i=0; i<jedan[x].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~
supertrees.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i=0; i<dva[x].size(); i++)
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0; i<lin.size(); i++)
      |                  ~^~~~~~~~~~~
supertrees.cpp:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int j=1; j<jedan[lin[i]].size(); j++)
      |                      ~^~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:73:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0; i<lin.size(); i++)
      |                  ~^~~~~~~~~~~
supertrees.cpp:84:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=0; i<cc.size(); i++)
      |                  ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1340 KB Output is correct
7 Correct 190 ms 26072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1340 KB Output is correct
7 Correct 190 ms 26072 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 12 ms 1248 KB Output is correct
13 Correct 603 ms 22136 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 87 ms 14532 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 57 ms 5788 KB Output is correct
21 Correct 196 ms 22524 KB Output is correct
22 Correct 403 ms 22164 KB Output is correct
23 Correct 196 ms 24048 KB Output is correct
24 Correct 600 ms 22284 KB Output is correct
25 Correct 91 ms 12692 KB Output is correct
26 Correct 98 ms 12216 KB Output is correct
27 Correct 199 ms 25068 KB Output is correct
28 Correct 623 ms 22304 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 11 ms 1324 KB Output is correct
9 Correct 701 ms 24228 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 25 ms 33808 KB Output is correct
13 Execution timed out 1189 ms 1842072 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 54 ms 5792 KB Output is correct
5 Correct 214 ms 22584 KB Output is correct
6 Correct 425 ms 22060 KB Output is correct
7 Correct 202 ms 24108 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 160 ms 30284 KB Output is correct
10 Execution timed out 1110 ms 451684 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1340 KB Output is correct
7 Correct 190 ms 26072 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 12 ms 1248 KB Output is correct
13 Correct 603 ms 22136 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 87 ms 14532 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 57 ms 5788 KB Output is correct
21 Correct 196 ms 22524 KB Output is correct
22 Correct 403 ms 22164 KB Output is correct
23 Correct 196 ms 24048 KB Output is correct
24 Correct 600 ms 22284 KB Output is correct
25 Correct 91 ms 12692 KB Output is correct
26 Correct 98 ms 12216 KB Output is correct
27 Correct 199 ms 25068 KB Output is correct
28 Correct 623 ms 22304 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 11 ms 1324 KB Output is correct
37 Correct 701 ms 24228 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 25 ms 33808 KB Output is correct
41 Execution timed out 1189 ms 1842072 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1340 KB Output is correct
7 Correct 190 ms 26072 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 12 ms 1248 KB Output is correct
13 Correct 603 ms 22136 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 87 ms 14532 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 57 ms 5788 KB Output is correct
21 Correct 196 ms 22524 KB Output is correct
22 Correct 403 ms 22164 KB Output is correct
23 Correct 196 ms 24048 KB Output is correct
24 Correct 600 ms 22284 KB Output is correct
25 Correct 91 ms 12692 KB Output is correct
26 Correct 98 ms 12216 KB Output is correct
27 Correct 199 ms 25068 KB Output is correct
28 Correct 623 ms 22304 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 11 ms 1324 KB Output is correct
37 Correct 701 ms 24228 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 25 ms 33808 KB Output is correct
41 Execution timed out 1189 ms 1842072 KB Time limit exceeded
42 Halted 0 ms 0 KB -