oj.uz

답안 #487744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487744 2021-11-16T14:13:15 Z ala2 슈퍼트리 잇기 (IOI20_supertrees) C++14
0 / 100
 184 ms 47516 KB 
#include "supertrees.h"
#include <vector>
#include<iostream>
using namespace std;
int pa[1001000];
int sz[1001000];
int root(int x)
{
    while(x!=pa[x])
    {
        pa[x]=pa[pa[x]];
        x=pa[x];
    }
    return x;
}
void unit(int x,int y)
{
    x=root(x);
    y=root(y);
    if(x==y)
        return ;
    if(sz[x]>sz[y])
    {
        sz[x]+=sz[y];
        pa[y]=x;
    }
    else
    {
        sz[y]+=sz[x];
        pa[x]=y;
    }
}
vector<int>v[1001000];
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	for(int i=0;i<n;i++)
    {
        pa[i]=i;
        sz[i]=1;
    } int bb=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(p[i][j]==2)
            {
                //cout<<"                "<<i<<" " <<j<<"  "<<root(i)<<"  "<<root(j)<<" ";
                unit(i,j);
               // cout<<root(i)<<endl;

            }
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
           if(p[i][j]&&root(i)!=root(j))
            bb=1;
           if(p[i][j]==0&&root(i)==root(j))
            bb=1;
        }
    }
    for(int i=0;i<n;i++)
    {
      //  cout<<"      "<<i<<"  "<<root(i)<<endl;
        v[root(i)].push_back(i);
    }
    for(int i=0;i<n;i++)
    {
        if(i!=root(i))
            continue;

      //      cout<<v[i].size()<<endl;
      if(v[i].size()==2)
        bb=1;
        for(int j=0;j<v[i].size()-1;j++)
        {

            int x=v[i][j];
            int y=v[i][j+1];
    //        cout<<x<<" ";
          //  if(j==v[i].size()-1)
            //    cout<<y<<" ";
            if(i==v[i].size()-2)
            {
                answer[y][0]=1;
                answer[0][y]=1;
            }
            answer[x][y]=1;
            answer[y][x]=1;
        }

    }
    if(bb)
        return 0;
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:81:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   81 |       if(v[i].size()==2)
      |       ^~
supertrees.cpp:83:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   83 |         for(int j=0;j<v[i].size()-1;j++)
      |         ^~~
supertrees.cpp:83:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(int j=0;j<v[i].size()-1;j++)
      |                     ~^~~~~~~~~~~~~~
supertrees.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |             if(i==v[i].size()-2)
      |                ~^~~~~~~~~~~~~~~
supertrees.cpp:101:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  101 |     if(bb)
      |     ^~
supertrees.cpp:103:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  103 |  build(answer);
      |  ^~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23708 KB Output is correct
2 Correct 11 ms 23756 KB Output is correct
3 Correct 11 ms 23756 KB Output is correct
4 Correct 11 ms 23756 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 11 ms 23712 KB Output is correct
7 Correct 12 ms 23760 KB Output is correct
8 Correct 19 ms 24784 KB Output is correct
9 Correct 184 ms 47516 KB Output is correct
10 Incorrect 12 ms 23760 KB Too few ways to get from 0 to 1, should be 2 found 1
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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