oj.uz

답안 #1106623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106623 2024-10-30T17:46:31 Z Octagons 스핑크스 (IOI24_sphinx) C++17
10 / 100
 1044 ms 1896 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#include "sphinx.h"
//#include "grader.cpp"
#define sz(x) int(x.size())
int n, mmo;
int p[255], sz[255], p2[255], sz2[255], dep[255], idxo = 1;
vector<int> adj57[255], tr[255], bck[255], adj2[255], nds[255], ret;
int vis[255];
bool fnd[255];
vector<int> fo, so;

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;
		}
		init(v, u);
		tr[u].push_back(v);
	}
}
 
void soly(int u, vector<int> vvo) {
	if (vvo.empty())return;
	vector<int> ee(n, n);
	for (int j = 0; j < sz(vvo); j++) {
		for (int i = 0; i < n; i++) {
			if (findp(i) == vvo[j])ee[i] = -1;
		}
	}
	ee[u] = -1;
	if (sz(vvo) > 1) {
		if (!chk(ee))return;
	}
	int l = 0, r = int(vvo.size()) - 1 - (sz(vvo) > 1), id = (sz(vvo) > 1 ? int(vvo.size())-1 : -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;
	}
	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]) {
		if (chk2(u, v)) {
			merge(u, v);
		}
		dfs(v);
	}
}

void init2(int u, int pr) {
	vis[u] = 1;
	for (auto &v : adj2[u]) {
		if (vis[v])continue;
		dep[v] = (dep[u] ^ 1);
		init2(v, u);
	}
}

vector<int> nw(vector<int> x, int u) {
	vector<int> reti;
	for (auto &i : x) {
		if (i == u)continue;
		reti.push_back(i);
	}
	return reti;
}

void doyi() {
	for (int i = 0; i < n; i++) {
        if (fnd[i])break;
        fnd[i] = true;
        vector<int> ee(n, n);
        ee[i] = -1;
        int x = adj57[i][0];
        for (int col = 0; col < n; col++) {
            ee[x] = col;
            if (chk(ee)) {
                ret[i] = col;
                break;
            }
        }
    }
}

std::vector<int> find_colours(int NH, std::vector<int> X, std::vector<int> Y) {
    n = NH;
	fo.clear();
	so.clear();
    ret = vector<int> (n, 0);
    for (int i = 0; i < n; i++) {
      p[i] = i;
      sz[i] = 1;
	  adj2[i].clear();
	  adj57[i].clear();
	  fnd[i] = false;
	  nds[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);
    }
	mmo = X.size();
	init(0, 0);
	dfs(0);
	bool ff = true;
    for (int i = 0; i < n; i++) {
      ret[i] = findp(i);
	  ff &= (findp(i) == findp(0));
    }
	if (ff) {
		for (int i = 0; i < n; i++) {
			vector<int> e(n, n);
			e[0] = -1;
			e[adj57[0][0]] = i;
			if (chk(e)) {
				for (int j = 0; j < n; j++) {
					ret[j] = i;
				}
				break;
			}
		}
		return ret;
	}
	for (int i = 0; i < n; i++) {
		nds[findp(i)].push_back(i);
		for (auto &v : adj57[i]) {
			if (findp(i) == findp(v))continue;
			adj2[findp(i)].push_back(findp(v));
			adj2[findp(v)].push_back(findp(i));
		}
		vis[i] = 0;
		dep[i] = 0;
	}
	init2(findp(0), -1);
	fo.clear();
	so.clear();
	for (int i = 0; i < n; i++) {
		if (findp(i) != i)continue;
		if (dep[i])fo.push_back(i);
		else so.push_back(i);
	}
	doyi();
    return ret;
	swap(fo, so);
	for (int i = 0; i < n; i++) {
		dep[i] ^= 1;
	}
	doyi();
    return ret;
}

Compilation message

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

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 10

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 2
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 508 KB #experiments: 3

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 10
2 Correct 1 ms 336 KB #experiments: 2
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 4
5 Correct 1 ms 508 KB #experiments: 3
6 Correct 1 ms 348 KB #experiments: 74
7 Correct 8 ms 336 KB #experiments: 833
8 Correct 16 ms 336 KB #experiments: 1662
9 Correct 13 ms 336 KB #experiments: 1401
10 Correct 12 ms 336 KB #experiments: 1187
11 Correct 12 ms 336 KB #experiments: 1026
12 Correct 13 ms 336 KB #experiments: 1327
13 Correct 13 ms 336 KB #experiments: 1324
14 Correct 2 ms 336 KB #experiments: 64
15 Correct 26 ms 336 KB #experiments: 1124
16 Correct 37 ms 552 KB #experiments: 1576
17 Correct 42 ms 336 KB #experiments: 1353
18 Correct 45 ms 336 KB #experiments: 1742
19 Correct 34 ms 336 KB #experiments: 1501
20 Correct 38 ms 336 KB #experiments: 1565
21 Correct 32 ms 336 KB #experiments: 1372
22 Correct 5 ms 336 KB #experiments: 289
23 Correct 5 ms 336 KB #experiments: 246
24 Correct 10 ms 336 KB #experiments: 403
25 Correct 12 ms 336 KB #experiments: 744
26 Correct 12 ms 336 KB #experiments: 1015
27 Correct 12 ms 336 KB #experiments: 1119
28 Correct 12 ms 336 KB #experiments: 1257
29 Correct 18 ms 492 KB #experiments: 1354
30 Correct 20 ms 336 KB #experiments: 1340
31 Correct 32 ms 548 KB #experiments: 1422
32 Correct 52 ms 336 KB #experiments: 1621
33 Correct 2 ms 336 KB #experiments: 78
34 Correct 36 ms 336 KB #experiments: 1372

Subtask #3
0.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 2
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 508 KB #experiments: 3
5 Correct 1 ms 348 KB #experiments: 74
6 Correct 8 ms 336 KB #experiments: 833
7 Correct 16 ms 336 KB #experiments: 1662
8 Correct 13 ms 336 KB #experiments: 1401
9 Correct 12 ms 336 KB #experiments: 1187
10 Correct 12 ms 336 KB #experiments: 1026
11 Correct 13 ms 336 KB #experiments: 1327
12 Correct 13 ms 336 KB #experiments: 1324
13 Incorrect 67 ms 532 KB #experiments reached 2751
14 Halted 0 ms 0 KB -

Subtask #4
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 2
2 Correct 1 ms 336 KB #experiments: 4
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 508 KB #experiments: 3
5 Correct 2 ms 336 KB #experiments: 64
6 Correct 26 ms 336 KB #experiments: 1124
7 Correct 37 ms 552 KB #experiments: 1576
8 Correct 42 ms 336 KB #experiments: 1353
9 Correct 45 ms 336 KB #experiments: 1742
10 Correct 34 ms 336 KB #experiments: 1501
11 Correct 38 ms 336 KB #experiments: 1565
12 Correct 32 ms 336 KB #experiments: 1372
13 Incorrect 1044 ms 1896 KB #experiments reached 2751
14 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB #experiments: 10
2 Correct 1 ms 336 KB #experiments: 2
3 Correct 1 ms 336 KB #experiments: 4
4 Correct 1 ms 336 KB #experiments: 4
5 Correct 1 ms 508 KB #experiments: 3
6 Correct 1 ms 348 KB #experiments: 74
7 Correct 8 ms 336 KB #experiments: 833
8 Correct 16 ms 336 KB #experiments: 1662
9 Correct 13 ms 336 KB #experiments: 1401
10 Correct 12 ms 336 KB #experiments: 1187
11 Correct 12 ms 336 KB #experiments: 1026
12 Correct 13 ms 336 KB #experiments: 1327
13 Correct 13 ms 336 KB #experiments: 1324
14 Correct 2 ms 336 KB #experiments: 64
15 Correct 26 ms 336 KB #experiments: 1124
16 Correct 37 ms 552 KB #experiments: 1576
17 Correct 42 ms 336 KB #experiments: 1353
18 Correct 45 ms 336 KB #experiments: 1742
19 Correct 34 ms 336 KB #experiments: 1501
20 Correct 38 ms 336 KB #experiments: 1565
21 Correct 32 ms 336 KB #experiments: 1372
22 Correct 5 ms 336 KB #experiments: 289
23 Correct 5 ms 336 KB #experiments: 246
24 Correct 10 ms 336 KB #experiments: 403
25 Correct 12 ms 336 KB #experiments: 744
26 Correct 12 ms 336 KB #experiments: 1015
27 Correct 12 ms 336 KB #experiments: 1119
28 Correct 12 ms 336 KB #experiments: 1257
29 Correct 18 ms 492 KB #experiments: 1354
30 Correct 20 ms 336 KB #experiments: 1340
31 Correct 32 ms 548 KB #experiments: 1422
32 Correct 52 ms 336 KB #experiments: 1621
33 Correct 2 ms 336 KB #experiments: 78
34 Correct 36 ms 336 KB #experiments: 1372
35 Incorrect 67 ms 532 KB #experiments reached 2751
36 Halted 0 ms 0 KB -