oj.uz

Submission #766179

# Submission time Handle Problem Language Result Execution time Memory
766179 2023-06-25T11:05:55 Z marvinthang Simurgh (IOI17_simurgh) C++17
100 / 100
 120 ms 15860 KB 
/*************************************
*    author: marvinthang             *
*    created: 25.06.2023 11:26:35    *
*************************************/

#include "simurgh.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

struct DisjointSet {
    
    int n, *lab = nullptr;

    DisjointSet(int _n = 0) {
        resize(_n);
    }

    void reset(void) {
        memset(lab, -1, (n + 1) * sizeof(int));
    }

    void resize(int _n) {
         if (lab != nullptr) delete[] lab;
         n = _n;
         lab = new int[n + 1];
         reset();
    }

    int find(int u) {
        assert(u <= n);
        return lab[u] < 0 ? u : lab[u] = find(lab[u]);
    }

    bool connected(int u, int v) { return find(u) == find(v); }
    bool isRoot(int u) { return lab[u] < 0; }
    int size(int u) { return -lab[find(u)]; }

    bool join(int u, int v) {
        if ((u = find(u)) == (v = find(v))) return false;
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }

};

using DSU = DisjointSet;

// end of template

const int MAX = 505;

int timeDfs;
vector <int> tree, r_edge, states;
vector <bool> used;
vector <vector <int>> adj;
vector <int> U, V, low, num, par, low_id, pos;

void dfs(int u) {
	num[u] = ++timeDfs;
	for (int id: adj[u]) if (!used[id]) {
		used[id] = true;
		if (u == V[id]) swap(U[id], V[id]);
		int v = V[id];
		if (!num[v]) {
			tree.push_back(id);
			par[v] = id;
			dfs(v);
			if (minimize(low[u], low[v])) low_id[u] = low_id[v];
			if (low[v] > num[u]) states[id] = 1;
		} else {
			r_edge.push_back(id);
			if (minimize(low[u], num[v])) low_id[u] = id;
		}
	}
}

vector <int> trace_path(int u, int p) {
	vector <int> res;
	while (u != p) {
		res.push_back(par[u]);
		u = U[par[u]];
	}
	return res;
}

vector <int> find_roads(int n, vector <int> u, vector <int> v) {
	int m = u.size();
	adj.assign(n, vector<int>());
	tree.clear();
	r_edge.clear();
	U = u; V = v;
	timeDfs = 0;
	num.assign(n, 0);
	low.assign(n, MAX);
	par.assign(n, 0);
	low_id.assign(n, 0);
	pos.assign(m, -1);
	used.assign(m, false);
	states.assign(m, -1);
	REP(i, m) {
		adj[U[i]].push_back(i);
		adj[V[i]].push_back(i);
	}
	dfs(0);
	REP(i, n - 1) pos[tree[i]] = i;
	int cur = count_common_roads(tree);
	for (int e1: tree) if (!~states[e1]) {
		int e2 = low_id[V[e1]];
		vector <int> p = trace_path(U[e2], V[e2]);
		REP(i, p.size()) if (p[i] == e1) {
			swap(p[i], p[0]);
			break;
		}
		REP(i, p.size()) {
			int e = p[i];
			tree[pos[e]] = e2;
			int nxt = count_common_roads(tree);
			tree[pos[e]] = e;
			if (nxt != cur) {
				states[e2] = nxt > cur;
				states[e] = nxt < cur;
				REP(j, i) states[p[j]] = states[e2];
				break;
			} else if (~states[e]) {
				states[e2] = states[e];
				REP(j, i) states[p[j]] = states[e];
				break;
			}
		}
		if (!~states[e1]) for (int e: p) states[e] = 0;
	}
	REP(u, n) {
		vector <int> f;
		for (int id: adj[u]) if (!~states[id]) f.push_back(id);
		while (true) {
			auto ask = [&] (int p) {
				if (!p) return 0;
				vector <int> a(f.begin(), f.begin() + p);
				DSU dsu(n);
				for (int x: a) dsu.join(U[x], V[x]);
				int cnt = 0;
				for (int x: tree) if (dsu.join(U[x], V[x])) {
					cnt += states[x];
					a.push_back(x);
				}
				return count_common_roads(a) - cnt;
			};
			int x = ask(f.size());
			if (!x) {
				for (int e: f) states[e] = 0;
				break;
			}
			int l = 0, r = (int) f.size() - 1;
			while (l <= r) {
				int m = l + r >> 1;
				if (ask(m + 1) == x) r = m - 1;
				else l = m + 1;
			}
			while (f.size() > l) {
				states[f.back()] = (int) f.size() == l + 1;
				f.pop_back();
			}
		}
	}
	vector <int> res;
	REP(i, m) if (states[i] == 1) res.push_back(i);	
	return res;
}

#ifdef LOCAL
#include "simurgh.h"

#include <cstdio>
#include <cassert>
#include <vector>
#include <cstdlib>
#include <string>

using namespace std;

static int MAXQ = 30000;

static int n, m, q = 0;
static vector<int> u, v;
static vector<bool> goal;

static void wrong_answer() {
	printf("NO\n");
	exit(0);
}

static bool is_valid(const vector<int>& r) {
	if(int(r.size()) != n - 1)
		return false;

	for(int i = 0; i < n - 1; i++)
		if (r[i] < 0 || r[i] >= m)
			return false;

	return true;
}

static int _count_common_roads_internal(const vector<int>& r) {
	if(!is_valid(r))
		wrong_answer();

	int common = 0;
	for(int i = 0; i < n - 1; i++) {
		bool is_common = goal[r[i]];
		if (is_common)
			common++;
	}

	return common;	
}

int count_common_roads(const vector<int>& r) {
	q++;
	if(q > MAXQ)
		wrong_answer();

	return _count_common_roads_internal(r);
}

int main() {
	file("simurgh");
	assert(2 == scanf("%d %d", &n, &m));

	u.resize(m);
	v.resize(m);

	for(int i = 0; i < m; i++)
		assert(2 == scanf("%d %d", &u[i], &v[i]));

	goal.resize(m, false);

	for(int i = 0; i < n - 1; i++) {
		int id;
		assert(1 == scanf("%d", &id));
		goal[id] = true;
	}

	vector<int> res = find_roads(n, u, v);

	if(_count_common_roads_internal(res) != n - 1)
		wrong_answer();
	printf("YES\n");
	printf("q = %d\n", q);

	return 0;
}
#endif

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:193:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  193 |     int m = l + r >> 1;
      |             ~~^~~
simurgh.cpp:197:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  197 |    while (f.size() > l) {
      |           ~~~~~~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 1 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct

Subtask #2
17.0 / 17.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 1 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 1 ms 340 KB correct
16 Correct 1 ms 340 KB correct
17 Correct 1 ms 340 KB correct
18 Correct 1 ms 340 KB correct
19 Correct 1 ms 340 KB correct
20 Correct 1 ms 340 KB correct
21 Correct 1 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 340 KB correct
24 Correct 1 ms 340 KB correct
25 Correct 0 ms 212 KB correct
26 Correct 1 ms 340 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 1 ms 340 KB correct
31 Correct 1 ms 340 KB correct
32 Correct 1 ms 340 KB correct
33 Correct 1 ms 340 KB correct
34 Correct 23 ms 3572 KB correct
35 Correct 20 ms 3528 KB correct
36 Correct 19 ms 3168 KB correct
37 Correct 5 ms 1108 KB correct
38 Correct 22 ms 3572 KB correct
39 Correct 21 ms 3304 KB correct
40 Correct 17 ms 3156 KB correct
41 Correct 20 ms 3532 KB correct
42 Correct 20 ms 3556 KB correct
43 Correct 10 ms 1748 KB correct
44 Correct 11 ms 1460 KB correct
45 Correct 8 ms 1664 KB correct
46 Correct 9 ms 1492 KB correct
47 Correct 7 ms 1108 KB correct
48 Correct 2 ms 332 KB correct
49 Correct 3 ms 724 KB correct
50 Correct 5 ms 1084 KB correct
51 Correct 8 ms 1680 KB correct
52 Correct 8 ms 1620 KB correct
53 Correct 7 ms 1492 KB correct
54 Correct 12 ms 1812 KB correct
55 Correct 8 ms 1492 KB correct
56 Correct 8 ms 1564 KB correct
57 Correct 7 ms 1568 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 76 ms 10292 KB correct
4 Correct 94 ms 15684 KB correct
5 Correct 91 ms 15860 KB correct
6 Correct 87 ms 15400 KB correct
7 Correct 85 ms 15556 KB correct
8 Correct 93 ms 15604 KB correct
9 Correct 93 ms 15604 KB correct
10 Correct 90 ms 15736 KB correct
11 Correct 105 ms 15592 KB correct
12 Correct 92 ms 15828 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 98 ms 15340 KB correct
15 Correct 107 ms 15816 KB correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 1 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 0 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 1 ms 340 KB correct
16 Correct 1 ms 340 KB correct
17 Correct 1 ms 340 KB correct
18 Correct 1 ms 340 KB correct
19 Correct 1 ms 340 KB correct
20 Correct 1 ms 340 KB correct
21 Correct 1 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 340 KB correct
24 Correct 1 ms 340 KB correct
25 Correct 0 ms 212 KB correct
26 Correct 1 ms 340 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 1 ms 340 KB correct
31 Correct 1 ms 340 KB correct
32 Correct 1 ms 340 KB correct
33 Correct 1 ms 340 KB correct
34 Correct 23 ms 3572 KB correct
35 Correct 20 ms 3528 KB correct
36 Correct 19 ms 3168 KB correct
37 Correct 5 ms 1108 KB correct
38 Correct 22 ms 3572 KB correct
39 Correct 21 ms 3304 KB correct
40 Correct 17 ms 3156 KB correct
41 Correct 20 ms 3532 KB correct
42 Correct 20 ms 3556 KB correct
43 Correct 10 ms 1748 KB correct
44 Correct 11 ms 1460 KB correct
45 Correct 8 ms 1664 KB correct
46 Correct 9 ms 1492 KB correct
47 Correct 7 ms 1108 KB correct
48 Correct 2 ms 332 KB correct
49 Correct 3 ms 724 KB correct
50 Correct 5 ms 1084 KB correct
51 Correct 8 ms 1680 KB correct
52 Correct 8 ms 1620 KB correct
53 Correct 7 ms 1492 KB correct
54 Correct 12 ms 1812 KB correct
55 Correct 8 ms 1492 KB correct
56 Correct 8 ms 1564 KB correct
57 Correct 7 ms 1568 KB correct
58 Correct 0 ms 212 KB correct
59 Correct 0 ms 212 KB correct
60 Correct 76 ms 10292 KB correct
61 Correct 94 ms 15684 KB correct
62 Correct 91 ms 15860 KB correct
63 Correct 87 ms 15400 KB correct
64 Correct 85 ms 15556 KB correct
65 Correct 93 ms 15604 KB correct
66 Correct 93 ms 15604 KB correct
67 Correct 90 ms 15736 KB correct
68 Correct 105 ms 15592 KB correct
69 Correct 92 ms 15828 KB correct
70 Correct 0 ms 212 KB correct
71 Correct 98 ms 15340 KB correct
72 Correct 107 ms 15816 KB correct
73 Correct 1 ms 212 KB correct
74 Correct 120 ms 15680 KB correct
75 Correct 90 ms 15428 KB correct
76 Correct 45 ms 8140 KB correct
77 Correct 91 ms 15848 KB correct
78 Correct 94 ms 15760 KB correct
79 Correct 94 ms 15808 KB correct
80 Correct 92 ms 15588 KB correct
81 Correct 81 ms 14616 KB correct
82 Correct 91 ms 15556 KB correct
83 Correct 66 ms 11980 KB correct
84 Correct 37 ms 7204 KB correct
85 Correct 42 ms 6980 KB correct
86 Correct 34 ms 5640 KB correct
87 Correct 25 ms 5080 KB correct
88 Correct 21 ms 4224 KB correct
89 Correct 22 ms 4420 KB correct
90 Correct 20 ms 4004 KB correct
91 Correct 10 ms 1748 KB correct
92 Correct 5 ms 724 KB correct
93 Correct 34 ms 6780 KB correct
94 Correct 28 ms 5520 KB correct
95 Correct 29 ms 5704 KB correct
96 Correct 22 ms 4340 KB correct
97 Correct 28 ms 4436 KB correct
98 Correct 32 ms 4920 KB correct
99 Correct 23 ms 4436 KB correct
100 Correct 14 ms 2680 KB correct
101 Correct 8 ms 980 KB correct
102 Correct 32 ms 5840 KB correct
103 Correct 33 ms 6056 KB correct
104 Correct 33 ms 5848 KB correct
105 Correct 32 ms 5848 KB correct