제출 #300600

#제출 시각아이디문제언어결과실행 시간메모리
300600Dilshod_Imomov슈퍼트리 잇기 (IOI20_supertrees)C++17
19 / 100
266 ms22392 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7; int nn, comp, used[N], cc[N], cmp[N], ok, first[N]; set < int > sz[N]; int construct(std::vector<std::vector<int>> p) { nn = p.size(); std::vector<std::vector<int>> answer; for (int i = 0; i < nn; i++) { std::vector<int> row; row.resize(nn); answer.push_back(row); } for ( int i = 0; i < nn; i++ ) { if ( !cc[i] ) { cc[i] = ++comp; first[comp] = i; sz[cc[i]].insert(i); } cmp[ cc[i] ] = i; for ( int j = 0; j < nn; j++ ) { if ( p[i][j] && i != j ) { if ( cc[j] && cc[j] != cc[i] ) { return 0; } if( cc[j] ) { continue; } cc[j] = cc[i]; sz[cc[i]].insert(j); answer[ cmp[ cc[i] ] ][j] = 1; answer[ j ][ cmp[ cc[i] ] ] = 1; cmp[ cc[i] ] = j; } } } for ( int i = 1; i <= comp; i++ ) { if ( cmp[ i ] != first[i] ) { answer[cmp[i]][first[i]] = 1; answer[ first[i] ][cmp[i]] = 1; } if ( sz[i].size() == 2 ) { return 0; } } for ( int i = 0; i < nn; i++ ) { for ( int j = 0; j < nn; j++ ) { if ( cc[i] == cc[j] ) { if ( !p[i][j] || !p[j][i] ) { return 0; } } } } build(answer); return 1; } /* 7 1 2 2 0 0 0 0 2 1 2 0 0 0 0 2 2 1 0 0 0 0 0 0 0 1 2 2 2 0 0 0 2 1 2 2 0 0 0 2 2 1 2 0 0 0 2 2 2 1 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...