제출 #303884

#제출 시각아이디문제언어결과실행 시간메모리
303884kjain_1810슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms384 KiB
#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]; vector<vector<int>>p; bool checkValid() { 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]] == 0 || 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] > 0 && taken[a] != taken[b]) return false; return true; } int gettype(int i) { int mini = 3; int maxi = 0; for(auto a:comp[i]) for(auto b:comp[i]) { if(a == b) continue; 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>> pp) { p = pp; 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()) return 0; // printf("3\n"); for(int i = 1; i < compcnt; i++) { // printf("4\n"); int x = gettype(i); 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].size()]][comp[i][a - 1]] = answer[comp[i][a - 1]][comp[i][a%comp[i].size()]] = 1; // int y = comp[i].size(); // answer[comp[i][y - 1]][comp[i][0]] = answer[comp[i][0]][comp[i][y - 1]] = 1; } else return 19; } build(answer); return 1; }

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'bool checkValid()':
supertrees.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for(int b = 0; b < comp[a].size(); b++)
      |                  ~~^~~~~~~~~~~~~~~~
supertrees.cpp:18:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |    for(int c = 0; c < comp[a].size(); c++)
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |    for(int a = 1; a < comp[i].size(); a++)
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:92:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |    for(int a = 1; a <= comp[i].size(); a++)
      |                   ~~^~~~~~~~~~~~~~~~~
#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...