답안 #431955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431955	2021-06-17T17:40:03 Z	Blistering_Barnacles	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	321 ms	22576 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<vector<ll> >ans,v,w;
vector<pair<ll,ll> >op;
ll n,p1[1009],p2[1009];
ll gp1(ll z)
{
    if(p1[z]==z)
        return z;
    return p1[z]=gp1(p1[z]);
}
ll gp2(ll z)
{
    if(p2[z]==z)
        return z;
    return p2[z]=gp2(p2[z]);
}
void mrg1(ll x,ll y)
{
    x=gp1(x),y=gp1(y);
    if(x==y)
        return;
    if(v[y].size()>v[x].size())
        swap(x,y);
    p1[y]=x;
    for(auto z:v[y])
        v[x].push_back(z);
}
void mrg2(ll x,ll y)
{
    x=gp2(x),y=gp2(y);
    if(x==y)
        return;
    p2[y]=x;
}
int construct(vector<vector<int> > pp)
{
    n=pp.size();
    v.resize(n);
    w.resize(n);
    ans.resize(n);
 
    for(ll i=0; i<n; i++)
        ans[i].resize(n);
 
    for(ll i=0; i<n; i++)
        p1[i]=p2[i]=i, v[i].push_back(i);
 
    for(ll i=0; i<n; i++)
        for(ll j=0; j<n; j++)
        {
            if(i==j)
                continue;
            if(pp[i][j]==3)
                return 0;
            if(pp[i][j]==1)
                mrg1(i,j);
            else if(pp[i][j]==2)
                mrg2(i,j);
        }
 
    for(ll i=0; i<n; i++)
    {
        if(p1[i]!=i){
            ll x=gp2(i);
            w[x].push_back(i);
            continue ;
        }
        for(ll j=1; j<v[i].size(); j++)
            ans[i][v[i][j]]=ans[v[i][j]][i]=1;
    }
    for(ll i=0; i<n; i++)
    {
        if(p2[i]!=i)
            continue;
        ll op = w[i].size() ;
        if(op <= 2)continue ;
        for(ll j=0; j<w[i].size()-1; j++)
            ans[w[i][j]][w[i][j+1]]=ans[w[i][j+1]][w[i][j]]=1;
        ans[w[i][0]][w[i].back()]=ans[w[i].back()][w[i][0]]=1;
    }
    for(ll i=0; i<n; i++)
        for(ll j=0; j<n; j++)
        {
            if(i==j)
                continue;
            ll x=gp1(i),y=gp1(j);
            if(x==y&&pp[i][j]!=1)
                return 0;
            ll xx=gp2(i),yy=gp2(j);
            if(xx==yy&&pp[i][j]==0)
                return 0;
        }
    for(ll i=0; i<n; i++)
        ans[i][i]=0;
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:71:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for(ll j=1; j<v[i].size(); j++)
      |                     ~^~~~~~~~~~~~
supertrees.cpp:80:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(ll j=0; j<w[i].size()-1; j++)
      |                     ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	11 ms	1188 KB	Output is correct
7	Correct	265 ms	22140 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	11 ms	1188 KB	Output is correct
7	Correct	265 ms	22140 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	258 ms	22020 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	119 ms	12632 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	66 ms	5940 KB	Output is correct
21	Correct	265 ms	22488 KB	Output is correct
22	Correct	289 ms	22540 KB	Output is correct
23	Correct	321 ms	22536 KB	Output is correct
24	Correct	263 ms	22544 KB	Output is correct
25	Correct	94 ms	12612 KB	Output is correct
26	Correct	92 ms	12640 KB	Output is correct
27	Correct	279 ms	22576 KB	Output is correct
28	Correct	257 ms	22468 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Incorrect	204 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	11 ms	1188 KB	Output is correct
7	Correct	265 ms	22140 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	258 ms	22020 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	119 ms	12632 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	66 ms	5940 KB	Output is correct
21	Correct	265 ms	22488 KB	Output is correct
22	Correct	289 ms	22540 KB	Output is correct
23	Correct	321 ms	22536 KB	Output is correct
24	Correct	263 ms	22544 KB	Output is correct
25	Correct	94 ms	12612 KB	Output is correct
26	Correct	92 ms	12640 KB	Output is correct
27	Correct	279 ms	22576 KB	Output is correct
28	Correct	257 ms	22468 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	11 ms	1188 KB	Output is correct
7	Correct	265 ms	22140 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	258 ms	22020 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	296 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	119 ms	12632 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	66 ms	5940 KB	Output is correct
21	Correct	265 ms	22488 KB	Output is correct
22	Correct	289 ms	22540 KB	Output is correct
23	Correct	321 ms	22536 KB	Output is correct
24	Correct	263 ms	22544 KB	Output is correct
25	Correct	94 ms	12612 KB	Output is correct
26	Correct	92 ms	12640 KB	Output is correct
27	Correct	279 ms	22576 KB	Output is correct
28	Correct	257 ms	22468 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

답안 #431955

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0