제출 #302109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302109		radaiosm7	Connecting Supertrees (IOI20_supertrees)	C++17	19 / 100	263 ms	22268 KiB

supertrees

    #include "supertrees.h"
    #include <bits/stdc++.h>
    using namespace std;
    int par[1005];
    int depth[1005];
    vector<int> teams[1005];

    int FindPre(int x) {
      if (par[x] == x) {
        return x;
      }  else {
        par[x] = FindPre(par[x]);
        return par[x];
      }
    }

    bool IsSame(int x, int y) {
      if (FindPre(x) == FindPre(y)) {
        return true;
      }

      else {
        return false;
      }
    }

    void Union(int x, int y) {
      int PX = FindPre(x);
      int PY = FindPre(y);

      if (depth[PX] > depth[PY]) {
        par[PY] = PX;
      }

      else if (depth[PX] < depth[PY]) {
        par[PX] = PY;
      }

      else {
        par[PY] = PX;
        depth[PX]++;
      }
    }


    int construct(vector<vector<int>> p) {
    	int n = p.size();
    	vector<vector<int>> ans(n, vector<int>(n, 0));

      for (int i=0; i < n; i++) {
        par[i] = i;
        depth[i] = 1;
      }

    	for (int i=0; i < n-1; i++) {
        for (int j=i+1; j < n; j++) {
          if (p[i][j] == 2) {
            Union(i,j);
          }
        }
    	}

      for (int i=0; i < n; i++) {
          teams[FindPre(i)].push_back(i);
      }

      for (int i=0; i < n-1; i++) {
        for (int j=i+1; j < n; j++) {
          if (p[i][j] == 0 && IsSame(i,j)) {
            return 0;
          }
        }
      }

      for (int i=0; i < n; i++) {
        if ((int)teams[i].size() == 2) {
          return 0;
        }

        for (int j=0; j < (int)teams[i].size()-1; j++) {
          ans[teams[i][j+1]][teams[i][j]] = 1;
          ans[teams[i][j]][teams[i][j+1]] = 1;
        }

        if ((int)teams[i].size() > 1) {
          ans[teams[i][0]][teams[i][(int)teams[i].size()-1]] = 1;
          ans[teams[i][(int)teams[i].size()-1]][teams[i][0]] = 1;
        }
      }

    	build(ans);
    	return 1;
    }

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 19 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4