oj.uz

Submission #300238

# Submission time Handle Problem Language Result Execution time Memory
300238 2020-09-17T02:06:02 Z daniel920712 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 258 ms 22268 KB 
#include "supertrees.h"
#include <vector>
#include <stdio.h>
using namespace std;
vector < int > how[1005];
int Father[1005];
int Find(int here)
{
    if(Father[here]==here) return here;
    Father[here]=Find(Father[here]);
    return Father[here];
}
int construct(vector < vector< int > > p)
{
	int n=p.size(),i,j,m;
	vector< vector<int> > answer;
	vector< int > row;
	//printf("%d\n",n);
	for(i=0;i<n;i++) row.push_back(0);
	for(i=0;i<n;i++)
    {
        answer.push_back(row);
        Father[i]=i;
    }
	for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(p[i][j]==0&&Find(i)==Find(j))
            {
                //printf("%d %d %d %d\n",i,j,Find(i),Find(j));
                return 0;
            }
            else if(p[i][j]) Father[Find(i)]=Find(j);
        }
    }
    for(i=0;i<n;i++)
    {
        how[Find(i)].push_back(i);
        //printf("%d %d\n",i,Find(i));
    }
    for(i=0;i<n;i++)
    {
        m=how[i].size();
        if(m<=1) continue;
        for(j=1;j<m;j++)
        {
            answer[how[i][j-1]][how[i][j]]=1;
            answer[how[i][j]][how[i][j-1]]=1;
        }
        if(p[how[i][0]][how[i][1]]==2)
        {
            if(m==2) return 0;
            answer[how[i][m-1]][how[i][j]]=1;
            answer[how[i][j]][how[i][m-1]]=1;
        }
    }


	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 5880 KB Output is correct
21 Correct 247 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 234 ms 22136 KB Output is correct
25 Correct 132 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22260 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 239 ms 22264 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Runtime error 1 ms 384 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 239 ms 22136 KB Output is correct
6 Correct 253 ms 22268 KB Output is correct
7 Correct 250 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Runtime error 31 ms 6520 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 5880 KB Output is correct
21 Correct 247 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 234 ms 22136 KB Output is correct
25 Correct 132 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22260 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 239 ms 22264 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Runtime error 1 ms 384 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 5880 KB Output is correct
21 Correct 247 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 234 ms 22136 KB Output is correct
25 Correct 132 ms 12152 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22260 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 239 ms 22264 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Runtime error 1 ms 384 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -