oj.uz

Submission #915059

# Submission time Handle Problem Language Result Execution time Memory
915059 2024-01-23T09:17:54 Z xynex Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 185 ms 22268 KB 
/**
  * 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;
}*/

Compilation message

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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22020 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22020 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22040 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 78 ms 8196 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 5724 KB Output is correct
21 Correct 173 ms 22268 KB Output is correct
22 Correct 166 ms 22096 KB Output is correct
23 Correct 170 ms 22020 KB Output is correct
24 Correct 169 ms 22036 KB Output is correct
25 Correct 77 ms 8276 KB Output is correct
26 Correct 83 ms 8272 KB Output is correct
27 Correct 185 ms 22184 KB Output is correct
28 Correct 164 ms 22032 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22020 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22040 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 78 ms 8196 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 5724 KB Output is correct
21 Correct 173 ms 22268 KB Output is correct
22 Correct 166 ms 22096 KB Output is correct
23 Correct 170 ms 22020 KB Output is correct
24 Correct 169 ms 22036 KB Output is correct
25 Correct 77 ms 8276 KB Output is correct
26 Correct 83 ms 8272 KB Output is correct
27 Correct 185 ms 22184 KB Output is correct
28 Correct 164 ms 22032 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22020 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22040 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 78 ms 8196 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 5724 KB Output is correct
21 Correct 173 ms 22268 KB Output is correct
22 Correct 166 ms 22096 KB Output is correct
23 Correct 170 ms 22020 KB Output is correct
24 Correct 169 ms 22036 KB Output is correct
25 Correct 77 ms 8276 KB Output is correct
26 Correct 83 ms 8272 KB Output is correct
27 Correct 185 ms 22184 KB Output is correct
28 Correct 164 ms 22032 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -