oj.uz

Submission #628673

# Submission time Handle Problem Language Result Execution time Memory
628673 2022-08-13T15:12:32 Z FETT Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 202 ms 22128 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int nn;
vector<vector<int>> answer;
int head[1001];



//void c_head()
//{
//    cout<<"head"<<endl;
//    for(int i=0;i<nn;++i)
//    {
//        cout<<head[i]<<" ";
//    }cout<<endl;
//}






int construct(vector<vector<int>> p) {
	nn = p.size();

	for (int i = 0; i < nn; i++) {
        head[i]=i;
		vector<int> row;
		row.resize(nn);
		answer.push_back(row);
	}

	for(int i=0;i<nn;++i)
    {
        if(p[i][0]==-1)continue;
        for(int j=0;j<nn;++j)
        {
            if(p[i][j]==-1)continue;
            if(p[i][j]!=p[j][i])return 0;
            if(p[i][j]==3)return 0;
            if(p[i][j]==1)
            {
                head[j]=i;

                if(i!=j)
                {
                    p[j][0]=-1;
                    answer[i][j]=1;
                    answer[j][i]=1;
                }
            }
        }
    }
//    c_head();
//    cout<<"P"<<endl;
//    for(int i=0;i<nn;++i)
//    {
//        for(int j=0;j<nn;++j)
//        {
//            cout<<p[i][j]<<" ";
//        }
//        cout<<endl;
//    }
    for(int i=0;i<nn;++i)
    {
        bool flag=0;
        if(p[i][0]==-1)continue;
        for(int j=0;j<nn;++j)
        {
            if(p[i][j]==2)
            {
                flag=1;
                p[j][0]=-1;
                answer[head[i]][head[j]]=1;
                answer[head[j]][head[i]]=1;
                head[i]=j;
            }
        }
        if(flag==1)
        {
            answer[i][head[i]]=1;
            answer[head[i]][i]=1;
        }

    }

//    c_head();

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1164 KB Output is correct
7 Correct 159 ms 22092 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1164 KB Output is correct
7 Correct 159 ms 22092 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 163 ms 21968 KB Output is correct
14 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 41 ms 5768 KB Output is correct
5 Correct 159 ms 22028 KB Output is correct
6 Correct 167 ms 22024 KB Output is correct
7 Correct 168 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 41 ms 5652 KB Output is correct
10 Correct 192 ms 22128 KB Output is correct
11 Correct 163 ms 22004 KB Output is correct
12 Correct 202 ms 21996 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Incorrect 54 ms 6268 KB b[24][24] is not 0
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1164 KB Output is correct
7 Correct 159 ms 22092 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 163 ms 21968 KB Output is correct
14 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1164 KB Output is correct
7 Correct 159 ms 22092 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 163 ms 21968 KB Output is correct
14 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -