Submission #444184

#	Time	Username	Problem	Language	Result	Execution time	Memory
444184		BorisBarca	GTA (COI14_gta)	C++14	50 / 100	1648 ms	42468 KiB

gta

/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map
 
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC
 
const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};
 
inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}
 
inline void add(int &a, int b){
	a = sum(a, b);
}
 
inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}
 
inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}
 
inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}
 
inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}
 
ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}
 
inline int ccw(pii a, pii b, pii c) {
   return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}
 
 
inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}
 
void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}
 
void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}
 
string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}
 
ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 105;

int n, idx, ans[N];
string s[N];
map <string, bool> bio;
map <string, string> mut;
map <string, int> group;
map <int, string> pred;

void gen(string s){
  if (bio[s])
    return;
  if (sz(s) > 8)
    return;
  group[s] = idx;
  //cout << s _ idx << '\n';
  bio[s] = 1;
  REP(i, sz(s)){
    string t = "";
    t += s.substr(0, i);
    t += mut[s.substr(i, 1)];
    t += s.substr(i + 1, n - i - 1);
    if (bio[t])
      continue;
    gen(t);
  }

  REP(i, sz(s) - 1){
    string t = "";
    if (mut.count(s.substr(i, 2))){
      t += s.substr(0, i);
      t += mut[s.substr(i, 2)];
      t += s.substr(i + 2, n - (i + 2));
      if (bio[t])
        continue;
      gen(t);
    }
  }
}

vs svi;

void napravi(int n, string s){
  //cout << s << '\n';
  if (sz(s) == n){
    svi.PB(s);
    return;
  }
  for (auto a: {"A", "G", "C", "T"}){
    string t = s;
    t += a;
    napravi(n, t);
  }
}

void generirajLen(int l){
  svi.clear();
  napravi(l, "");
  FORA(x, svi){
    if (bio[x])
      continue;
    idx++;
    pred[idx] = x;
    gen(x);
  }
}
 
int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
 
  mut["A"] = "TC";
  mut["C"] = "AG";
  mut["G"] = "CT";
  mut["T"] = "GA";
  mut["TC"] = "A";
  mut["AG"] = "C";
  mut["CT"] = "G";
  mut["GA"] = "T";
	
  idx = 0;
  FOR(i, 1, 6){
    generirajLen(i);
  }
  
  cin >> n;
  REP(i, n){
    cin >> s[i];
    stack <char> st;

    FORA(el, s[i])
      st.push(el);

    while (sz(st) >= 5){
      string t = "";
      REP(j, 5){
        t += st.top();
        st.pop();
      }
      reverse(all(t));
      FORA(el, pred[group[t]])
        st.push(el);
    }
  }

  REP(i, n){
    REP(j, n)
      cout << (group[s[i]] == group[s[j]] ? 1 : 0);
    if (i != n - 1)
      cout << '\n';
  }

	return 0;
}

• Subtask 1: 50 / 100