oj.uz

Submission #113870

# Submission time Handle Problem Language Result Execution time Memory
113870 2019-05-29T00:56:02 Z Mamnoon_Siam Minerals (JOI19_minerals) C++17
75 / 100
 122 ms 5364 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct RNG {
	int operator () (int n) {
		return rnd(n);
	}
};

void scattered(vector<int> u, vector<int> v, int f) {
	if(u.empty()) return;

	if(u.size() == 1) {
		Answer(u.back(), v.back());
		return;
	}
	random_shuffle(u.begin(), u.end(), RNG());
	random_shuffle(v.begin(), v.end(), RNG());
	int mid = ((int)u.size() - 2) >> 1;
	int last;
	if(f) {
		for(int i = mid + 1; i < v.size(); i++) {
			last = Query(v[i]);
		}
	} else {
		for(int i = 0; i <= mid; i++) {
			last = Query(v[i]);
		}
	}
	vector<int> lu, lv(v.begin(), v.begin() + mid + 1), ru, rv(v.begin() + mid + 1, v.end());
	for(int i = 0; i < u.size(); i++) {
		if(lu.size() == lv.size()) {
			ru.emplace_back(u[i]);
		} else if(ru.size() == rv.size()) {
			lu.emplace_back(u[i]);
		} else {
			int rep = Query(u[i]);
			if(rep == last) {
				lu.emplace_back(u[i]);
			} else {
				ru.emplace_back(u[i]);
			}
			last = rep;
		}
	}
	scattered(lu, lv, 1);
	scattered(ru, rv, 0);
}

void together(vector<int> v) {
	random_shuffle(v.begin(), v.end(), RNG());

	if(v.empty()) return;
	if(v.size() == 2) return Answer(v[0], v[1]);
	if(v.size() == 4) {
		int last = Query(v[0]);
		if(Query(v[1]) == last) {
			together({v[0], v[1]});
			together({v[2], v[3]});
			return;
		} else {
			scattered({v[2], v[3]}, {v[0], v[1]}, 1);
		}
		return;
	}
	if(v.size() == 6) {
		int last = Query(v[0]), rep;
		rep = Query(v[1]);
		if(rep == last) {
			Answer(v[0], v[1]);
			together({v[2], v[3], v[4], v[5]});
			return;
		} else {
			last = rep;
			rep = Query(v[2]);
			if(rep == last) {
				last = rep;
				rep = Query(v[0]);
				if(rep == last) {
					last = rep;
					Answer(v[0], v[2]);
					if(Query(v[3]) == last) {
						together({v[1], v[3]});
						together({v[4], v[5]});
						return;
					} else {
						return scattered({v[4], v[5]}, {v[1], v[3]}, 1);
					}
				} else {
					Answer(v[1], v[2]);
					return together({v[0], v[3], v[4], v[5]});
				}
			} else {
				return scattered({v[3], v[4], v[5]}, {v[0], v[1], v[2]}, 1);
			}
		}
		return;
	}

	int mid = ((int)v.size()) / 2 - 1;

	vector<int> l, r, dl, dr;
	int last = 0;
	for(int i = 0; i <= mid; i++) {
		int rep = Query(v[i]);
		if(rep == last) {
			l.emplace_back(v[i]);
		}
		last = rep;
	}
	for(int i = 0; i <= mid; i++) {
		int rep = Query(v[i]);
		if(rep == last) {
			l.emplace_back(v[i]);
		}
		last = rep;
	}
	last = 0;
	for(int i = mid + 1; i < v.size(); i++) {
		int rep = Query(v[i]);
		if(rep == last) {
			r.emplace_back(v[i]);
		}
		last = rep;
	}
	for(int i = mid + 1; i < v.size(); i++) {
		int rep = Query(v[i]);
		if(rep == last) {
			r.emplace_back(v[i]);
		}
		last = rep;
	}
	set<int> sl(l.begin(), l.end()), sr(r.begin(), r.end());
	for(int i = 0; i <= mid; i++) {
		if(sl.find(v[i]) == sl.end()) {
			dl.emplace_back(v[i]);
		}
	}
	for(int i = mid + 1; i < v.size(); i++) {
		if(sr.find(v[i]) == sr.end()) {
			dr.emplace_back(v[i]);
		}
	}
	together(l);
	together(r);
	scattered(dl, dr, 0);
}

void Solve(int N) {
	vector<int> v(2 * N);
	iota(v.begin(), v.end(), 1);
	together(v);
}

Compilation message

minerals.cpp: In function 'void scattered(std::vector<int>, std::vector<int>, int)':
minerals.cpp:25:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = mid + 1; i < v.size(); i++) {
                        ~~^~~~~~~~~~
minerals.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < u.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp: In function 'void together(std::vector<int>)':
minerals.cpp:122:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:129:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:142:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp: In function 'void scattered(std::vector<int>, std::vector<int>, int)':
minerals.cpp:41:4: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
    if(rep == last) {
    ^~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 10 ms 768 KB Output is correct
4 Correct 19 ms 1280 KB Output is correct
5 Correct 38 ms 2196 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct
19 Correct 122 ms 5240 KB Output is correct
20 Correct 122 ms 5132 KB Output is correct
21 Correct 119 ms 5088 KB Output is correct
22 Correct 118 ms 5044 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct
19 Correct 122 ms 5240 KB Output is correct
20 Correct 122 ms 5132 KB Output is correct
21 Correct 119 ms 5088 KB Output is correct
22 Correct 118 ms 5044 KB Output is correct
23 Incorrect 122 ms 5364 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct
19 Correct 122 ms 5240 KB Output is correct
20 Correct 122 ms 5132 KB Output is correct
21 Correct 119 ms 5088 KB Output is correct
22 Correct 118 ms 5044 KB Output is correct
23 Incorrect 122 ms 5364 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct
19 Correct 122 ms 5240 KB Output is correct
20 Correct 122 ms 5132 KB Output is correct
21 Correct 119 ms 5088 KB Output is correct
22 Correct 118 ms 5044 KB Output is correct
23 Incorrect 122 ms 5364 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 19 ms 1280 KB Output is correct
9 Correct 38 ms 2196 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 24 ms 1528 KB Output is correct
12 Correct 38 ms 2176 KB Output is correct
13 Correct 37 ms 2176 KB Output is correct
14 Correct 37 ms 2088 KB Output is correct
15 Correct 117 ms 4988 KB Output is correct
16 Correct 116 ms 5032 KB Output is correct
17 Correct 117 ms 5112 KB Output is correct
18 Correct 116 ms 4868 KB Output is correct
19 Correct 122 ms 5240 KB Output is correct
20 Correct 122 ms 5132 KB Output is correct
21 Correct 119 ms 5088 KB Output is correct
22 Correct 118 ms 5044 KB Output is correct
23 Incorrect 122 ms 5364 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -