oj.uz

Submission #915072

# Submission time Handle Problem Language Result Execution time Memory
915072 2024-01-23T09:54:51 Z xynex Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 161 ms 23836 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;
            ncyc = comp[i][j];
          }
          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]);
    }
   /* print(comp[i]);
    print(cyc, HAVE);*/
    if(HAVE <= 1 && HAVE != 0) {
      return 0;
    }
    vt<int> accyc, acnc;
    for(int j = 0; j < sz(comp[i]); ++j) {
      int cheker = HAVE;
      for(int l = 0; l < n; ++l) {
        if(P[comp[i][j]][l] == 2) cheker--;
      }
      if(HAVE != 0 && !cheker) accyc.pb(comp[i][j]);
      else acnc.pb(comp[i][j]);
    }
    /*print("X", accyc);
    print("X", acnc);*/
    for(int j = 1; j < sz(acnc); ++j) {
      g[acnc[j - 1]][acnc[j]] = 1;
      g[acnc[j]][acnc[j - 1]] = 1;
    }
    if(!accyc.empty() && !acnc.empty()) accyc.pb(acnc.back());
    for(int j = 0; j < sz(accyc); ++j) {
      if(j == 0) {
        g[accyc[j]][accyc.back()] = 1;
        g[accyc.back()][accyc[j]] = 1;
        continue;
      }
      g[accyc[j - 1]][accyc[j]] = 1;
      g[accyc[j]][accyc[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 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:150:9: warning: variable 'ncyc' set but not used [-Wunused-but-set-variable]
  150 |     int ncyc = -1;
      |         ^~~~
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 1 ms 604 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 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 152 ms 23376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 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 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 152 ms 23376 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23516 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 66 ms 9556 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 37 ms 6392 KB Output is correct
21 Correct 156 ms 23396 KB Output is correct
22 Correct 147 ms 23380 KB Output is correct
23 Correct 161 ms 23236 KB Output is correct
24 Correct 148 ms 23380 KB Output is correct
25 Correct 61 ms 9552 KB Output is correct
26 Correct 58 ms 9560 KB Output is correct
27 Correct 158 ms 23256 KB Output is correct
28 Correct 148 ms 23448 KB Output is correct

Subtask #3
19.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 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 9 ms 1372 KB Output is correct
9 Correct 152 ms 23432 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 157 ms 23836 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 67 ms 9476 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 38 ms 6228 KB Output is correct
22 Correct 151 ms 23300 KB Output is correct
23 Correct 147 ms 23464 KB Output is correct
24 Correct 158 ms 23376 KB Output is correct
25 Correct 62 ms 13580 KB Output is correct
26 Correct 61 ms 9444 KB Output is correct
27 Correct 148 ms 23380 KB Output is correct
28 Correct 157 ms 23472 KB Output is correct
29 Correct 67 ms 13672 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 37 ms 6260 KB Output is correct
5 Correct 151 ms 23380 KB Output is correct
6 Correct 153 ms 23636 KB Output is correct
7 Correct 156 ms 23300 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 37 ms 6224 KB Output is correct
10 Correct 149 ms 23376 KB Output is correct
11 Correct 151 ms 23380 KB Output is correct
12 Correct 156 ms 23464 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 38 ms 6236 KB Too many ways to get from 34 to 94, should be 1 found no less than 2
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 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 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 152 ms 23376 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23516 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 66 ms 9556 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 37 ms 6392 KB Output is correct
21 Correct 156 ms 23396 KB Output is correct
22 Correct 147 ms 23380 KB Output is correct
23 Correct 161 ms 23236 KB Output is correct
24 Correct 148 ms 23380 KB Output is correct
25 Correct 61 ms 9552 KB Output is correct
26 Correct 58 ms 9560 KB Output is correct
27 Correct 158 ms 23256 KB Output is correct
28 Correct 148 ms 23448 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 9 ms 1372 KB Output is correct
37 Correct 152 ms 23432 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 157 ms 23836 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 67 ms 9476 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 38 ms 6228 KB Output is correct
50 Correct 151 ms 23300 KB Output is correct
51 Correct 147 ms 23464 KB Output is correct
52 Correct 158 ms 23376 KB Output is correct
53 Correct 62 ms 13580 KB Output is correct
54 Correct 61 ms 9444 KB Output is correct
55 Correct 148 ms 23380 KB Output is correct
56 Correct 157 ms 23472 KB Output is correct
57 Correct 67 ms 13672 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 64 ms 9480 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Incorrect 38 ms 6248 KB Too many ways to get from 92 to 98, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 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 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 152 ms 23376 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 23516 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 66 ms 9556 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 37 ms 6392 KB Output is correct
21 Correct 156 ms 23396 KB Output is correct
22 Correct 147 ms 23380 KB Output is correct
23 Correct 161 ms 23236 KB Output is correct
24 Correct 148 ms 23380 KB Output is correct
25 Correct 61 ms 9552 KB Output is correct
26 Correct 58 ms 9560 KB Output is correct
27 Correct 158 ms 23256 KB Output is correct
28 Correct 148 ms 23448 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 9 ms 1372 KB Output is correct
37 Correct 152 ms 23432 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 157 ms 23836 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 67 ms 9476 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 38 ms 6228 KB Output is correct
50 Correct 151 ms 23300 KB Output is correct
51 Correct 147 ms 23464 KB Output is correct
52 Correct 158 ms 23376 KB Output is correct
53 Correct 62 ms 13580 KB Output is correct
54 Correct 61 ms 9444 KB Output is correct
55 Correct 148 ms 23380 KB Output is correct
56 Correct 157 ms 23472 KB Output is correct
57 Correct 67 ms 13672 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 37 ms 6260 KB Output is correct
62 Correct 151 ms 23380 KB Output is correct
63 Correct 153 ms 23636 KB Output is correct
64 Correct 156 ms 23300 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 37 ms 6224 KB Output is correct
67 Correct 149 ms 23376 KB Output is correct
68 Correct 151 ms 23380 KB Output is correct
69 Correct 156 ms 23464 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 38 ms 6236 KB Too many ways to get from 34 to 94, should be 1 found no less than 2
74 Halted 0 ms 0 KB -