oj.uz

답안 #918772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918772 2024-01-30T12:09:24 Z xynex Split the Attractions (IOI19_split) C++17
100 / 100
 103 ms 34384 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#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 pr pair
#define vt vector
#define ff first
#define ss second
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

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<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 = 4e5 + 5;
const double long pi = acos(-1);
const double long eps = 1e-12;
const int sq = 700;

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

const int N = 1e6 + 5;

pr<int, int> col[5];
vt<int> ans;
vt<vt<int>> g, g1;
int n, m;
int raz[N], fup[N], tin[N], timer, par[N];
void dfs(int v, int p = -1) {
  raz[v] = 1;
  tin[v] = fup[v] = ++timer;
  par[v] = p;
  for(auto to : g[v]) {
    if(to == p) continue;
    if(!raz[to]) {
      dfs(to, v);
      fup[v] = min(fup[v], fup[to]);
      raz[v] += raz[to];
      g1[v].pb(to);
    }
    else fup[v] = min(fup[v], tin[to]);
  }
}
int best, ost = MOD;
void dfs1(int v, int p = -1) {
  if(raz[v] >= col[0].ff) {
    if(ost > raz[v] - col[0].ff) {
      ost = raz[v] - col[0].ff;
      best = v;
    }
  }
  for(auto to : g1[v]) {
    if(to == p) continue;
    dfs1(to, v);
  }
}

int curcolor, cur;
void color(int v, bool ok) {
  if(!cur) return;
  //print(v);
  if(ans[v] == 0) {
    cur--;
    ans[v] = curcolor;
  }
  if(ok) {
    for(auto to : g1[v]) {
      if(cur) color(to, ok);
    }
  }
  else {
    for(auto to : g[v]) {
      if(ans[to] != col[0].ss && ans[to] != col[1].ss) {
        color(to, ok);
      }
    }
  }
}
vt<int> find_split(int xN, int xA, int xB, int xC, vt<int> p, vt<int> q) {
  n = xN;
  m = sz(q);
  col[0] = {xA, 1};
  col[1] = {xB, 2};
  col[2] = {xC, 3};
  ans.resize(n);
  sort(col, col + 3);
  g.resize(n);
  g1.resize(n);
  for(int i = 0; i < m; ++i) {
    g[p[i]].pb(q[i]);
    g[q[i]].pb(p[i]);
  }
  dfs(0);
 /* for(int i = 0; i < n; ++i) {
    for(auto num : g1[i]) print(i, num);
  }*/
  dfs1(0);
  if(n - raz[best] >= col[1].ff) {
    curcolor = col[0].ss, cur = col[0].ff;
    //print(best, cur, curcolor);
    color(best, 1);
    curcolor = col[1].ss, cur = col[1].ff;
   // print(par[best], cur, curcolor);
    color(par[best], 0);
    for(auto &num : ans) {
      if(num == 0) num = col[2].ss;
    }
    return ans;
  }
  else {
    curcolor = col[1].ss, cur = col[1].ff;
    ans[best] = curcolor;
    cur--;
    for(auto to : g1[best]) {
      if(cur && fup[to] > tin[best]) {
        color(best, 1);
      }
    }

    for(auto to : g1[best]) {
      if(cur && fup[to] <= tin[best]) {
        color(best, 1);
      }
    }

    curcolor = col[0].ss, cur = col[0].ff;
    if(par[best] != -1) color(par[best], 0);
    for(auto &num : ans) {
      if(cur) num = 0;
      else {
        if(num == 0) num = col[2].ss;
      }
    }
  }
  return ans;
}
/*
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

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB ok, correct split
2 Correct 1 ms 4444 KB ok, correct split
3 Correct 1 ms 4444 KB ok, correct split
4 Correct 1 ms 4440 KB ok, correct split
5 Correct 1 ms 4440 KB ok, correct split
6 Correct 1 ms 4440 KB ok, correct split
7 Correct 72 ms 33968 KB ok, correct split
8 Correct 64 ms 30660 KB ok, correct split
9 Correct 65 ms 29776 KB ok, correct split
10 Correct 58 ms 34372 KB ok, correct split
11 Correct 72 ms 34384 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB ok, correct split
2 Correct 2 ms 4440 KB ok, correct split
3 Correct 1 ms 4452 KB ok, correct split
4 Correct 69 ms 29136 KB ok, correct split
5 Correct 53 ms 22096 KB ok, correct split
6 Correct 64 ms 34384 KB ok, correct split
7 Correct 71 ms 30464 KB ok, correct split
8 Correct 78 ms 25684 KB ok, correct split
9 Correct 57 ms 23632 KB ok, correct split
10 Correct 39 ms 20820 KB ok, correct split
11 Correct 38 ms 20816 KB ok, correct split
12 Correct 37 ms 21324 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB ok, correct split
2 Correct 57 ms 22096 KB ok, correct split
3 Correct 19 ms 10076 KB ok, correct split
4 Correct 1 ms 4432 KB ok, correct split
5 Correct 67 ms 27076 KB ok, correct split
6 Correct 74 ms 26704 KB ok, correct split
7 Correct 65 ms 26564 KB ok, correct split
8 Correct 64 ms 28496 KB ok, correct split
9 Correct 69 ms 26192 KB ok, correct split
10 Correct 15 ms 9048 KB ok, no valid answer
11 Correct 23 ms 13400 KB ok, no valid answer
12 Correct 44 ms 21452 KB ok, no valid answer
13 Correct 54 ms 21944 KB ok, no valid answer
14 Correct 38 ms 21328 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB ok, correct split
2 Correct 1 ms 4440 KB ok, no valid answer
3 Correct 1 ms 4440 KB ok, correct split
4 Correct 1 ms 4440 KB ok, correct split
5 Correct 1 ms 4440 KB ok, correct split
6 Correct 1 ms 4444 KB ok, correct split
7 Correct 2 ms 4440 KB ok, correct split
8 Correct 1 ms 4440 KB ok, correct split
9 Correct 3 ms 4952 KB ok, correct split
10 Correct 3 ms 4952 KB ok, correct split
11 Correct 1 ms 4444 KB ok, correct split
12 Correct 2 ms 4876 KB ok, correct split
13 Correct 1 ms 4440 KB ok, correct split
14 Correct 1 ms 4440 KB ok, correct split
15 Correct 1 ms 4440 KB ok, correct split
16 Correct 2 ms 4440 KB ok, correct split
17 Correct 1 ms 4440 KB ok, correct split
18 Correct 1 ms 4444 KB ok, correct split
19 Correct 1 ms 4440 KB ok, correct split
20 Correct 2 ms 4696 KB ok, correct split
21 Correct 2 ms 4952 KB ok, correct split
22 Correct 2 ms 4952 KB ok, correct split
23 Correct 2 ms 4952 KB ok, correct split
24 Correct 2 ms 4952 KB ok, correct split
25 Correct 2 ms 4952 KB ok, correct split
26 Correct 2 ms 4952 KB ok, correct split
27 Correct 3 ms 4696 KB ok, correct split
28 Correct 2 ms 4696 KB ok, correct split
29 Correct 1 ms 4440 KB ok, correct split
30 Correct 2 ms 5208 KB ok, correct split
31 Correct 2 ms 4444 KB ok, correct split
32 Correct 1 ms 4440 KB ok, correct split
33 Correct 1 ms 4440 KB ok, correct split
34 Correct 2 ms 4696 KB ok, correct split
35 Correct 2 ms 4696 KB ok, correct split
36 Correct 2 ms 4952 KB ok, correct split
37 Correct 3 ms 4952 KB ok, correct split
38 Correct 4 ms 4952 KB ok, correct split
39 Correct 3 ms 4952 KB ok, correct split
40 Correct 3 ms 4952 KB ok, correct split
41 Correct 2 ms 4696 KB ok, correct split
42 Correct 2 ms 4700 KB ok, correct split
43 Correct 3 ms 4952 KB ok, correct split
44 Correct 3 ms 4952 KB ok, correct split
45 Correct 2 ms 4956 KB ok, correct split
46 Correct 2 ms 4952 KB ok, correct split
47 Correct 2 ms 4956 KB ok, no valid answer
48 Correct 2 ms 4696 KB ok, correct split
49 Correct 2 ms 4956 KB ok, correct split
50 Correct 1 ms 4440 KB ok, no valid answer
51 Correct 1 ms 4440 KB ok, no valid answer
52 Correct 2 ms 4696 KB ok, no valid answer
53 Correct 3 ms 4952 KB ok, no valid answer
54 Correct 2 ms 4700 KB ok, no valid answer
55 Correct 2 ms 4952 KB ok, no valid answer
56 Correct 2 ms 4696 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB ok, correct split
2 Correct 1 ms 4444 KB ok, correct split
3 Correct 1 ms 4444 KB ok, correct split
4 Correct 1 ms 4440 KB ok, correct split
5 Correct 1 ms 4440 KB ok, correct split
6 Correct 1 ms 4440 KB ok, correct split
7 Correct 72 ms 33968 KB ok, correct split
8 Correct 64 ms 30660 KB ok, correct split
9 Correct 65 ms 29776 KB ok, correct split
10 Correct 58 ms 34372 KB ok, correct split
11 Correct 72 ms 34384 KB ok, correct split
12 Correct 1 ms 4440 KB ok, correct split
13 Correct 2 ms 4440 KB ok, correct split
14 Correct 1 ms 4452 KB ok, correct split
15 Correct 69 ms 29136 KB ok, correct split
16 Correct 53 ms 22096 KB ok, correct split
17 Correct 64 ms 34384 KB ok, correct split
18 Correct 71 ms 30464 KB ok, correct split
19 Correct 78 ms 25684 KB ok, correct split
20 Correct 57 ms 23632 KB ok, correct split
21 Correct 39 ms 20820 KB ok, correct split
22 Correct 38 ms 20816 KB ok, correct split
23 Correct 37 ms 21324 KB ok, correct split
24 Correct 1 ms 4440 KB ok, correct split
25 Correct 57 ms 22096 KB ok, correct split
26 Correct 19 ms 10076 KB ok, correct split
27 Correct 1 ms 4432 KB ok, correct split
28 Correct 67 ms 27076 KB ok, correct split
29 Correct 74 ms 26704 KB ok, correct split
30 Correct 65 ms 26564 KB ok, correct split
31 Correct 64 ms 28496 KB ok, correct split
32 Correct 69 ms 26192 KB ok, correct split
33 Correct 15 ms 9048 KB ok, no valid answer
34 Correct 23 ms 13400 KB ok, no valid answer
35 Correct 44 ms 21452 KB ok, no valid answer
36 Correct 54 ms 21944 KB ok, no valid answer
37 Correct 38 ms 21328 KB ok, no valid answer
38 Correct 1 ms 4440 KB ok, correct split
39 Correct 1 ms 4440 KB ok, no valid answer
40 Correct 1 ms 4440 KB ok, correct split
41 Correct 1 ms 4440 KB ok, correct split
42 Correct 1 ms 4440 KB ok, correct split
43 Correct 1 ms 4444 KB ok, correct split
44 Correct 2 ms 4440 KB ok, correct split
45 Correct 1 ms 4440 KB ok, correct split
46 Correct 3 ms 4952 KB ok, correct split
47 Correct 3 ms 4952 KB ok, correct split
48 Correct 1 ms 4444 KB ok, correct split
49 Correct 2 ms 4876 KB ok, correct split
50 Correct 1 ms 4440 KB ok, correct split
51 Correct 1 ms 4440 KB ok, correct split
52 Correct 1 ms 4440 KB ok, correct split
53 Correct 2 ms 4440 KB ok, correct split
54 Correct 1 ms 4440 KB ok, correct split
55 Correct 1 ms 4444 KB ok, correct split
56 Correct 1 ms 4440 KB ok, correct split
57 Correct 2 ms 4696 KB ok, correct split
58 Correct 2 ms 4952 KB ok, correct split
59 Correct 2 ms 4952 KB ok, correct split
60 Correct 2 ms 4952 KB ok, correct split
61 Correct 2 ms 4952 KB ok, correct split
62 Correct 2 ms 4952 KB ok, correct split
63 Correct 2 ms 4952 KB ok, correct split
64 Correct 3 ms 4696 KB ok, correct split
65 Correct 2 ms 4696 KB ok, correct split
66 Correct 1 ms 4440 KB ok, correct split
67 Correct 2 ms 5208 KB ok, correct split
68 Correct 2 ms 4444 KB ok, correct split
69 Correct 1 ms 4440 KB ok, correct split
70 Correct 1 ms 4440 KB ok, correct split
71 Correct 2 ms 4696 KB ok, correct split
72 Correct 2 ms 4696 KB ok, correct split
73 Correct 2 ms 4952 KB ok, correct split
74 Correct 3 ms 4952 KB ok, correct split
75 Correct 4 ms 4952 KB ok, correct split
76 Correct 3 ms 4952 KB ok, correct split
77 Correct 3 ms 4952 KB ok, correct split
78 Correct 2 ms 4696 KB ok, correct split
79 Correct 2 ms 4700 KB ok, correct split
80 Correct 3 ms 4952 KB ok, correct split
81 Correct 3 ms 4952 KB ok, correct split
82 Correct 2 ms 4956 KB ok, correct split
83 Correct 2 ms 4952 KB ok, correct split
84 Correct 2 ms 4956 KB ok, no valid answer
85 Correct 2 ms 4696 KB ok, correct split
86 Correct 2 ms 4956 KB ok, correct split
87 Correct 1 ms 4440 KB ok, no valid answer
88 Correct 1 ms 4440 KB ok, no valid answer
89 Correct 2 ms 4696 KB ok, no valid answer
90 Correct 3 ms 4952 KB ok, no valid answer
91 Correct 2 ms 4700 KB ok, no valid answer
92 Correct 2 ms 4952 KB ok, no valid answer
93 Correct 2 ms 4696 KB ok, no valid answer
94 Correct 69 ms 26192 KB ok, correct split
95 Correct 98 ms 32648 KB ok, correct split
96 Correct 81 ms 30684 KB ok, correct split
97 Correct 20 ms 10180 KB ok, correct split
98 Correct 20 ms 10328 KB ok, correct split
99 Correct 32 ms 12624 KB ok, correct split
100 Correct 81 ms 26500 KB ok, correct split
101 Correct 80 ms 25452 KB ok, correct split
102 Correct 68 ms 24648 KB ok, correct split
103 Correct 61 ms 24264 KB ok, correct split
104 Correct 58 ms 24512 KB ok, correct split
105 Correct 31 ms 14928 KB ok, correct split
106 Correct 62 ms 24400 KB ok, correct split
107 Correct 52 ms 22096 KB ok, correct split
108 Correct 51 ms 22100 KB ok, correct split
109 Correct 79 ms 25680 KB ok, correct split
110 Correct 80 ms 26564 KB ok, correct split
111 Correct 89 ms 26820 KB ok, correct split
112 Correct 76 ms 25336 KB ok, correct split
113 Correct 71 ms 25292 KB ok, correct split
114 Correct 8 ms 6744 KB ok, correct split
115 Correct 8 ms 6232 KB ok, correct split
116 Correct 75 ms 26568 KB ok, correct split
117 Correct 79 ms 26568 KB ok, correct split
118 Correct 61 ms 23632 KB ok, correct split
119 Correct 72 ms 23636 KB ok, correct split
120 Correct 68 ms 29408 KB ok, correct split
121 Correct 51 ms 22096 KB ok, no valid answer
122 Correct 56 ms 21924 KB ok, no valid answer
123 Correct 83 ms 26812 KB ok, no valid answer
124 Correct 103 ms 26700 KB ok, no valid answer
125 Correct 52 ms 22988 KB ok, no valid answer
126 Correct 34 ms 20044 KB ok, no valid answer
127 Correct 59 ms 23792 KB ok, no valid answer