이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "supertrees.h"
#include <vector>
#include<stdio.h>
#define pb push_back
const int N = 1005;
using namespace std;
int taken[N], compcnt = 1, n;
vector<int>comp[N];
bool checkValid(vector<vector<int>>p)
{
for(int a = 1; a < compcnt; a++)
for(int b = 0; b < comp[a].size(); b++)
for(int c = 0; c < comp[a].size(); c++)
if(!p[comp[a][b]][comp[a][c]] || p[comp[a][b]][comp[a][c]] == 3)
return false;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
if(p[a][b] && taken[a] != taken[b])
return false;
return true;
}
int gettype(vector<int>component, vector<vector<int>>p)
{
int mini = 3;
int maxi = 0;
for(auto a:component)
for(auto b:component)
{
mini=min(mini, p[a][b]);
maxi=max(maxi, p[a][b]);
}
if(mini == maxi)
{
if(mini == 1)
return 0;
else
return 1;
}
return 2;
}
int construct(vector<vector<int>> p) {
n = p.size();
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row;
row.resize(n);
answer.push_back(row);
}
// printf("1\n");
for(int a = 0; a < n; a++)
{
if(taken[a])
continue;
for(int b = 0; b < n; b++)
if(p[a][b])
{
// printf("%d ", b);
comp[compcnt].pb(b);
taken[b] = compcnt;
}
// printf("\n");
compcnt++;
}
// for(int a = 0; a < n; a++)
// printf("%d: %d\n", a, taken[a]);
// printf("2\n");
if(!checkValid(p))
return 0;
// printf("3\n");
for(int i = 1; i < compcnt; i++)
{
// printf("4\n");
int x = gettype(comp[i], p);
if(x == 0)
{
for(int a = 1; a < comp[i].size(); a++)
answer[comp[i][a]][comp[i][a - 1]] = answer[comp[i][a - 1]][comp[i][a]] = 1;
}
else if(x == 1)
{
for(int a = 1; a < comp[i].size(); a++)
answer[comp[i][a]][comp[i][a - 1]] = answer[comp[i][a - 1]][comp[i][a]] = 1;
answer[comp[i][comp[i].size() - 1]][0] = answer[comp[i][0]][comp[i][comp[i].size() - 1]] = 1;
}
}
build(answer);
return 1;
}
컴파일 시 표준 에러 (stderr) 메시지
supertrees.cpp: In function 'bool checkValid(std::vector<std::vector<int> >)':
supertrees.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
16 | for(int b = 0; b < comp[a].size(); b++)
| ~~^~~~~~~~~~~~~~~~
supertrees.cpp:17:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | for(int c = 0; c < comp[a].size(); c++)
| ~~^~~~~~~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:82:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
82 | for(int a = 1; a < comp[i].size(); a++)
| ~~^~~~~~~~~~~~~~~~
supertrees.cpp:88:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
88 | for(int a = 1; a < comp[i].size(); a++)
| ~~^~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |