oj.uz

답안 #733673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733673 2023-05-01T07:37:56 Z tigar 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

typedef long long ll;
vector<int> jedan[1010], dva[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;
        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;
        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;
        }
    }
    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:26:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0; i<dva[x].size(); i++)
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i=0; i<lin.size(); i++)
      |                  ~^~~~~~~~~~~
supertrees.cpp:64:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for(int j=1; j<jedan[lin[i]].size(); j++)
      |                      ~^~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:73:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int j=0; j<cc[i].size(); j++)
      |                      ~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1468 KB Output is correct
7 Correct 175 ms 27528 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1468 KB Output is correct
7 Correct 175 ms 27528 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 368 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 1364 KB Output is correct
13 Correct 699 ms 24124 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 117 ms 16584 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 49 ms 6376 KB Output is correct
21 Correct 186 ms 24636 KB Output is correct
22 Correct 379 ms 24060 KB Output is correct
23 Correct 180 ms 26060 KB Output is correct
24 Correct 672 ms 24072 KB Output is correct
25 Correct 79 ms 14668 KB Output is correct
26 Correct 81 ms 14144 KB Output is correct
27 Correct 187 ms 27020 KB Output is correct
28 Correct 703 ms 24212 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 372 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 372 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 12 ms 1236 KB Output is correct
9 Correct 655 ms 24120 KB Output is correct
10 Correct 1 ms 372 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 25 ms 33868 KB Output is correct
13 Execution timed out 1117 ms 2097152 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 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 49 ms 5860 KB Output is correct
5 Correct 181 ms 22636 KB Output is correct
6 Correct 359 ms 22172 KB Output is correct
7 Correct 202 ms 24024 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 155 ms 30388 KB Output is correct
10 Execution timed out 1103 ms 453516 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 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 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1468 KB Output is correct
7 Correct 175 ms 27528 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 368 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 1364 KB Output is correct
13 Correct 699 ms 24124 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 117 ms 16584 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 49 ms 6376 KB Output is correct
21 Correct 186 ms 24636 KB Output is correct
22 Correct 379 ms 24060 KB Output is correct
23 Correct 180 ms 26060 KB Output is correct
24 Correct 672 ms 24072 KB Output is correct
25 Correct 79 ms 14668 KB Output is correct
26 Correct 81 ms 14144 KB Output is correct
27 Correct 187 ms 27020 KB Output is correct
28 Correct 703 ms 24212 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 372 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 372 KB Output is correct
33 Correct 1 ms 372 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 12 ms 1236 KB Output is correct
37 Correct 655 ms 24120 KB Output is correct
38 Correct 1 ms 372 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 25 ms 33868 KB Output is correct
41 Execution timed out 1117 ms 2097152 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 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 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1468 KB Output is correct
7 Correct 175 ms 27528 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 368 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 1364 KB Output is correct
13 Correct 699 ms 24124 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 117 ms 16584 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 49 ms 6376 KB Output is correct
21 Correct 186 ms 24636 KB Output is correct
22 Correct 379 ms 24060 KB Output is correct
23 Correct 180 ms 26060 KB Output is correct
24 Correct 672 ms 24072 KB Output is correct
25 Correct 79 ms 14668 KB Output is correct
26 Correct 81 ms 14144 KB Output is correct
27 Correct 187 ms 27020 KB Output is correct
28 Correct 703 ms 24212 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 372 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 372 KB Output is correct
33 Correct 1 ms 372 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 12 ms 1236 KB Output is correct
37 Correct 655 ms 24120 KB Output is correct
38 Correct 1 ms 372 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 25 ms 33868 KB Output is correct
41 Execution timed out 1117 ms 2097152 KB Time limit exceeded
42 Halted 0 ms 0 KB -