oj.uz

Submission #733781

# Submission time Handle Problem Language Result Execution time Memory
733781 2023-05-01T09:48:28 Z tigar Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 245 ms 22220 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, g=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 if(komponente[j]==0){komponente[i]=br; g=true; 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;
                    if(!g and komponente[j]==0)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:66:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i=0; i<lin.size(); i++)
      |                  ~^~~~~~~~~~~
supertrees.cpp:68:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int j=1; j<jedan[lin[i]].size(); j++)
      |                      ~^~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         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 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 7 ms 1236 KB Output is correct
7 Correct 172 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 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 7 ms 1236 KB Output is correct
7 Correct 172 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 10 ms 1236 KB Output is correct
13 Correct 165 ms 22220 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 688 KB Output is correct
17 Correct 74 ms 8184 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 44 ms 5856 KB Output is correct
21 Correct 166 ms 22076 KB Output is correct
22 Correct 168 ms 22120 KB Output is correct
23 Correct 166 ms 22136 KB Output is correct
24 Correct 170 ms 22184 KB Output is correct
25 Correct 64 ms 8180 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 175 ms 22080 KB Output is correct
28 Correct 168 ms 22104 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 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 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 1236 KB Output is correct
9 Correct 176 ms 22128 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 10 ms 1248 KB Output is correct
13 Correct 179 ms 22068 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 86 ms 10196 KB Output is correct
18 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #4
35.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 46 ms 5872 KB Output is correct
5 Correct 220 ms 22128 KB Output is correct
6 Correct 168 ms 22092 KB Output is correct
7 Correct 186 ms 22116 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 45 ms 5860 KB Output is correct
10 Correct 245 ms 22076 KB Output is correct
11 Correct 190 ms 22120 KB Output is correct
12 Correct 204 ms 22096 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 61 ms 5868 KB Output is correct
17 Correct 182 ms 22196 KB Output is correct
18 Correct 180 ms 22092 KB Output is correct
19 Correct 185 ms 22124 KB Output is correct
20 Correct 222 ms 22116 KB Output is correct

Subtask #5
0 / 21.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 7 ms 1236 KB Output is correct
7 Correct 172 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 10 ms 1236 KB Output is correct
13 Correct 165 ms 22220 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 688 KB Output is correct
17 Correct 74 ms 8184 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 44 ms 5856 KB Output is correct
21 Correct 166 ms 22076 KB Output is correct
22 Correct 168 ms 22120 KB Output is correct
23 Correct 166 ms 22136 KB Output is correct
24 Correct 170 ms 22184 KB Output is correct
25 Correct 64 ms 8180 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 175 ms 22080 KB Output is correct
28 Correct 168 ms 22104 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 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 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1236 KB Output is correct
37 Correct 176 ms 22128 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 10 ms 1248 KB Output is correct
41 Correct 179 ms 22068 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 86 ms 10196 KB Output is correct
46 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
47 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 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 7 ms 1236 KB Output is correct
7 Correct 172 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 10 ms 1236 KB Output is correct
13 Correct 165 ms 22220 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 688 KB Output is correct
17 Correct 74 ms 8184 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 44 ms 5856 KB Output is correct
21 Correct 166 ms 22076 KB Output is correct
22 Correct 168 ms 22120 KB Output is correct
23 Correct 166 ms 22136 KB Output is correct
24 Correct 170 ms 22184 KB Output is correct
25 Correct 64 ms 8180 KB Output is correct
26 Correct 65 ms 8296 KB Output is correct
27 Correct 175 ms 22080 KB Output is correct
28 Correct 168 ms 22104 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 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 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1236 KB Output is correct
37 Correct 176 ms 22128 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 10 ms 1248 KB Output is correct
41 Correct 179 ms 22068 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 86 ms 10196 KB Output is correct
46 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
47 Halted 0 ms 0 KB -