oj.uz

Submission #119119

# Submission time Handle Problem Language Result Execution time Memory
119119 2019-06-20T11:48:40 Z MvC Simurgh (IOI17_simurgh) C++14
51 / 100
 386 ms 4928 KB 
#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 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) {
	int called = 0;
	int m = u.size();
	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;
	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);
	return answer;
}

Compilation message

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

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB correct
2 Correct 2 ms 384 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 2 ms 384 KB correct
5 Correct 2 ms 384 KB correct
6 Correct 2 ms 384 KB correct
7 Correct 2 ms 384 KB correct
8 Correct 2 ms 384 KB correct
9 Correct 2 ms 384 KB correct
10 Correct 2 ms 384 KB correct
11 Correct 2 ms 384 KB correct
12 Correct 2 ms 384 KB correct
13 Correct 2 ms 384 KB correct
14 Correct 6 ms 640 KB correct
15 Correct 6 ms 640 KB correct
16 Correct 9 ms 640 KB correct
17 Correct 5 ms 664 KB correct
18 Correct 3 ms 640 KB correct
19 Correct 5 ms 640 KB correct
20 Correct 5 ms 640 KB correct
21 Correct 5 ms 640 KB correct
22 Correct 4 ms 640 KB correct
23 Correct 4 ms 640 KB correct
24 Correct 4 ms 640 KB correct
25 Correct 2 ms 640 KB correct
26 Correct 3 ms 640 KB correct
27 Correct 4 ms 640 KB correct
28 Correct 3 ms 640 KB correct
29 Correct 3 ms 640 KB correct
30 Correct 4 ms 640 KB correct
31 Correct 4 ms 640 KB correct
32 Correct 4 ms 640 KB correct
33 Correct 5 ms 640 KB correct
34 Correct 357 ms 2504 KB correct
35 Correct 373 ms 2508 KB correct
36 Correct 243 ms 2260 KB correct
37 Correct 18 ms 1408 KB correct
38 Correct 359 ms 2640 KB correct
39 Correct 336 ms 2424 KB correct
40 Correct 225 ms 2296 KB correct
41 Correct 386 ms 2652 KB correct
42 Correct 382 ms 2580 KB correct
43 Correct 180 ms 2040 KB correct
44 Correct 132 ms 1840 KB correct
45 Correct 171 ms 1864 KB correct
46 Correct 144 ms 2000 KB correct
47 Correct 51 ms 1536 KB correct
48 Correct 6 ms 1408 KB correct
49 Correct 14 ms 1408 KB correct
50 Correct 49 ms 1536 KB correct
51 Correct 197 ms 1792 KB correct
52 Correct 138 ms 1916 KB correct
53 Correct 138 ms 1784 KB correct
54 Correct 187 ms 2040 KB correct
55 Correct 156 ms 1792 KB correct
56 Correct 146 ms 1824 KB correct
57 Correct 147 ms 1884 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB correct
2 Correct 2 ms 384 KB correct
3 Incorrect 285 ms 4928 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB correct
2 Correct 2 ms 384 KB correct
3 Correct 2 ms 384 KB correct
4 Correct 2 ms 384 KB correct
5 Correct 2 ms 384 KB correct
6 Correct 2 ms 384 KB correct
7 Correct 2 ms 384 KB correct
8 Correct 2 ms 384 KB correct
9 Correct 2 ms 384 KB correct
10 Correct 2 ms 384 KB correct
11 Correct 2 ms 384 KB correct
12 Correct 2 ms 384 KB correct
13 Correct 2 ms 384 KB correct
14 Correct 6 ms 640 KB correct
15 Correct 6 ms 640 KB correct
16 Correct 9 ms 640 KB correct
17 Correct 5 ms 664 KB correct
18 Correct 3 ms 640 KB correct
19 Correct 5 ms 640 KB correct
20 Correct 5 ms 640 KB correct
21 Correct 5 ms 640 KB correct
22 Correct 4 ms 640 KB correct
23 Correct 4 ms 640 KB correct
24 Correct 4 ms 640 KB correct
25 Correct 2 ms 640 KB correct
26 Correct 3 ms 640 KB correct
27 Correct 4 ms 640 KB correct
28 Correct 3 ms 640 KB correct
29 Correct 3 ms 640 KB correct
30 Correct 4 ms 640 KB correct
31 Correct 4 ms 640 KB correct
32 Correct 4 ms 640 KB correct
33 Correct 5 ms 640 KB correct
34 Correct 357 ms 2504 KB correct
35 Correct 373 ms 2508 KB correct
36 Correct 243 ms 2260 KB correct
37 Correct 18 ms 1408 KB correct
38 Correct 359 ms 2640 KB correct
39 Correct 336 ms 2424 KB correct
40 Correct 225 ms 2296 KB correct
41 Correct 386 ms 2652 KB correct
42 Correct 382 ms 2580 KB correct
43 Correct 180 ms 2040 KB correct
44 Correct 132 ms 1840 KB correct
45 Correct 171 ms 1864 KB correct
46 Correct 144 ms 2000 KB correct
47 Correct 51 ms 1536 KB correct
48 Correct 6 ms 1408 KB correct
49 Correct 14 ms 1408 KB correct
50 Correct 49 ms 1536 KB correct
51 Correct 197 ms 1792 KB correct
52 Correct 138 ms 1916 KB correct
53 Correct 138 ms 1784 KB correct
54 Correct 187 ms 2040 KB correct
55 Correct 156 ms 1792 KB correct
56 Correct 146 ms 1824 KB correct
57 Correct 147 ms 1884 KB correct
58 Correct 2 ms 384 KB correct
59 Correct 2 ms 384 KB correct
60 Incorrect 285 ms 4928 KB WA in grader: NO
61 Halted 0 ms 0 KB -