oj.uz

Submission #431957

# Submission time Handle Problem Language Result Execution time Memory
431957 2021-06-17T17:40:50 Z Blistering_Barnacles Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 274 ms 22284 KB 
#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 <= 1)continue ;
        else if(op == 2)return 0 ; 
        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:81:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for(ll j=0; j<w[i].size()-1; j++)
      |                     ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 12 ms 1100 KB Output is correct
7 Correct 240 ms 22284 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 12 ms 1100 KB Output is correct
7 Correct 240 ms 22284 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 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 14 ms 1152 KB Output is correct
13 Correct 236 ms 22144 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 113 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 59 ms 5768 KB Output is correct
21 Correct 240 ms 22080 KB Output is correct
22 Correct 239 ms 22168 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 238 ms 22056 KB Output is correct
25 Correct 99 ms 12176 KB Output is correct
26 Correct 99 ms 12168 KB Output is correct
27 Correct 274 ms 22204 KB Output is correct
28 Correct 235 ms 22084 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 1 ms 204 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 204 KB Output is correct
2 Incorrect 1 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 12 ms 1100 KB Output is correct
7 Correct 240 ms 22284 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 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 14 ms 1152 KB Output is correct
13 Correct 236 ms 22144 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 113 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 59 ms 5768 KB Output is correct
21 Correct 240 ms 22080 KB Output is correct
22 Correct 239 ms 22168 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 238 ms 22056 KB Output is correct
25 Correct 99 ms 12176 KB Output is correct
26 Correct 99 ms 12168 KB Output is correct
27 Correct 274 ms 22204 KB Output is correct
28 Correct 235 ms 22084 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 1 ms 204 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 12 ms 1100 KB Output is correct
7 Correct 240 ms 22284 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 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 14 ms 1152 KB Output is correct
13 Correct 236 ms 22144 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 113 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 59 ms 5768 KB Output is correct
21 Correct 240 ms 22080 KB Output is correct
22 Correct 239 ms 22168 KB Output is correct
23 Correct 274 ms 22092 KB Output is correct
24 Correct 238 ms 22056 KB Output is correct
25 Correct 99 ms 12176 KB Output is correct
26 Correct 99 ms 12168 KB Output is correct
27 Correct 274 ms 22204 KB Output is correct
28 Correct 235 ms 22084 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -