oj.uz

Submission #952757

# Submission time Handle Problem Language Result Execution time Memory
952757 2024-03-24T17:30:09 Z abczz Split the Attractions (IOI19_split) C++14
40 / 100
 171 ms 60356 KB 
#include "split.h"
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#define ll long long

using namespace std;

vector <ll> V;
vector <ll> adj[100000], E[200000];
bool ap[200000], ok;
vector <ll> G[200000], X[100000];
bool visited[100000];
array<ll, 2> T[3];
ll m, k, A[3], B[3], low[100000], st[100000], sz[200000], F[200000], cnt;

void tar(ll u, ll p) {
	V.push_back(u);
	low[u] = st[u] = ++cnt;
	ll rch = 0;
	for (auto v : adj[u]) {
		if (!st[v]) {
			++rch;
			tar(v, u);
			low[u] = min(low[u], low[v]);
			if (low[v] >= st[u]) {
				if (p != -1) ap[u] = 1;
				while (!V.empty()) {
					auto x = V.back();
					V.pop_back();
					X[x].push_back(k);
					G[k].push_back(x);
					if (x == v) break;
				}
				X[u].push_back(k);
				G[k].push_back(u);
				++k;
			}
		}
		else if (v != p) {
			low[u] = min(low[u], st[v]);
		}
	}
	if (p == -1 & rch > 1) ap[u] = 1;
}

void dfs(ll u) {
  visited[u] = 1;
  for (auto v : adj[u]) {
    if (!visited[v]) {
      if (B[F[u]] < A[F[u]]) {
        F[v] = F[u];
        ++B[F[u]];
      }
      else F[v] = 2;
      dfs(v);
    }
  }
}

void solve(ll u, ll p) {
	if (ap[u]) ++sz[u];
	else sz[u] += G[u].size() - E[u].size();
	ll mx = -1;
	for (auto v : E[u]) {
		if (v != p) {
			solve(v, u);
			sz[u] += sz[v];
			mx = max(mx, sz[v]);
		}
	}
	mx = max(mx, m - sz[u]);
	if (!ok && !ap[u] && mx <= m-A[0]) {
		if (mx >= A[1]) {
			if (m-sz[u] == mx) {
				F[p] = 1;
			}
			else {
				for (auto v : E[u]) {
					if (v != p) {
						if (sz[v] == mx) {
							F[v] = 1;
							break;
						}
					}
				}
			}
      for (auto v : G[u]) {
        visited[v] = 1;
      }
      bool tmp = 0;
  		for (auto v : G[u]) {
        if (F[v]) {
          ++B[F[v]];
          dfs(v);
          tmp = 1;
        }
        else if (tmp) {
          if (B[0] < A[0]) {
            ++B[0];
            F[v] = 0;
          }
          else F[v] = 2;
          dfs(v);
        }
      }
      for (auto v : G[u]) {
        if (F[v]) break;
        if (B[0] < A[0]) {
          ++B[0];
          F[v] = 0;
        }
        else F[v] = 2;
        dfs(v);
      }
		}
		else {
			ll cur = 0;
      for (auto v : G[u]) {
        F[v] = 1;
      }
			for (auto v : G[u]) {
				if (v == p) cur += m-sz[u];
				else if (ap[v]) cur += sz[v];
				else ++cur;
				F[v] = 0;
				if (cur >= A[0]) {
					break;
				}
			}
      for (auto v : G[u]) {
        visited[v] = 1;
      }
  		for (auto v : G[u]) {
        if (B[F[v]] < A[F[v]]) ++B[F[v]];
        else F[v] = 2;
        dfs(v);
      }
		}
    ok = 1;
    return;
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	A[0] = T[0][0] = a, A[1] = T[1][0] = b, A[2] = T[2][0] = c;
  T[1][1] = 1, T[2][1] = 2;
	sort(A, A+3);
  sort(T, T+3);
	m = n;
	k = n;
	for (int i=0; i<p.size(); ++i) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	tar(0, -1);
	for (int i=0; i<n; ++i) {
		if (ap[i]) {
			for (auto u : X[i]) {
				E[i].push_back(u);
				E[u].push_back(i);
			}
		}
	}
  solve(n, -1);
  vector <int> U;
  if (ok) {
    U.clear();
    for (int i=0; i<n; ++i) {
      U.push_back(T[F[i]][1]+1);
    }
  }
  else {
    for (int i=0; i<n; ++i) {
      U.push_back(F[i]);
    }
  }
	return U;
}

Compilation message

split.cpp: In function 'void tar(long long int, long long int)':
split.cpp:45:8: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   45 |  if (p == -1 & rch > 1) ap[u] = 1;
      |      ~~^~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:153:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |  for (int i=0; i<p.size(); ++i) {
      |                ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 17240 KB ok, correct split
2 Correct 5 ms 17244 KB ok, correct split
3 Correct 4 ms 17296 KB ok, correct split
4 Correct 5 ms 17244 KB ok, correct split
5 Correct 4 ms 17244 KB ok, correct split
6 Correct 4 ms 17244 KB ok, correct split
7 Correct 160 ms 54220 KB ok, correct split
8 Correct 141 ms 60356 KB ok, correct split
9 Correct 140 ms 60112 KB ok, correct split
10 Correct 73 ms 41680 KB ok, correct split
11 Correct 65 ms 41676 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17244 KB ok, correct split
2 Correct 5 ms 17244 KB ok, correct split
3 Correct 5 ms 17244 KB ok, correct split
4 Correct 116 ms 39752 KB ok, correct split
5 Correct 106 ms 37796 KB ok, correct split
6 Correct 72 ms 41724 KB ok, correct split
7 Correct 171 ms 60148 KB ok, correct split
8 Correct 116 ms 35140 KB ok, correct split
9 Correct 61 ms 28888 KB ok, correct split
10 Correct 65 ms 36044 KB ok, correct split
11 Correct 62 ms 36036 KB ok, correct split
12 Correct 65 ms 37832 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17240 KB ok, correct split
2 Correct 119 ms 36684 KB ok, correct split
3 Correct 38 ms 25472 KB ok, correct split
4 Correct 4 ms 17280 KB ok, correct split
5 Correct 136 ms 45520 KB ok, correct split
6 Correct 139 ms 45864 KB ok, correct split
7 Correct 128 ms 45200 KB ok, correct split
8 Correct 126 ms 45540 KB ok, correct split
9 Correct 143 ms 45252 KB ok, correct split
10 Correct 28 ms 24412 KB ok, no valid answer
11 Correct 43 ms 27472 KB ok, no valid answer
12 Correct 78 ms 36556 KB ok, no valid answer
13 Correct 97 ms 37072 KB ok, no valid answer
14 Correct 59 ms 35672 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17240 KB ok, correct split
2 Correct 4 ms 17244 KB ok, no valid answer
3 Correct 4 ms 17244 KB ok, correct split
4 Incorrect 4 ms 17244 KB 2 components are not connected
5 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 17240 KB ok, correct split
2 Correct 5 ms 17244 KB ok, correct split
3 Correct 4 ms 17296 KB ok, correct split
4 Correct 5 ms 17244 KB ok, correct split
5 Correct 4 ms 17244 KB ok, correct split
6 Correct 4 ms 17244 KB ok, correct split
7 Correct 160 ms 54220 KB ok, correct split
8 Correct 141 ms 60356 KB ok, correct split
9 Correct 140 ms 60112 KB ok, correct split
10 Correct 73 ms 41680 KB ok, correct split
11 Correct 65 ms 41676 KB ok, correct split
12 Correct 4 ms 17244 KB ok, correct split
13 Correct 5 ms 17244 KB ok, correct split
14 Correct 5 ms 17244 KB ok, correct split
15 Correct 116 ms 39752 KB ok, correct split
16 Correct 106 ms 37796 KB ok, correct split
17 Correct 72 ms 41724 KB ok, correct split
18 Correct 171 ms 60148 KB ok, correct split
19 Correct 116 ms 35140 KB ok, correct split
20 Correct 61 ms 28888 KB ok, correct split
21 Correct 65 ms 36044 KB ok, correct split
22 Correct 62 ms 36036 KB ok, correct split
23 Correct 65 ms 37832 KB ok, correct split
24 Correct 3 ms 17240 KB ok, correct split
25 Correct 119 ms 36684 KB ok, correct split
26 Correct 38 ms 25472 KB ok, correct split
27 Correct 4 ms 17280 KB ok, correct split
28 Correct 136 ms 45520 KB ok, correct split
29 Correct 139 ms 45864 KB ok, correct split
30 Correct 128 ms 45200 KB ok, correct split
31 Correct 126 ms 45540 KB ok, correct split
32 Correct 143 ms 45252 KB ok, correct split
33 Correct 28 ms 24412 KB ok, no valid answer
34 Correct 43 ms 27472 KB ok, no valid answer
35 Correct 78 ms 36556 KB ok, no valid answer
36 Correct 97 ms 37072 KB ok, no valid answer
37 Correct 59 ms 35672 KB ok, no valid answer
38 Correct 4 ms 17240 KB ok, correct split
39 Correct 4 ms 17244 KB ok, no valid answer
40 Correct 4 ms 17244 KB ok, correct split
41 Incorrect 4 ms 17244 KB 2 components are not connected
42 Halted 0 ms 0 KB -