답안 #58794 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58794	2018-07-19T13:00:48 Z	reality	Simurgh (IOI17_simurgh)	C++17	70 / 100	536 ms	26460 KB

simurgh

#include "simurgh.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = 1024;
int was[N * N];
int w[N][N];
int s[N][N];
int f[N];
vi g[N];
pii dfs(int node) {
	for (auto it : g[node])
		if (f[it] == -1 && !was[w[node][it]]) {
			f[it] = node;
			auto cnt = dfs(it);
			if (cnt != mp(-1,-1))
				return cnt;
		}
		else
		if (f[node] != it && f[it] != -1 && !was[w[node][it]])
			return mp(node,it);
	return mp(-1,-1);
}
int p[N];
int Ws[N * N];
int get(int k) {
	return k == p[k] ? k : p[k] = get(p[k]);
} 
vi find_roads(int n,vi u,vi v) {
	if (n == 2) {
		return vi{0};
	}
	int called = 0;
	int m = u.size();
	memset(w,-1,sizeof(w));
	memset(s,-1,sizeof(s));
	for (int i = 0;i < m;++i)
		w[u[i]][v[i]] = w[v[i]][u[i]] = i,g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
	vi answer;	
	if (m != n * (n - 1) / 2) {
	 	for (int i = 0;i < n;++i)
			p[i] = i;
		vi ee;
		for (int i = 0;i < m;++i)
			if (get(u[i]) != get(v[i])) {
				ee.pb(i);
				p[get(u[i])] = get(v[i]);
			}
		do {
			vi cycle;
			for (int i = 0;i < n;++i)
				f[i] = -1;
			f[0] = 0;
			auto cnt = dfs(0);
			if (cnt != mp(-1,-1)) {
				cycle.pb(w[cnt.fi][cnt.se]);
				for (int i = cnt.fi;i != cnt.se;i = f[i])
					cycle.pb(w[i][f[i]]);
			} else {
				int ok = 1;
				for (int i = 0;i < m;++i)
					if (Ws[i])
						ok &= !was[i];
				if (ok)
					break;
				else {
					for (int i = 0;i < m;++i)
						if (Ws[i])
							was[i] = 0;
				}
			}
			for (auto it : cycle)
				was[it] = 1;
			vector < pii > rs;
			int shit = 0;
			for (int i = 0;i < cycle.size();++i) {
					if (Ws[cycle[i]]) {
						++shit;
						if (shit > 1)
							continue;
					}
					for (int j = 0;j < n;++j)
						p[j] = j;
					vi e;
					for (int j = 0;j < cycle.size();++j)
						if (i != j) {
							p[get(u[cycle[j]])] = get(v[cycle[j]]);
							e.pb(cycle[j]);
						}
					for (auto it : ee)
						if (get(u[it]) != get(v[it])) {
							e.pb(it);
							p[get(u[it])] = get(v[it]);
						}
					rs.pb(mp(count_common_roads(e),cycle[i]));
				}
			int mn = min_element(all(rs))->fi;
			int mx = max_element(all(rs))->fi;
			if (mn != mx) {
				for (auto it : rs)
					if (it.fi == mn)
						Ws[it.se] = 1;
			}
		} while (1);
		for (int i = 0;i < m;++i)
			if (Ws[i] || (!Ws[i] && !was[i]))
				answer.pb(i);
	} else {
		vi ee;
		for (int i = 0;i + 1 < n;++i)
			ee.pb(w[i][i + 1]);
		for (int i = 0;i + 1 < n;++i) {
			vi e1,e2,e3;
			int nxt = 0;
			while (nxt == i || nxt == i + 1)
				(++nxt) %= n;
			for (int j = 0;j < n;++j)
				if (j != i && j != i + 1 && j != nxt)
					e1.pb(w[j][(j + 1) % n]);
			e3 = e2 = e1;
			e1.pb(w[nxt][i]);
			e1.pb(w[i][i + 1]);
			e2.pb(w[i][i + 1]);
			e2.pb(w[i + 1][nxt]);
			e3.pb(w[i + 1][nxt]);
			e3.pb(w[nxt][i]);
			int cnt1 = count_common_roads(e1);
			int cnt2 = count_common_roads(e2);
			int cnt3 = count_common_roads(e3);
			if (min({cnt1,cnt2,cnt3}) != max({cnt1,cnt2,cnt3})) {
				if (cnt3 <= cnt1 && cnt3 <= cnt2)
					s[i][i + 1] = s[i + 1][i] = 1;
				else
					s[i][i + 1] = s[i + 1][i] = 0;
			} else 
				s[i][i + 1] = s[i + 1][i] = 0;
		}
		for (int i = 0;i < n;++i) {
			int deg = 0;
			vi e;
			for (int j = 0;j < n;++j)
				if (i != j)
					e.pb(w[i][j]);
			deg = count_common_roads(e);
			for (int k = 1;k <= deg;++k) {
				int t = 0;
				for (int d = 1 << 9;d;d /= 2)
					if (t + d < n) {
						vi e;
						for (int l = 0;l < n;++l)
							p[l] = l;
						for (int j = 0;j < t + d;++j)
							if (j != i)
								e.pb(w[i][j]),p[get(j)] = get(i);
						int cnt1 = 0;
						for (auto it : ee)
							if (get(u[it]) != get(v[it])) {
								cnt1 += s[u[it]][v[it]];
								p[get(u[it])] = get(v[it]);
								e.pb(it);
							}
						int cnt2 = count_common_roads(e);
						if (cnt2 - cnt1 < k)
							t += d;
					}
				s[i][t] = 1;
			}
		}
		for (int i = 0;i < n;++i)
			for (int j = 0;j < i;++j)
				if (s[i][j] == 1)
					answer.pb(w[i][j]);
	}
	return answer;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:88:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0;i < cycle.size();++i) {
                   ~~^~~~~~~~~~~~~~
simurgh.cpp:97:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int j = 0;j < cycle.size();++j)
                     ~~^~~~~~~~~~~~~~
simurgh.cpp:45:6: warning: unused variable 'called' [-Wunused-variable]
  int called = 0;
      ^~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8568 KB	correct
2	Correct	10 ms	8676 KB	correct
3	Correct	8 ms	8728 KB	correct
4	Correct	8 ms	8764 KB	correct
5	Correct	8 ms	8764 KB	correct
6	Correct	8 ms	8764 KB	correct
7	Correct	2 ms	8764 KB	correct
8	Correct	10 ms	8900 KB	correct
9	Correct	11 ms	8900 KB	correct
10	Correct	10 ms	8900 KB	correct
11	Correct	10 ms	8900 KB	correct
12	Correct	9 ms	8900 KB	correct
13	Correct	10 ms	8900 KB	correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8568 KB	correct
2	Correct	10 ms	8676 KB	correct
3	Correct	8 ms	8728 KB	correct
4	Correct	8 ms	8764 KB	correct
5	Correct	8 ms	8764 KB	correct
6	Correct	8 ms	8764 KB	correct
7	Correct	2 ms	8764 KB	correct
8	Correct	10 ms	8900 KB	correct
9	Correct	11 ms	8900 KB	correct
10	Correct	10 ms	8900 KB	correct
11	Correct	10 ms	8900 KB	correct
12	Correct	9 ms	8900 KB	correct
13	Correct	10 ms	8900 KB	correct
14	Correct	11 ms	8900 KB	correct
15	Correct	12 ms	8900 KB	correct
16	Correct	12 ms	8900 KB	correct
17	Correct	13 ms	8900 KB	correct
18	Correct	15 ms	8900 KB	correct
19	Correct	15 ms	8904 KB	correct
20	Correct	14 ms	8904 KB	correct
21	Correct	11 ms	8912 KB	correct
22	Correct	13 ms	8912 KB	correct
23	Correct	14 ms	8912 KB	correct
24	Correct	12 ms	8952 KB	correct
25	Correct	11 ms	8952 KB	correct
26	Correct	12 ms	8952 KB	correct
27	Correct	10 ms	8952 KB	correct
28	Correct	11 ms	8952 KB	correct
29	Correct	11 ms	8952 KB	correct
30	Correct	12 ms	8952 KB	correct
31	Correct	13 ms	8980 KB	correct
32	Correct	16 ms	8984 KB	correct
33	Correct	11 ms	9024 KB	correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8568 KB	correct
2	Correct	10 ms	8676 KB	correct
3	Correct	8 ms	8728 KB	correct
4	Correct	8 ms	8764 KB	correct
5	Correct	8 ms	8764 KB	correct
6	Correct	8 ms	8764 KB	correct
7	Correct	2 ms	8764 KB	correct
8	Correct	10 ms	8900 KB	correct
9	Correct	11 ms	8900 KB	correct
10	Correct	10 ms	8900 KB	correct
11	Correct	10 ms	8900 KB	correct
12	Correct	9 ms	8900 KB	correct
13	Correct	10 ms	8900 KB	correct
14	Correct	11 ms	8900 KB	correct
15	Correct	12 ms	8900 KB	correct
16	Correct	12 ms	8900 KB	correct
17	Correct	13 ms	8900 KB	correct
18	Correct	15 ms	8900 KB	correct
19	Correct	15 ms	8904 KB	correct
20	Correct	14 ms	8904 KB	correct
21	Correct	11 ms	8912 KB	correct
22	Correct	13 ms	8912 KB	correct
23	Correct	14 ms	8912 KB	correct
24	Correct	12 ms	8952 KB	correct
25	Correct	11 ms	8952 KB	correct
26	Correct	12 ms	8952 KB	correct
27	Correct	10 ms	8952 KB	correct
28	Correct	11 ms	8952 KB	correct
29	Correct	11 ms	8952 KB	correct
30	Correct	12 ms	8952 KB	correct
31	Correct	13 ms	8980 KB	correct
32	Correct	16 ms	8984 KB	correct
33	Correct	11 ms	9024 KB	correct
34	Correct	65 ms	9844 KB	correct
35	Correct	536 ms	10328 KB	correct
36	Correct	284 ms	10328 KB	correct
37	Correct	30 ms	10328 KB	correct
38	Correct	424 ms	10652 KB	correct
39	Correct	391 ms	10836 KB	correct
40	Correct	282 ms	10888 KB	correct
41	Correct	50 ms	10888 KB	correct
42	Correct	495 ms	11436 KB	correct
43	Correct	206 ms	11436 KB	correct
44	Correct	156 ms	11436 KB	correct
45	Correct	261 ms	11436 KB	correct
46	Correct	169 ms	11436 KB	correct
47	Correct	74 ms	11436 KB	correct
48	Correct	13 ms	11436 KB	correct
49	Correct	22 ms	11436 KB	correct
50	Correct	67 ms	11436 KB	correct
51	Correct	242 ms	11524 KB	correct
52	Correct	170 ms	11524 KB	correct
53	Correct	175 ms	11524 KB	correct
54	Correct	209 ms	11760 KB	correct
55	Correct	214 ms	11760 KB	correct
56	Correct	188 ms	11852 KB	correct
57	Correct	210 ms	12088 KB	correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	12088 KB	correct
2	Correct	9 ms	12088 KB	correct
3	Correct	203 ms	14208 KB	correct
4	Correct	292 ms	16280 KB	correct
5	Correct	320 ms	16996 KB	correct
6	Correct	297 ms	18048 KB	correct
7	Correct	313 ms	18896 KB	correct
8	Correct	287 ms	19824 KB	correct
9	Correct	326 ms	20880 KB	correct
10	Correct	277 ms	21680 KB	correct
11	Correct	294 ms	22736 KB	correct
12	Correct	347 ms	23712 KB	correct
13	Correct	8 ms	23712 KB	correct
14	Correct	239 ms	24660 KB	correct
15	Correct	285 ms	25480 KB	correct

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8568 KB	correct
2	Correct	10 ms	8676 KB	correct
3	Correct	8 ms	8728 KB	correct
4	Correct	8 ms	8764 KB	correct
5	Correct	8 ms	8764 KB	correct
6	Correct	8 ms	8764 KB	correct
7	Correct	2 ms	8764 KB	correct
8	Correct	10 ms	8900 KB	correct
9	Correct	11 ms	8900 KB	correct
10	Correct	10 ms	8900 KB	correct
11	Correct	10 ms	8900 KB	correct
12	Correct	9 ms	8900 KB	correct
13	Correct	10 ms	8900 KB	correct
14	Correct	11 ms	8900 KB	correct
15	Correct	12 ms	8900 KB	correct
16	Correct	12 ms	8900 KB	correct
17	Correct	13 ms	8900 KB	correct
18	Correct	15 ms	8900 KB	correct
19	Correct	15 ms	8904 KB	correct
20	Correct	14 ms	8904 KB	correct
21	Correct	11 ms	8912 KB	correct
22	Correct	13 ms	8912 KB	correct
23	Correct	14 ms	8912 KB	correct
24	Correct	12 ms	8952 KB	correct
25	Correct	11 ms	8952 KB	correct
26	Correct	12 ms	8952 KB	correct
27	Correct	10 ms	8952 KB	correct
28	Correct	11 ms	8952 KB	correct
29	Correct	11 ms	8952 KB	correct
30	Correct	12 ms	8952 KB	correct
31	Correct	13 ms	8980 KB	correct
32	Correct	16 ms	8984 KB	correct
33	Correct	11 ms	9024 KB	correct
34	Correct	65 ms	9844 KB	correct
35	Correct	536 ms	10328 KB	correct
36	Correct	284 ms	10328 KB	correct
37	Correct	30 ms	10328 KB	correct
38	Correct	424 ms	10652 KB	correct
39	Correct	391 ms	10836 KB	correct
40	Correct	282 ms	10888 KB	correct
41	Correct	50 ms	10888 KB	correct
42	Correct	495 ms	11436 KB	correct
43	Correct	206 ms	11436 KB	correct
44	Correct	156 ms	11436 KB	correct
45	Correct	261 ms	11436 KB	correct
46	Correct	169 ms	11436 KB	correct
47	Correct	74 ms	11436 KB	correct
48	Correct	13 ms	11436 KB	correct
49	Correct	22 ms	11436 KB	correct
50	Correct	67 ms	11436 KB	correct
51	Correct	242 ms	11524 KB	correct
52	Correct	170 ms	11524 KB	correct
53	Correct	175 ms	11524 KB	correct
54	Correct	209 ms	11760 KB	correct
55	Correct	214 ms	11760 KB	correct
56	Correct	188 ms	11852 KB	correct
57	Correct	210 ms	12088 KB	correct
58	Correct	3 ms	12088 KB	correct
59	Correct	9 ms	12088 KB	correct
60	Correct	203 ms	14208 KB	correct
61	Correct	292 ms	16280 KB	correct
62	Correct	320 ms	16996 KB	correct
63	Correct	297 ms	18048 KB	correct
64	Correct	313 ms	18896 KB	correct
65	Correct	287 ms	19824 KB	correct
66	Correct	326 ms	20880 KB	correct
67	Correct	277 ms	21680 KB	correct
68	Correct	294 ms	22736 KB	correct
69	Correct	347 ms	23712 KB	correct
70	Correct	8 ms	23712 KB	correct
71	Correct	239 ms	24660 KB	correct
72	Correct	285 ms	25480 KB	correct
73	Correct	3 ms	25480 KB	correct
74	Incorrect	204 ms	26460 KB	WA in grader: NO
75	Halted	0 ms	0 KB	-

답안 #58794

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 17.0 / 17.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 0 / 30.0

Subtask #1
13.0 / 13.0

Subtask #2
17.0 / 17.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
0 / 30.0