oj.uz

Submission #113890

# Submission time Handle Problem Language Result Execution time Memory
113890 2019-05-29T03:44:57 Z Mamnoon_Siam Minerals (JOI19_minerals) C++17
100 / 100
 798 ms 5104 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 43000 + 5;
int dp[maxn], opt[maxn];

void solve(vector<int> u, vector<int> v, int f) {
	if(u.size() == 1) {
		Answer(u.back(), v.back());
		return;
	}

	int mid, last;
	if(f) {
		mid = u.size() - opt[u.size()];
		for(int i = mid; i < v.size(); i++) {
			last = Query(v[i]);
		}
	} else {
		mid = opt[u.size()];
		for(int i = 0; i < mid; i++) {
			last = Query(v[i]);
		}
	}

	vector<int> lu, lv(v.begin(), v.begin() + mid);
	vector<int> ru, rv(v.begin() + mid, 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;
		}
	}

	solve(lu, lv, 1);
	solve(ru, rv, 0);
}

void split(vector<int> v) {
	vector<int> l, r;
	int last = -1;
	for(int i = 0; i < v.size(); i++) {
		if(r.size() == v.size() / 2) {
			l.emplace_back(v[i]);
		} else {
			int rep = Query(v[i]);
			if(rep == last) {
				l.emplace_back(v[i]);
			} else {
				r.emplace_back(v[i]);
			} last = rep;
		}
	}
	solve(l, r, 1);
}

void Solve(int N) {
	dp[1] = 0;
	for(int i = 2; i <= N; i++) {
		int mn = INT_MAX, tmp, arg, cmp = (i - 1) / 2 + 1;
		for(int j = 1; j < i; j++) {
			tmp = dp[j] + dp[i - j] + (j < cmp ? j : i - j);
			if(tmp < mn) {
				mn = tmp;
				arg = j;
			}
		}
		dp[i] = mn + i - 1;
		opt[i] = arg;
	}
	/* In worst case scenario, maximum number
	   of calls to Query() is dp[N] + 2N - 1. */
	vector<int> v(2 * N);
	iota(v.begin(), v.end(), 1);
	split(v);
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, int)':
minerals.cpp:18:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = mid; i < v.size(); i++) {
                    ~~^~~~~~~~~~
minerals.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < u.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp: In function 'void split(std::vector<int>)':
minerals.cpp:54:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, int)':
minerals.cpp:38:4: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
    if(rep == last) {
    ^~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:81:10: warning: 'arg' may be used uninitialized in this function [-Wmaybe-uninitialized]
   opt[i] = arg;
   ~~~~~~~^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
3 Correct 12 ms 768 KB Output is correct
4 Correct 33 ms 1180 KB Output is correct
5 Correct 104 ms 1912 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct
19 Correct 621 ms 4640 KB Output is correct
20 Correct 607 ms 4596 KB Output is correct
21 Correct 602 ms 4520 KB Output is correct
22 Correct 602 ms 4292 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct
19 Correct 621 ms 4640 KB Output is correct
20 Correct 607 ms 4596 KB Output is correct
21 Correct 602 ms 4520 KB Output is correct
22 Correct 602 ms 4292 KB Output is correct
23 Correct 657 ms 4796 KB Output is correct
24 Correct 702 ms 4828 KB Output is correct
25 Correct 672 ms 4484 KB Output is correct
26 Correct 643 ms 4244 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct
19 Correct 621 ms 4640 KB Output is correct
20 Correct 607 ms 4596 KB Output is correct
21 Correct 602 ms 4520 KB Output is correct
22 Correct 602 ms 4292 KB Output is correct
23 Correct 657 ms 4796 KB Output is correct
24 Correct 702 ms 4828 KB Output is correct
25 Correct 672 ms 4484 KB Output is correct
26 Correct 643 ms 4244 KB Output is correct
27 Correct 677 ms 4740 KB Output is correct
28 Correct 682 ms 4980 KB Output is correct
29 Correct 671 ms 4612 KB Output is correct
30 Correct 658 ms 4368 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct
19 Correct 621 ms 4640 KB Output is correct
20 Correct 607 ms 4596 KB Output is correct
21 Correct 602 ms 4520 KB Output is correct
22 Correct 602 ms 4292 KB Output is correct
23 Correct 657 ms 4796 KB Output is correct
24 Correct 702 ms 4828 KB Output is correct
25 Correct 672 ms 4484 KB Output is correct
26 Correct 643 ms 4244 KB Output is correct
27 Correct 677 ms 4740 KB Output is correct
28 Correct 682 ms 4980 KB Output is correct
29 Correct 671 ms 4612 KB Output is correct
30 Correct 658 ms 4368 KB Output is correct
31 Correct 707 ms 5032 KB Output is correct
32 Correct 708 ms 4996 KB Output is correct
33 Correct 711 ms 4740 KB Output is correct
34 Correct 718 ms 4532 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 640 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 33 ms 1180 KB Output is correct
9 Correct 104 ms 1912 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 50 ms 1444 KB Output is correct
12 Correct 101 ms 1912 KB Output is correct
13 Correct 97 ms 1964 KB Output is correct
14 Correct 98 ms 1784 KB Output is correct
15 Correct 579 ms 4468 KB Output is correct
16 Correct 580 ms 4588 KB Output is correct
17 Correct 576 ms 4472 KB Output is correct
18 Correct 572 ms 4468 KB Output is correct
19 Correct 621 ms 4640 KB Output is correct
20 Correct 607 ms 4596 KB Output is correct
21 Correct 602 ms 4520 KB Output is correct
22 Correct 602 ms 4292 KB Output is correct
23 Correct 657 ms 4796 KB Output is correct
24 Correct 702 ms 4828 KB Output is correct
25 Correct 672 ms 4484 KB Output is correct
26 Correct 643 ms 4244 KB Output is correct
27 Correct 677 ms 4740 KB Output is correct
28 Correct 682 ms 4980 KB Output is correct
29 Correct 671 ms 4612 KB Output is correct
30 Correct 658 ms 4368 KB Output is correct
31 Correct 707 ms 5032 KB Output is correct
32 Correct 708 ms 4996 KB Output is correct
33 Correct 711 ms 4740 KB Output is correct
34 Correct 718 ms 4532 KB Output is correct
35 Correct 737 ms 5104 KB Output is correct
36 Correct 798 ms 4984 KB Output is correct
37 Correct 725 ms 4724 KB Output is correct
38 Correct 746 ms 4644 KB Output is correct