oj.uz

Submission #733684

# Submission time Handle Problem Language Result Execution time Memory
733684 2023-05-01T08:02:50 Z tigar Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 1000 ms 1930988 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];

bool provera(int x, std::vector<std::vector<int>>p, int cmp)
{
    lin.push_back(x);
    cc[cmp].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;
        if(jedan[x].size()!=jedan[jedan[x][i]].size())return false;
        for(int j=0; j<jedan[x].size(); j++)
        {
            if(jedan[x][j]!=jedan[jedan[x][i]][j])return false;
        }
    }
    for(int i=0; i<dva[x].size(); i++)
    {
        if(check[dva[x][i]])continue;
        check[dva[x][i]]=true;
        if(nula[x].size()!=nula[dva[x][i]].size())return false;
        for(int j=0; j<nula[x].size(); j++)
        {
            if(nula[x][j]!=nula[dva[x][i]][j])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;
            else nula[i].push_back(j);
        }
    }
    for(int i=0; i<n; i++)
    {
        sort(jedan[i].begin(), jedan[i].end());
        sort(dva[i].begin(), dva[i].end());
        sort(nula[i].begin(), nula[i].end());
    }
    int br=1;
    for(int i=0; i<n; i++)
    {
        if(check[i])continue;
        if(!provera(i, p, br))return 0;
        br++;
    }
    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 'bool provera(int, std::vector<std::vector<int> >, int)':
supertrees.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0; i<jedan[x].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~
supertrees.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int j=0; j<jedan[x].size(); j++)
      |                      ~^~~~~~~~~~~~~~~~
supertrees.cpp:27:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0; i<dva[x].size(); i++)
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int j=0; j<nula[x].size(); j++)
      |                      ~^~~~~~~~~~~~~~~
supertrees.cpp:16:9: warning: unused variable 'n' [-Wunused-variable]
   16 |     int n=p.size();
      |         ^
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for(int i=0; i<lin.size(); i++)
      |                  ~^~~~~~~~~~~
supertrees.cpp:71:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for(int j=1; j<jedan[lin[i]].size(); j++)
      |                      ~^~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         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 0 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 8 ms 1468 KB Output is correct
7 Correct 181 ms 27508 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 0 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 8 ms 1468 KB Output is correct
7 Correct 181 ms 27508 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 400 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 1572 KB Output is correct
13 Correct 727 ms 28204 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1048 KB Output is correct
17 Correct 98 ms 19028 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 51 ms 7384 KB Output is correct
21 Correct 194 ms 28756 KB Output is correct
22 Correct 495 ms 28152 KB Output is correct
23 Correct 190 ms 28124 KB Output is correct
24 Correct 792 ms 28104 KB Output is correct
25 Correct 94 ms 18888 KB Output is correct
26 Correct 130 ms 18340 KB Output is correct
27 Correct 187 ms 30100 KB Output is correct
28 Correct 788 ms 28124 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 396 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 404 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 11 ms 1532 KB Output is correct
9 Correct 759 ms 28252 KB Output is correct
10 Correct 1 ms 396 KB Output is correct
11 Correct 1 ms 392 KB Output is correct
12 Correct 23 ms 33876 KB Output is correct
13 Execution timed out 1168 ms 1930988 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 396 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 55 ms 7352 KB Output is correct
5 Correct 198 ms 28748 KB Output is correct
6 Correct 489 ms 28096 KB Output is correct
7 Correct 195 ms 28028 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 168 ms 31844 KB Output is correct
10 Execution timed out 1115 ms 455640 KB Time limit exceeded
11 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 0 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 8 ms 1468 KB Output is correct
7 Correct 181 ms 27508 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 400 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 1572 KB Output is correct
13 Correct 727 ms 28204 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1048 KB Output is correct
17 Correct 98 ms 19028 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 51 ms 7384 KB Output is correct
21 Correct 194 ms 28756 KB Output is correct
22 Correct 495 ms 28152 KB Output is correct
23 Correct 190 ms 28124 KB Output is correct
24 Correct 792 ms 28104 KB Output is correct
25 Correct 94 ms 18888 KB Output is correct
26 Correct 130 ms 18340 KB Output is correct
27 Correct 187 ms 30100 KB Output is correct
28 Correct 788 ms 28124 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 396 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 404 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 11 ms 1532 KB Output is correct
37 Correct 759 ms 28252 KB Output is correct
38 Correct 1 ms 396 KB Output is correct
39 Correct 1 ms 392 KB Output is correct
40 Correct 23 ms 33876 KB Output is correct
41 Execution timed out 1168 ms 1930988 KB Time limit exceeded
42 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 0 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 8 ms 1468 KB Output is correct
7 Correct 181 ms 27508 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 400 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 1572 KB Output is correct
13 Correct 727 ms 28204 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1048 KB Output is correct
17 Correct 98 ms 19028 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 51 ms 7384 KB Output is correct
21 Correct 194 ms 28756 KB Output is correct
22 Correct 495 ms 28152 KB Output is correct
23 Correct 190 ms 28124 KB Output is correct
24 Correct 792 ms 28104 KB Output is correct
25 Correct 94 ms 18888 KB Output is correct
26 Correct 130 ms 18340 KB Output is correct
27 Correct 187 ms 30100 KB Output is correct
28 Correct 788 ms 28124 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 396 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 404 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 11 ms 1532 KB Output is correct
37 Correct 759 ms 28252 KB Output is correct
38 Correct 1 ms 396 KB Output is correct
39 Correct 1 ms 392 KB Output is correct
40 Correct 23 ms 33876 KB Output is correct
41 Execution timed out 1168 ms 1930988 KB Time limit exceeded
42 Halted 0 ms 0 KB -