oj.uz

Submission #300245

# Submission time Handle Problem Language Result Execution time Memory
300245 2020-09-17T02:50:13 Z daniel920712 Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 283 ms 22392 KB 
#include "supertrees.h"
#include <vector>
#include <stdio.h>
using namespace std;
vector < int > how[1005];
vector < int > how2[1005];
vector < int > cycle;
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,k,m;
	vector< vector<int> > answer;
	vector< int > row;
	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)) return 0;
            else if(p[i][j]) Father[Find(i)]=Find(j);
        }
    }
    for(i=0;i<n;i++) how[Find(i)].push_back(i);
    for(i=0;i<n;i++)
    {
        m=how[i].size();
        if(m<=1) continue;

        for(auto j:how[i])
        {
            //printf("%d %d\n",i2,j);
            Father[j]=j;
        }
        for(j=0;j<m;j++)
        {
            for(k=0;k<m;k++)
            {
                if(Find(how[i][j])==Find(how[i][k])&&p[how[i][j]][how[i][k]]==2)
                {
                    //printf("%d %d\n",how[i][j],how[i][k]);
                    return 0;
                }
                else if(p[how[i][j]][how[i][k]]==1) Father[Find(how[i][k])]=Find(how[i][j]);
            }
        }
        for(auto j:how[i]) how2[Find(j)].push_back(j);
        cycle.clear();
        for(auto j:how[i])
        {
            m=how2[j].size();
            if(m==0) continue;
            for(k=1;k<m;k++)
            {
                answer[how2[j][k-1]][how2[j][k]]=1;
                answer[how2[j][k]][how2[j][k-1]]=1;
            }
            cycle.push_back(how2[j][0]);
        }
        m=cycle.size();
        if(m<=2) continue;
        for(j=1;j<m;j++)
        {
            answer[cycle[j-1]][cycle[j]]=1;
            answer[cycle[j]][cycle[j-1]]=1;
        }
        answer[cycle[m-1]][cycle[0]]=1;
        answer[cycle[0]][cycle[m-1]]=1;
    }
	build(answer);
	return 1;
}
/*
4
1 1 2 2
1 1 2 2
2 2 1 2
2 2 2 1
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 282 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 282 ms 22140 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 12 ms 1280 KB Output is correct
13 Correct 248 ms 22264 KB Output is correct
14 Correct 1 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 117 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 254 ms 22136 KB Output is correct
22 Correct 250 ms 22136 KB Output is correct
23 Correct 276 ms 22264 KB Output is correct
24 Correct 249 ms 22140 KB Output is correct
25 Correct 120 ms 12280 KB Output is correct
26 Correct 107 ms 12284 KB Output is correct
27 Correct 276 ms 22272 KB Output is correct
28 Correct 249 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 70 ms 5880 KB Output is correct
5 Correct 266 ms 22136 KB Output is correct
6 Correct 255 ms 22280 KB Output is correct
7 Correct 283 ms 22268 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 65 ms 5912 KB Output is correct
10 Correct 261 ms 22140 KB Output is correct
11 Correct 258 ms 22392 KB Output is correct
12 Correct 274 ms 22264 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 65 ms 5880 KB Output is correct
17 Correct 257 ms 22136 KB Output is correct
18 Correct 256 ms 22136 KB Output is correct
19 Correct 258 ms 22264 KB Output is correct
20 Correct 251 ms 22264 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 282 ms 22140 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 12 ms 1280 KB Output is correct
13 Correct 248 ms 22264 KB Output is correct
14 Correct 1 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 117 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 254 ms 22136 KB Output is correct
22 Correct 250 ms 22136 KB Output is correct
23 Correct 276 ms 22264 KB Output is correct
24 Correct 249 ms 22140 KB Output is correct
25 Correct 120 ms 12280 KB Output is correct
26 Correct 107 ms 12284 KB Output is correct
27 Correct 276 ms 22272 KB Output is correct
28 Correct 249 ms 22136 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 282 ms 22140 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 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 12 ms 1280 KB Output is correct
13 Correct 248 ms 22264 KB Output is correct
14 Correct 1 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 117 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 254 ms 22136 KB Output is correct
22 Correct 250 ms 22136 KB Output is correct
23 Correct 276 ms 22264 KB Output is correct
24 Correct 249 ms 22140 KB Output is correct
25 Correct 120 ms 12280 KB Output is correct
26 Correct 107 ms 12284 KB Output is correct
27 Correct 276 ms 22272 KB Output is correct
28 Correct 249 ms 22136 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -