oj.uz

Submission #733771

# Submission time Handle Problem Language Result Execution time Memory
733771 2023-05-01T09:29:19 Z tigar Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 174 ms 22212 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

typedef long long ll;
vector<int> jedan[1010], dva[1010], nula[1010];
bool check[1010];
vector<int>lin;
vector<int>cc[1010];
int linije[1010], komponente[1010];

int construct(std::vector<std::vector<int>>p)
{
    int n=p.size();
    int br=1;

    for(int i=0; i<n; i++)linije[i]=-1;
    for(int i=0; i<n; i++)
    {
        if(!check[i])
        {
            check[i]=true;
            lin.push_back(i);
            linije[i]=i;
            bool z=false;
            for(int j=0; j<n; j++)
            {
                if(!z and p[i][j]!=0)
                {
                    z=true;
                    if(komponente[j]!=0 and komponente[i]==0){komponente[i]=komponente[j];}
                    else if(komponente[j]!=0 and komponente[i]!=0 and komponente[i]!=komponente[j])return 0;
                    else {komponente[i]=br; br++;}
                    cc[komponente[i]].push_back(i);
                }
                if(p[i][j]==1)
                {
                    if(linije[j]!=-1 and linije[i]!=linije[j])return 0;
                    linije[j]=i; check[j]=true;
                    if(komponente[j]!=0 and komponente[j]!=komponente[i])return 0;
                    komponente[j]=komponente[i];
                    jedan[i].push_back(j);
                }
                else if(p[i][j]==2)
                {
                    if(komponente[j]!=0 and komponente[j]!=komponente[i])return 0;
                    komponente[j]=komponente[i];
                }
                else if(p[i][j]==3)return 0;
            }
        }
        else
        {
            for(int j=0; j<n; j++)
            {
                if(p[i][j]!=p[linije[i]][j])return 0;
            }
        }
    }

    ///ovde pocinje deo za odgovor, njega sredjujem posle
    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=1; i<=br; i++)
    {
        for(int j=0; j<cc[i].size(); j++)
        {
            //cout<<cc[i][j]<<" ";
            if(cc[i].size()==2)return 0;
            ans[cc[i][j]][cc[i][(j+1)%cc[i].size()]]=1;
            ans[cc[i][(j+1)%cc[i].size()]][cc[i][j]]=1;
        }
        //cout<<endl;
    }
    for(int i=0; i<n; i++)
    {
        ans[i][i]=0;
    }
    //for(int i=0; i<n; i++){for(int j=0; j<n; j++)cout<<ans[i][j]<<" "; cout<<endl;}
    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 '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:76:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int j=0; j<cc[i].size(); j++)
      |                      ~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 169 ms 22120 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 169 ms 22120 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 165 ms 22172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 8300 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 43 ms 5868 KB Output is correct
21 Correct 170 ms 22120 KB Output is correct
22 Correct 170 ms 22116 KB Output is correct
23 Correct 174 ms 22132 KB Output is correct
24 Correct 166 ms 22212 KB Output is correct
25 Correct 62 ms 8164 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 171 ms 22092 KB Output is correct
28 Correct 167 ms 22132 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
6 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 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 169 ms 22120 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 165 ms 22172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 8300 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 43 ms 5868 KB Output is correct
21 Correct 170 ms 22120 KB Output is correct
22 Correct 170 ms 22116 KB Output is correct
23 Correct 174 ms 22132 KB Output is correct
24 Correct 166 ms 22212 KB Output is correct
25 Correct 62 ms 8164 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 171 ms 22092 KB Output is correct
28 Correct 167 ms 22132 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 169 ms 22120 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 165 ms 22172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 8300 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 43 ms 5868 KB Output is correct
21 Correct 170 ms 22120 KB Output is correct
22 Correct 170 ms 22116 KB Output is correct
23 Correct 174 ms 22132 KB Output is correct
24 Correct 166 ms 22212 KB Output is correct
25 Correct 62 ms 8164 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 171 ms 22092 KB Output is correct
28 Correct 167 ms 22132 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -