oj.uz

Submission #834310

# Submission time Handle Problem Language Result Execution time Memory
834310 2023-08-22T12:54:33 Z Lobo Simurgh (IOI17_simurgh) C++17
51 / 100
 136 ms 11396 KB 
#include "simurgh.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
 
const int maxn = 550;
const int maxm = maxn*maxn/2;
 
int n, m, h[maxn], mark[maxn], U[maxm], V[maxm];
pair<int,int> low[maxn];
vector<int> g[maxn], span, ins, outs;
int par[maxn], pari[maxn], is_span[maxm];
int in[maxm], out[maxm];
int queryspan;
int ds[maxn], dsz[maxn];


int cnt = 0;
int QUERY(vector<int> edges) {
	assert(edges.size() == n-1);
	cnt++;
	if(cnt > 8000) assert(false);
	return count_common_roads(edges);
}
 
int find(int v) {
	if(v == ds[v]) return v;
	return ds[v] = find(ds[v]);
}
 
void join(int u, int v) {
	if(dsz[u] < dsz[v]) swap(u,v);
	dsz[u]+= dsz[v];
	ds[v] = u;
}
 
vector<int> construct(vector<int> edges) {
	vector<int> finaledges;
 
	for(int i = 0; i < n; i++) {
		ds[i] = i;
		dsz[i] = 1;
	}
 
	for(auto i : edges) {
		int u = find(U[i]);
		int v = find(V[i]);
		if(u != v) {
			join(u,v);
			finaledges.pb(i);
		}
	}
	assert((int) finaledges.size()==n-1);
 	return finaledges;
}
 
void dfslow(int u, int ant) {
	mark[u] = 1;
	low[u] = mp(h[u],-1);
	for(auto i : g[u]) {
		int v = U[i]+V[i]-u;
		if(v == ant) continue;
 
		if(!mark[v]) {
			h[v] = h[u]+1;
			par[v] = u;
			pari[v] = i;
			span.pb(i);
			is_span[i] = 1;
			dfslow(v,u);
			low[u] = min(low[u],low[v]);
		}
		else {
			low[u] = min(low[u],mp(h[v],i));
		}
	}
}
 
void dfs(int u, int ant) {
	for(auto i : g[u]) {
		int v = U[i]+V[i]-u;
		if(v == ant || is_span[i] == 0) continue;
		dfs(v,u);
	}
 
	if(u == 0 || in[pari[u]] || out[pari[u]]) return;
	
	if(low[u] == mp(h[u],-1)) {
		in[pari[u]] = 1;
		ins.pb(pari[u]);
	}
	else {
		int ilow = low[u].sc;
		int ulow = U[ilow];
		int vlow = V[ilow];
		if(h[ulow] > h[vlow]) swap(ulow,vlow);
 
		int v = vlow;
		vector<int> edges;
		while(v != ulow) {
			edges.pb(pari[v]);
			v = par[v];
		}
 
		int know = -1;
		for(auto i : edges) {
			if(in[i] || out[i]) {
				know = i;
			}
		}
 
		// cout << u << " " << ilow << " - " << QUERY(construct(span)) << endl;
 
		if(know == -1) {
			vector<pair<int,int>> cons;
			cons.pb(mp(queryspan,ilow));
			for(auto i : edges) {
				vector<int> doquery;
				for(auto j : span) {
					if(j != i) doquery.pb(j);
				}
				doquery.pb(ilow);
				cons.pb(mp(QUERY(construct(doquery)),i));
			}
 
			sort(all(cons));
			if(cons[0].fr == cons.back().fr) {
				// todo mundo out / 0
				out[ilow] = 1; outs.pb(ilow);
				for(auto i : edges) {
					out[i] = 1; outs.pb(i);
				}
			}
			else {
				for(auto X : cons) {
					int i = X.sc;
					if(X.fr < cons.back().fr) {
						// in / 1
						in[i] = 1; ins.pb(i);
					}
					else {
						// out / 0
						out[i] = 1; outs.pb(i);
					}
				}
			}
		}
		else {
			vector<pair<int,int>> cons;
			cons.pb(mp(queryspan,ilow));
 
			vector<int> doquery;
			for(auto i : span) {
				if(i != pari[u]) {
					doquery.pb(i);
				}
			}
			doquery.pb(ilow);
			cons.pb(mp(QUERY(construct(doquery)),pari[u]));
			doquery.clear();
 
			for(auto i : span) {
				if(i != know) {
					doquery.pb(i);
				}
			}
			doquery.pb(ilow);
			cons.pb(mp(QUERY(construct(doquery)),know));
			doquery.clear();
 
			if(in[know]) {
				if(cons[0].fr == cons[2].fr) {
					in[ilow] = 1; ins.pb(ilow);
				}
				else {
					out[ilow] = 1; outs.pb(ilow);
				}
 
				if(cons[1].fr == cons[2].fr) {
					in[pari[u]] = 1; ins.pb(pari[u]);
				}
				else {
					out[pari[u]] = 1; outs.pb(pari[u]);
				}
			}
			else {
				if(cons[0].fr == cons[2].fr) {
					out[ilow] = 1; outs.pb(ilow);
				}
				else {
					in[ilow] = 1; ins.pb(ilow);
				}
 
				if(cons[1].fr == cons[2].fr) {
					out[pari[u]] = 1; outs.pb(pari[u]);
				}
				else {
					in[pari[u]] = 1; ins.pb(pari[u]);
				}
			}
		}
	}
}
 
vector<int> find_roads(int N, std::vector<int> UU, std::vector<int> VV) {
	n = N;
	m = UU.size();
	for(int i = 0; i < m; i++) {
		U[i] = UU[i];
		V[i] = VV[i];
		g[U[i]].pb(i);
		g[V[i]].pb(i);
	}
 
	par[0] = -1;
	pari[0] = -1;
	dfslow(0,-1);
	queryspan = QUERY(construct(span));
	dfs(0,-1);
 
	for(int u = 0; u < n; u++) {
		int L = 0;
		while(L < g[u].size()) {
			int l = L;
			int r = (int) g[u].size()-1;
			int nx = -1;
			while(l <= r) {
				int mid = (l+r)>>1;
				vector<int> doquery;
 
				for(int i = 0; i <= mid; i++) doquery.pb(g[u][i]);
				for(auto i : span) doquery.pb(i);
 
				vector<int> used = construct(doquery);
				int should = 0;
				for(auto i : used) should+= in[i];
 
				if(QUERY(used) > should) {
					nx = mid;
					r = mid-1;
				}
				else {
					l = mid+1;
				}
			}
			if(nx == -1) break;
			in[g[u][nx]] = 1; ins.pb(g[u][nx]);
			L = nx+1;
		}
	}
 	ins = construct(ins);
	assert(ins.size() == n-1);
	assert(QUERY(ins) == n-1);
	return ins;
 
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:2:
simurgh.cpp: In function 'int QUERY(std::vector<int>)':
simurgh.cpp:24:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |  assert(edges.size() == n-1);
      |         ~~~~~~~~~~~~~^~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:227:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  227 |   while(L < g[u].size()) {
      |         ~~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:2:
simurgh.cpp:256:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  256 |  assert(ins.size() == n-1);
      |         ~~~~~~~~~~~^~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 1 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 0 ms 328 KB correct
8 Correct 1 ms 340 KB correct
9 Correct 0 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 324 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 332 KB correct
18 Correct 1 ms 324 KB correct
19 Correct 2 ms 340 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 328 KB correct
24 Correct 1 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 324 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 328 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 1 ms 340 KB correct
3 Correct 1 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 0 ms 328 KB correct
8 Correct 1 ms 340 KB correct
9 Correct 0 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 324 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 332 KB correct
18 Correct 1 ms 324 KB correct
19 Correct 2 ms 340 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 328 KB correct
24 Correct 1 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 324 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 328 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 33 ms 1772 KB correct
35 Correct 31 ms 1728 KB correct
36 Correct 27 ms 1352 KB correct
37 Correct 9 ms 500 KB correct
38 Correct 30 ms 1760 KB correct
39 Correct 29 ms 1620 KB correct
40 Correct 27 ms 1364 KB correct
41 Correct 30 ms 1768 KB correct
42 Correct 30 ms 1768 KB correct
43 Correct 18 ms 1196 KB correct
44 Correct 19 ms 892 KB correct
45 Correct 17 ms 984 KB correct
46 Correct 17 ms 852 KB correct
47 Correct 12 ms 592 KB correct
48 Correct 4 ms 340 KB correct
49 Correct 9 ms 468 KB correct
50 Correct 12 ms 680 KB correct
51 Correct 17 ms 976 KB correct
52 Correct 20 ms 976 KB correct
53 Correct 16 ms 944 KB correct
54 Correct 18 ms 1192 KB correct
55 Correct 18 ms 1068 KB correct
56 Correct 18 ms 1068 KB correct
57 Correct 18 ms 980 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 86 ms 4224 KB correct
4 Runtime error 136 ms 11396 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 1 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 0 ms 328 KB correct
8 Correct 1 ms 340 KB correct
9 Correct 0 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 324 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 332 KB correct
18 Correct 1 ms 324 KB correct
19 Correct 2 ms 340 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 328 KB correct
24 Correct 1 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 324 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 328 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 33 ms 1772 KB correct
35 Correct 31 ms 1728 KB correct
36 Correct 27 ms 1352 KB correct
37 Correct 9 ms 500 KB correct
38 Correct 30 ms 1760 KB correct
39 Correct 29 ms 1620 KB correct
40 Correct 27 ms 1364 KB correct
41 Correct 30 ms 1768 KB correct
42 Correct 30 ms 1768 KB correct
43 Correct 18 ms 1196 KB correct
44 Correct 19 ms 892 KB correct
45 Correct 17 ms 984 KB correct
46 Correct 17 ms 852 KB correct
47 Correct 12 ms 592 KB correct
48 Correct 4 ms 340 KB correct
49 Correct 9 ms 468 KB correct
50 Correct 12 ms 680 KB correct
51 Correct 17 ms 976 KB correct
52 Correct 20 ms 976 KB correct
53 Correct 16 ms 944 KB correct
54 Correct 18 ms 1192 KB correct
55 Correct 18 ms 1068 KB correct
56 Correct 18 ms 1068 KB correct
57 Correct 18 ms 980 KB correct
58 Correct 1 ms 340 KB correct
59 Correct 1 ms 340 KB correct
60 Correct 86 ms 4224 KB correct
61 Runtime error 136 ms 11396 KB Execution killed with signal 6
62 Halted 0 ms 0 KB -