oj.uz

Submission #952940

# Submission time Handle Problem Language Result Execution time Memory
952940 2024-03-25T05:42:54 Z abczz Split the Attractions (IOI19_split) C++14
40 / 100
 172 ms 67412 KB 
#include "split.h"
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#define ll long long
 
using namespace std;
 
vector <ll> V;
vector <ll> adj[100000], padj[100000], E[200000];
bool ap[200000], ok;
vector <ll> G[200000], X[100000];
bool visited[100000], marked[100000], visited2[100000];
array<ll, 2> T[3];
queue <ll> Q, P;
ll m, k, A[3], B[3], in[100000], low[100000], st[100000], sz[200000], F[200000], C[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, ll w) {
  visited[u] = 1;
  for (auto v : adj[u]) {
    if (!visited[v] && !C[v]) {
      if (B[w] < A[w]) {
        F[v] = w;
        ++B[w];
      }
      else F[v] = 2;
      dfs(v, w);
    }
  }
}
 
void find(ll u, ll w) {
  if (B[w] < A[w]) {
    ++B[w];
    F[u] = w;
  }
  else F[u] = 2;
  dfs(u, w);
  for (auto v : adj[u]) {
    if (C[v] && !visited[v]) {
      find(v, w);
    }
  }
}
 
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]) {
        C[v] = 1;
      }
      for (auto v : G[u]) {
        if (F[v]) {
          ++B[1];
          dfs(v, 1);
        }
      }
      for (auto v : G[u]) {
        if (!F[v]) {
          find(v, 0);
          break;
        }
      }
		}
		else {
      for (auto v : G[u]) {
        C[v] = 1;
      }
      for (auto v : G[u]) {
        if (B[0] < A[0]) {
          ++B[0];
          F[v] = 0;
          dfs(v, 0);
        }
        else if (B[1] < A[1]) {
          ++B[1];
          F[v] = 1;
          dfs(v, 0);
        }
        else {
          F[v] = 2;
          dfs(v, 0);
        }
      }
		}
    ok = 1;
    return;
	}
}

void dfs2(ll u) {
  visited2[u] = 1;
  for (auto v : padj[u]) {
    if (!visited2[v]) {
      adj[u].push_back(v);
      adj[v].push_back(u);
      dfs2(v);
    }
  }
}
 
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) {
		padj[p[i]].push_back(q[i]);
		padj[q[i]].push_back(p[i]);
	}
  dfs2(0);
	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:47:8: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   47 |  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:165:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |  for (int i=0; i<p.size(); ++i) {
      |                ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB ok, correct split
2 Correct 5 ms 22196 KB ok, correct split
3 Correct 6 ms 22108 KB ok, correct split
4 Correct 5 ms 22108 KB ok, correct split
5 Correct 5 ms 22360 KB ok, correct split
6 Correct 5 ms 22164 KB ok, correct split
7 Correct 147 ms 60980 KB ok, correct split
8 Correct 156 ms 67052 KB ok, correct split
9 Correct 151 ms 67000 KB ok, correct split
10 Correct 156 ms 67272 KB ok, correct split
11 Correct 140 ms 60976 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22108 KB ok, correct split
2 Correct 5 ms 22148 KB ok, correct split
3 Correct 5 ms 22104 KB ok, correct split
4 Correct 153 ms 54460 KB ok, correct split
5 Correct 116 ms 45264 KB ok, correct split
6 Correct 170 ms 67412 KB ok, correct split
7 Correct 149 ms 66960 KB ok, correct split
8 Correct 172 ms 48416 KB ok, correct split
9 Correct 127 ms 44748 KB ok, correct split
10 Correct 82 ms 43720 KB ok, correct split
11 Correct 79 ms 43740 KB ok, correct split
12 Correct 73 ms 43812 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22108 KB ok, correct split
2 Correct 119 ms 45524 KB ok, correct split
3 Correct 47 ms 31568 KB ok, correct split
4 Correct 5 ms 22104 KB ok, correct split
5 Correct 170 ms 52096 KB ok, correct split
6 Correct 153 ms 52044 KB ok, correct split
7 Correct 145 ms 52000 KB ok, correct split
8 Correct 159 ms 52292 KB ok, correct split
9 Correct 134 ms 52044 KB ok, correct split
10 Correct 33 ms 27984 KB ok, no valid answer
11 Correct 51 ms 31828 KB ok, no valid answer
12 Correct 87 ms 42700 KB ok, no valid answer
13 Correct 112 ms 42964 KB ok, no valid answer
14 Correct 69 ms 41668 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22360 KB ok, correct split
2 Correct 5 ms 20056 KB ok, no valid answer
3 Correct 5 ms 22108 KB ok, correct split
4 Correct 5 ms 22108 KB ok, correct split
5 Correct 5 ms 22176 KB ok, correct split
6 Correct 5 ms 22108 KB ok, correct split
7 Correct 5 ms 22108 KB ok, correct split
8 Correct 5 ms 22108 KB ok, correct split
9 Correct 7 ms 22876 KB ok, correct split
10 Correct 7 ms 22872 KB ok, correct split
11 Correct 6 ms 22108 KB ok, correct split
12 Correct 7 ms 22876 KB ok, correct split
13 Correct 5 ms 22108 KB ok, correct split
14 Correct 5 ms 22108 KB ok, correct split
15 Correct 5 ms 22148 KB ok, correct split
16 Correct 5 ms 22108 KB ok, correct split
17 Correct 5 ms 22108 KB ok, correct split
18 Correct 5 ms 22108 KB ok, correct split
19 Correct 5 ms 22172 KB ok, correct split
20 Correct 6 ms 22360 KB ok, correct split
21 Correct 7 ms 23128 KB ok, correct split
22 Correct 7 ms 22876 KB ok, correct split
23 Correct 7 ms 22876 KB ok, correct split
24 Correct 7 ms 22876 KB ok, correct split
25 Correct 9 ms 22876 KB ok, correct split
26 Incorrect 8 ms 20572 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB ok, correct split
2 Correct 5 ms 22196 KB ok, correct split
3 Correct 6 ms 22108 KB ok, correct split
4 Correct 5 ms 22108 KB ok, correct split
5 Correct 5 ms 22360 KB ok, correct split
6 Correct 5 ms 22164 KB ok, correct split
7 Correct 147 ms 60980 KB ok, correct split
8 Correct 156 ms 67052 KB ok, correct split
9 Correct 151 ms 67000 KB ok, correct split
10 Correct 156 ms 67272 KB ok, correct split
11 Correct 140 ms 60976 KB ok, correct split
12 Correct 5 ms 22108 KB ok, correct split
13 Correct 5 ms 22148 KB ok, correct split
14 Correct 5 ms 22104 KB ok, correct split
15 Correct 153 ms 54460 KB ok, correct split
16 Correct 116 ms 45264 KB ok, correct split
17 Correct 170 ms 67412 KB ok, correct split
18 Correct 149 ms 66960 KB ok, correct split
19 Correct 172 ms 48416 KB ok, correct split
20 Correct 127 ms 44748 KB ok, correct split
21 Correct 82 ms 43720 KB ok, correct split
22 Correct 79 ms 43740 KB ok, correct split
23 Correct 73 ms 43812 KB ok, correct split
24 Correct 5 ms 22108 KB ok, correct split
25 Correct 119 ms 45524 KB ok, correct split
26 Correct 47 ms 31568 KB ok, correct split
27 Correct 5 ms 22104 KB ok, correct split
28 Correct 170 ms 52096 KB ok, correct split
29 Correct 153 ms 52044 KB ok, correct split
30 Correct 145 ms 52000 KB ok, correct split
31 Correct 159 ms 52292 KB ok, correct split
32 Correct 134 ms 52044 KB ok, correct split
33 Correct 33 ms 27984 KB ok, no valid answer
34 Correct 51 ms 31828 KB ok, no valid answer
35 Correct 87 ms 42700 KB ok, no valid answer
36 Correct 112 ms 42964 KB ok, no valid answer
37 Correct 69 ms 41668 KB ok, no valid answer
38 Correct 5 ms 22360 KB ok, correct split
39 Correct 5 ms 20056 KB ok, no valid answer
40 Correct 5 ms 22108 KB ok, correct split
41 Correct 5 ms 22108 KB ok, correct split
42 Correct 5 ms 22176 KB ok, correct split
43 Correct 5 ms 22108 KB ok, correct split
44 Correct 5 ms 22108 KB ok, correct split
45 Correct 5 ms 22108 KB ok, correct split
46 Correct 7 ms 22876 KB ok, correct split
47 Correct 7 ms 22872 KB ok, correct split
48 Correct 6 ms 22108 KB ok, correct split
49 Correct 7 ms 22876 KB ok, correct split
50 Correct 5 ms 22108 KB ok, correct split
51 Correct 5 ms 22108 KB ok, correct split
52 Correct 5 ms 22148 KB ok, correct split
53 Correct 5 ms 22108 KB ok, correct split
54 Correct 5 ms 22108 KB ok, correct split
55 Correct 5 ms 22108 KB ok, correct split
56 Correct 5 ms 22172 KB ok, correct split
57 Correct 6 ms 22360 KB ok, correct split
58 Correct 7 ms 23128 KB ok, correct split
59 Correct 7 ms 22876 KB ok, correct split
60 Correct 7 ms 22876 KB ok, correct split
61 Correct 7 ms 22876 KB ok, correct split
62 Correct 9 ms 22876 KB ok, correct split
63 Incorrect 8 ms 20572 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -