oj.uz

Submission #1106579

# Submission time Handle Problem Language Result Execution time Memory
1106579 2024-10-30T16:49:53 Z Octagons Sphinx's Riddle (IOI24_sphinx) C++17
32 / 100
 739 ms 1948 KB 
#include <bits/stdc++.h>
using namespace std;
#include "sphinx.h"
#define sz(x) int(x.size())
int n;
int p[255], sz[255], p2[255], sz2[255], idxo = 1;
vector<int> adj57[255], tr[255], bck[255];
int vis[255];

int findp2(int u) {
    return p2[u] = (p2[u] == u ? u : findp2(p2[u]));
}

bool merge2(int u, int v) {
    u = findp2(u), v = findp2(v);
    if (u == v)return false;
    if (sz2[u] < sz2[v])swap(u, v);
    sz2[u] += sz2[v];
    p2[v] = u;
	return true;
}

int findp(int u) {
    return p[u] = (p[u] == u ? u : findp(p[u]));
}

void merge(int u, int v) {
    u = findp(u), v = findp(v);
    if (u == v)return;
    if (sz[u] < sz[v])swap(u, v);
    sz[u] += sz[v];
    p[v] = u;
}

bool chk(vector<int> v) {
	for (int i = 0; i < n; i++) {
		p2[i] = i;
		sz2[i] = 1;
	}
	int comps = n;
	for (int i = 0; i < n; i++) {
		for (auto &vv : adj57[i]) {
			if (~v[i] && v[i] == v[vv]) {
				comps -= merge2(i, vv);
			} else if (v[i] == -1 && v[vv] == -1 && findp(i) == findp(vv)) {
				comps -= merge2(i, vv);
			}
		}
	}
	int x = perform_experiment(v);
	return (comps > x);
}

bool chk2(int u, int v) {
	for (int i = 0; i < n; i++) {
		p2[i] = i;
		sz2[i] = 1;
	}
	int comps = n;
	vector<int> e(n, n);
	e[u] = e[v] = -1;
	for (int i = 0; i < n; i++) {
		for (auto &vv : adj57[i]) {
			if (e[i] == e[vv]) {
				comps -= merge2(i, vv);
			}
		}
	}
	int x = perform_experiment(e);
	return (comps == x);
}

void init(int u, int pr) {
	vis[u] = idxo++;
	for (auto &v : adj57[u]) {
		if (v == pr)continue;
		if (vis[v]) {
			if (vis[v] < vis[u])bck[u].push_back(v);
			continue;
		}
		if (chk2(u, v)) {
			merge(u, v);
		}
		init(v, u);
		tr[u].push_back(v);
	}
}

void soly(int u, vector<int> vvo) {
	if (vvo.empty())return;
	int l = 0, r = int(vvo.size()) - 1, id = -1;
	while (l <= r) {
		int m = (l + r) >> 1;
		vector<int> e(n, n);
		for (int j = 0; j <= m; j++) {
			for (int i = 0; i < n; i++) {
				if (findp(i) == vvo[j])e[i] = -1;
			}
		}
		e[u] = -1;
		if (chk(e)) {
			id = m;
			r = m-1;
		} else {
			l = m+1;
		}
	}
	if (~id) {
		merge(u, vvo[id]);
	} else {
		return;
	}
	if (id == sz(vvo)-1)return;
	vector<int> xx;
	for (int i = id+1; i < sz(vvo); i++) {
		xx.push_back(vvo[i]);
	}
	soly(u, xx);
}

void dfs(int u) {
	vector<int> vvo;
	for (auto &v : bck[u]) {
		if (findp(v) != findp(u))vvo.push_back(findp(v));
	}
	sort(vvo.begin(), vvo.end());
	vvo.erase(unique(vvo.begin(), vvo.end()), vvo.end());
	soly(u, vvo);
	for (auto &v : tr[u]) {
		dfs(v);
	}
}

std::vector<int> find_colours(int NH, std::vector<int> X, std::vector<int> Y) {
    n = NH;
    vector<int> ret(n, 0);
    for (int i = 0; i < n; i++) {
      p[i] = i;
      sz[i] = 1;
	  adj57[i].clear();
	  tr[i].clear();
	  bck[i].clear();
	  vis[i] = 0;
    }
    for (int i = 0; i < X.size(); i++) {
      int u = X[i], v = Y[i];
      adj57[u].push_back(v);
      adj57[v].push_back(u);
    }
	init(0, 0);
	dfs(0);
    for (int i = 0; i < n; i++) {
      ret[i] = findp(i);
    }
    return ret;
}

Compilation message

sphinx.cpp: In function 'std::vector<int> find_colours(int, std::vector<int>, std::vector<int>)':
sphinx.cpp:145:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB Partially correct

Subtask #1
1.5 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 1
2 Correct 1 ms 336 KB #experiments: 1
3 Partially correct 1 ms 336 KB Partially correct
4 Partially correct 1 ms 336 KB Partially correct

Subtask #2
3.5 / 7.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB Partially correct
2 Correct 1 ms 336 KB #experiments: 1
3 Correct 1 ms 336 KB #experiments: 1
4 Partially correct 1 ms 336 KB Partially correct
5 Partially correct 1 ms 336 KB Partially correct
6 Partially correct 1 ms 336 KB Partially correct
7 Partially correct 1 ms 336 KB Partially correct
8 Partially correct 1 ms 336 KB Partially correct
9 Partially correct 1 ms 336 KB Partially correct
10 Partially correct 1 ms 336 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 2 ms 336 KB Partially correct
15 Partially correct 8 ms 336 KB Partially correct
16 Partially correct 6 ms 336 KB Partially correct
17 Partially correct 10 ms 592 KB Partially correct
18 Partially correct 10 ms 336 KB Partially correct
19 Partially correct 7 ms 336 KB Partially correct
20 Partially correct 8 ms 516 KB Partially correct
21 Partially correct 9 ms 336 KB Partially correct
22 Partially correct 4 ms 336 KB Partially correct
23 Partially correct 4 ms 336 KB Partially correct
24 Partially correct 4 ms 336 KB Partially correct
25 Partially correct 4 ms 336 KB Partially correct
26 Partially correct 1 ms 336 KB Partially correct
27 Partially correct 1 ms 336 KB Partially correct
28 Partially correct 1 ms 348 KB Partially correct
29 Partially correct 3 ms 336 KB Partially correct
30 Partially correct 6 ms 336 KB Partially correct
31 Partially correct 7 ms 336 KB Partially correct
32 Partially correct 8 ms 336 KB Partially correct
33 Partially correct 1 ms 336 KB Partially correct
34 Partially correct 9 ms 336 KB Partially correct

Subtask #3
16.5 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 1
2 Correct 1 ms 336 KB #experiments: 1
3 Partially correct 1 ms 336 KB Partially correct
4 Partially correct 1 ms 336 KB Partially correct
5 Partially correct 1 ms 336 KB Partially correct
6 Partially correct 1 ms 336 KB Partially correct
7 Partially correct 1 ms 336 KB Partially correct
8 Partially correct 1 ms 336 KB Partially correct
9 Partially correct 1 ms 336 KB Partially correct
10 Partially correct 1 ms 336 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 8 ms 336 KB Partially correct
14 Partially correct 6 ms 500 KB Partially correct
15 Partially correct 6 ms 336 KB Partially correct
16 Partially correct 7 ms 484 KB Partially correct
17 Partially correct 8 ms 336 KB Partially correct
18 Partially correct 10 ms 336 KB Partially correct
19 Partially correct 10 ms 336 KB Partially correct
20 Partially correct 6 ms 592 KB Partially correct
21 Partially correct 6 ms 336 KB Partially correct

Subtask #4
10.5 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB #experiments: 1
2 Correct 1 ms 336 KB #experiments: 1
3 Partially correct 1 ms 336 KB Partially correct
4 Partially correct 1 ms 336 KB Partially correct
5 Partially correct 2 ms 336 KB Partially correct
6 Partially correct 8 ms 336 KB Partially correct
7 Partially correct 6 ms 336 KB Partially correct
8 Partially correct 10 ms 592 KB Partially correct
9 Partially correct 10 ms 336 KB Partially correct
10 Partially correct 7 ms 336 KB Partially correct
11 Partially correct 8 ms 516 KB Partially correct
12 Partially correct 9 ms 336 KB Partially correct
13 Partially correct 205 ms 1476 KB Partially correct
14 Partially correct 386 ms 1608 KB Partially correct
15 Partially correct 550 ms 1436 KB Partially correct
16 Partially correct 657 ms 1616 KB Partially correct
17 Partially correct 739 ms 1400 KB Partially correct
18 Partially correct 670 ms 1636 KB Partially correct
19 Partially correct 664 ms 1948 KB Partially correct
20 Partially correct 83 ms 1280 KB Partially correct
21 Partially correct 479 ms 1612 KB Partially correct

Subtask #5
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 336 KB Partially correct
2 Correct 1 ms 336 KB #experiments: 1
3 Correct 1 ms 336 KB #experiments: 1
4 Partially correct 1 ms 336 KB Partially correct
5 Partially correct 1 ms 336 KB Partially correct
6 Partially correct 1 ms 336 KB Partially correct
7 Partially correct 1 ms 336 KB Partially correct
8 Partially correct 1 ms 336 KB Partially correct
9 Partially correct 1 ms 336 KB Partially correct
10 Partially correct 1 ms 336 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 2 ms 336 KB Partially correct
15 Partially correct 8 ms 336 KB Partially correct
16 Partially correct 6 ms 336 KB Partially correct
17 Partially correct 10 ms 592 KB Partially correct
18 Partially correct 10 ms 336 KB Partially correct
19 Partially correct 7 ms 336 KB Partially correct
20 Partially correct 8 ms 516 KB Partially correct
21 Partially correct 9 ms 336 KB Partially correct
22 Partially correct 4 ms 336 KB Partially correct
23 Partially correct 4 ms 336 KB Partially correct
24 Partially correct 4 ms 336 KB Partially correct
25 Partially correct 4 ms 336 KB Partially correct
26 Partially correct 1 ms 336 KB Partially correct
27 Partially correct 1 ms 336 KB Partially correct
28 Partially correct 1 ms 348 KB Partially correct
29 Partially correct 3 ms 336 KB Partially correct
30 Partially correct 6 ms 336 KB Partially correct
31 Partially correct 7 ms 336 KB Partially correct
32 Partially correct 8 ms 336 KB Partially correct
33 Partially correct 1 ms 336 KB Partially correct
34 Partially correct 9 ms 336 KB Partially correct
35 Partially correct 8 ms 336 KB Partially correct
36 Partially correct 6 ms 500 KB Partially correct
37 Partially correct 6 ms 336 KB Partially correct
38 Partially correct 7 ms 484 KB Partially correct
39 Partially correct 8 ms 336 KB Partially correct
40 Partially correct 10 ms 336 KB Partially correct
41 Partially correct 10 ms 336 KB Partially correct
42 Partially correct 6 ms 592 KB Partially correct
43 Partially correct 6 ms 336 KB Partially correct
44 Partially correct 205 ms 1476 KB Partially correct
45 Partially correct 386 ms 1608 KB Partially correct
46 Partially correct 550 ms 1436 KB Partially correct
47 Partially correct 657 ms 1616 KB Partially correct
48 Partially correct 739 ms 1400 KB Partially correct
49 Partially correct 670 ms 1636 KB Partially correct
50 Partially correct 664 ms 1948 KB Partially correct
51 Partially correct 83 ms 1280 KB Partially correct
52 Partially correct 479 ms 1612 KB Partially correct
53 Partially correct 49 ms 592 KB Partially correct
54 Partially correct 61 ms 580 KB Partially correct
55 Partially correct 76 ms 584 KB Partially correct
56 Partially correct 85 ms 592 KB Partially correct
57 Partially correct 306 ms 1148 KB Partially correct
58 Partially correct 266 ms 936 KB Partially correct
59 Partially correct 265 ms 1664 KB Partially correct
60 Partially correct 307 ms 1224 KB Partially correct
61 Partially correct 6 ms 476 KB Partially correct
62 Partially correct 12 ms 336 KB Partially correct
63 Partially correct 9 ms 336 KB Partially correct
64 Partially correct 94 ms 584 KB Partially correct
65 Partially correct 88 ms 588 KB Partially correct
66 Partially correct 104 ms 604 KB Partially correct
67 Partially correct 96 ms 856 KB Partially correct
68 Partially correct 110 ms 852 KB Partially correct
69 Partially correct 97 ms 844 KB Partially correct
70 Partially correct 130 ms 840 KB Partially correct
71 Partially correct 104 ms 860 KB Partially correct
72 Partially correct 45 ms 584 KB Partially correct
73 Partially correct 75 ms 336 KB Partially correct
74 Partially correct 61 ms 600 KB Partially correct
75 Partially correct 77 ms 596 KB Partially correct
76 Partially correct 93 ms 608 KB Partially correct
77 Partially correct 97 ms 864 KB Partially correct
78 Partially correct 111 ms 604 KB Partially correct
79 Partially correct 109 ms 628 KB Partially correct
80 Partially correct 131 ms 888 KB Partially correct
81 Incorrect 138 ms 624 KB Vertices 29 and 38 do not have the same color, but they do in returned answer
82 Halted 0 ms 0 KB -