제출 #915059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915059		xynex	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	185 ms	22268 KiB

supertrees

/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/
#include "supertrees.h"
#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 2e5 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/


int construct(vt<vt<int>> P) {
  int n = sz(P);
  vt<vt<int> > comp;
  vt<int> whr(n, -1);
  int ps = 0;
  for(int i = 0; i < n; ++i) {
    if(whr[i] != -1) {
      int _ = 0;
      for(int j = 0; j < n; ++j) {
        if(P[i][j] == 1) {
          if(comp[whr[i]][_] != j) { return 0;}
          _++;
        }
      }
    }
    else {
      comp.pb({});
      for(int j = 0; j < n; ++j) {
        if(P[i][j] == 1) {
          if(whr[j] != -1) { return 0;}
          comp.back().pb(j);
          whr[j] = ps;
        }
      }
      ps++;
    }
    for(int j = 0; j < n; ++j) {
      if(P[i][j] != P[j][i]) {return 0;}
      if(P[i][j] == 3) return 0;
    }
  }
  comp.clear();
  ps = 0;
  for(auto &cur : whr) cur = -1;
  for(int i = 0; i < n; ++i) {
    if(whr[i] != -1) {
      int _ = 0;
      for(int j = 0; j < n; ++j) {
        if(P[i][j] >= 1) {
          if(comp[whr[i]][_] != j) { return 0;}
          _++;
        }
      }
    }
    else {
      comp.pb({});
      for(int j = 0; j < n; ++j) {
        if(P[i][j] >= 1) {
          if(whr[j] != -1) { return 0;}
          comp.back().pb(j);
          whr[j] = ps;
        }
      }
      ps++;
    }
  }

  vt<vt<int>> g(n, vt<int> (n));
  for(int i = 0; i < sz(comp); ++i) {
    int cyc = 0;
    vt<int> cycle;
    int ncyc = -1;
    int HAVE = -1;
    for(int j = 0; j < sz(comp[i]); ++j) {
      bool flag = 1, hv = 0;
      int XX = 0;
      for(int l = 0; l < sz(comp[i]); ++l) {
        if(j != l) {
          if(P[comp[i][j]][comp[i][l]] == 1) {
            flag = 0;
          }
          else if(P[comp[i][j]][comp[i][l]] == 2) {
            hv = 1;
            XX++;
          }
        }
      }
      HAVE = max(HAVE, XX);
      flag &= hv;
      //print(flag);
      cyc += flag;
      if(flag) cycle.pb(comp[i][j]);
      else ncyc = comp[i][j];
    }
    /*print(comp);
    print(cyc);*/
    if(HAVE <= 2 && HAVE != 0) {
      return 0;
    }
    if(HAVE != 0) {
      if(ncyc == -1) ncyc = comp[i][0];
      g[comp[i].back()][ncyc] = 1;
      g[ncyc][comp[i].back()] = 1;
    }
    for(int j = 1; j < sz(comp[i]); ++j) {
      g[comp[i][j - 1]][comp[i][j]] = 1;
      g[comp[i][j]][comp[i][j - 1]] = 1;
    }
  }
  build(g);
  return 1;
}

/*
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //freop("");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}*/

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

supertrees.cpp: In function 'void freop(std::string)':
supertrees.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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