oj.uz

Submission #113795

# Submission time Handle Problem Language Result Execution time Memory
113795 2019-05-28T11:13:11 Z Mamnoon_Siam Minerals (JOI19_minerals) C++17
40 / 100
 45 ms 4852 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

void scattered(vector<int> u, vector<int> v) {
	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;
	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;
	}
	for(int i = 0; i <= mid; i++) {
		Query(v[i]);
	}
	scattered(lu, lv);
	scattered(ru, rv);
}

void together(vector<int> v) {
	if(v.empty()) return;
	if(v.size() == 2) {
		Answer(v[0], v[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);
}

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>)':
minerals.cpp:18: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:58:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:65:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = mid + 1; i < v.size(); i++) {
                       ~~^~~~~~~~~~
minerals.cpp:78: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>)':
minerals.cpp:20: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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 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 2 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 14 ms 640 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 19 ms 1536 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 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 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 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 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 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 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 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1536 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 16 ms 1604 KB Output is correct
12 Correct 22 ms 2024 KB Output is correct
13 Correct 21 ms 2964 KB Output is correct
14 Correct 16 ms 1584 KB Output is correct
15 Incorrect 45 ms 4852 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -