oj.uz

Submission #113816

# Submission time Handle Problem Language Result Execution time Memory
113816 2019-05-28T13:17:48 Z Mamnoon_Siam Minerals (JOI19_minerals) C++17
40 / 100
 109 ms 5132 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) {
	assert(u.size() == v.size());
	if(u.empty()) return;
	if(u.size() == 1) {
		Answer(u.back(), v.back());
		return;
	}
	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++) {
		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) {
	if(v.empty()) return;
	if(v.size() == 2) {
		Answer(v[0], v[1]);
		return;
	}
 
	random_shuffle(v.begin(), v.end(), RNG());
 
	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:23:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = mid + 1; i < v.size(); i++) {
                        ~~^~~~~~~~~~
minerals.cpp:32: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:72:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:79:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:92: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:34:3: 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 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 8 ms 768 KB Output is correct
4 Correct 15 ms 1280 KB Output is correct
5 Correct 31 ms 2040 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 15 ms 1280 KB Output is correct
9 Correct 31 ms 2040 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1536 KB Output is correct
12 Correct 33 ms 2096 KB Output is correct
13 Correct 32 ms 2260 KB Output is correct
14 Correct 32 ms 2168 KB Output is correct
15 Correct 100 ms 5132 KB Output is correct
16 Incorrect 109 ms 5076 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -