oj.uz

Submission #112234

# Submission time Handle Problem Language Result Execution time Memory
112234 2019-05-18T01:27:32 Z AngusRitossa Minerals (JOI19_minerals) C++14
90 / 100
 95 ms 3100 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#include <chrono>
#include <random>

#ifdef DEBUG
	#define D(x...) printf(x)
#else
	#define D(x...)
#endif
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, pre;
vector<int> before, after;
int other[2*70000];
int c;
int doQuery(int a)
{
	c++;
	assert(c != 1.1e6);
	D("querying %d\n", a);
	return Query(a);
}
void solve(vector<int> &b, vector<int> &a, bool inv = 0, bool shouldrem = 1, int half = -1)
{
	D("\n%lu %lu inv %d\n", a.size(), b.size(), inv);
	for (auto i : b) D("%d ", i);
	D(" a\n");
	for (auto i : a) D("%d ", i);
	D(" b\n");
	assert(a.size() == b.size());
	if (b.size() == 1)
	{
		other[a[0]] = b[0];
		return;
	}
	vector<int> firsthalf, secondhalf;
	vector<int> fa, sa;
	int ignore = -1;
	if (half == -2) ignore = b.size()-1;
	if (half < 0)
	{
		half = b.size()/2;
		if (shouldrem) half += b.size()/10;
	}
	for (int i = 0; i < b.size(); i++)
	{
		if (i < half) firsthalf.push_back(b[i]), assert(i != ignore);
		else 
		{
			secondhalf.push_back(b[i]);
			if (shouldrem && i != ignore) pre = doQuery(b[i]);
			else if (shouldrem) D("ignored %d\n", b[i]);
		}
	}
	if (inv) swap(firsthalf, secondhalf);
	int oldpre = pre;
	int sta = 0;
	shuffle(a.begin(), a.end(), rng);
	for (auto i : a)
	{
		if (fa.size() == b.size()-1) { sa.push_back(i); continue; }
		if (sa.size() == b.size()-1) { fa.push_back(i); continue; }
		if (fa.size() == firsthalf.size() && pre < oldpre)
		{
			sa.insert(sa.begin(), i); sta++;
			continue;
		}
		else if (sa.size() == secondhalf.size() && fa.size()+1 == firsthalf.size())
		{
			sta--;
			fa.push_back(i);
		//	D("doing this! %d\n", i);
			continue;
		}
		int q = doQuery(i);
		if (q == pre)
		{
			fa.push_back(i);
		}
		else
		{
			sa.push_back(i);
		}
		pre = q;
	}
	int h = -1;
	if (sta == -1) h = -2;
	if (h != -2) solve(firsthalf, fa, 0, 1, h);
	else solve(fa, firsthalf, pre < oldpre, 1, h);
	if (pre >= oldpre) 
	{ 
		solve(sa, secondhalf, 0);
	}
	else
	{
		sta = max(sta, 0);
		int half = sa.size()/2;
		half -= sa.size()/10;
		if (sta-1 >= half) half += sa.size()/10;
		while (sta-1 >= half)
		{
			pre = doQuery(sa[--sta]);
		}
		for (int i = sta; i < half; i++) pre = doQuery(sa[i]);
		solve(sa, secondhalf, 0, 0, half);
	}
}
void Solve(int N) 
{
	n = N;
	for (int i = 1; i <= 2*n; i++)
	{
		int q = doQuery(i);
		if (q != pre) before.push_back(i);
		else after.push_back(i);
		pre = q;
	}
	solve(before, after);
	for (int i = 1; i <= 2*n; i++)
	{
		if (other[i]) 
		{
			Answer(i, other[i]);
		}
	}
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&, bool, bool, int)':
minerals.cpp:27:12: warning: unused variable 'i' [-Wunused-variable]
  for (auto i : b) D("%d ", i);
            ^
minerals.cpp:29:12: warning: unused variable 'i' [-Wunused-variable]
  for (auto i : a) D("%d ", i);
            ^
minerals.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < b.size(); i++)
                  ~~^~~~~~~~~~

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 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 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 7 ms 508 KB Output is correct
4 Correct 12 ms 828 KB Output is correct
5 Correct 22 ms 1236 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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 KB Output is correct
19 Correct 62 ms 2844 KB Output is correct
20 Correct 61 ms 2804 KB Output is correct
21 Correct 59 ms 2676 KB Output is correct
22 Correct 62 ms 2548 KB Output is correct

Subtask #6
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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 KB Output is correct
19 Correct 62 ms 2844 KB Output is correct
20 Correct 61 ms 2804 KB Output is correct
21 Correct 59 ms 2676 KB Output is correct
22 Correct 62 ms 2548 KB Output is correct
23 Correct 68 ms 2944 KB Output is correct
24 Correct 65 ms 2804 KB Output is correct
25 Correct 60 ms 2680 KB Output is correct
26 Correct 63 ms 2548 KB Output is correct

Subtask #7
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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 KB Output is correct
19 Correct 62 ms 2844 KB Output is correct
20 Correct 61 ms 2804 KB Output is correct
21 Correct 59 ms 2676 KB Output is correct
22 Correct 62 ms 2548 KB Output is correct
23 Correct 68 ms 2944 KB Output is correct
24 Correct 65 ms 2804 KB Output is correct
25 Correct 60 ms 2680 KB Output is correct
26 Correct 63 ms 2548 KB Output is correct
27 Correct 71 ms 2904 KB Output is correct
28 Correct 73 ms 2880 KB Output is correct
29 Correct 95 ms 2788 KB Output is correct
30 Correct 62 ms 2572 KB Output is correct

Subtask #8
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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 KB Output is correct
19 Correct 62 ms 2844 KB Output is correct
20 Correct 61 ms 2804 KB Output is correct
21 Correct 59 ms 2676 KB Output is correct
22 Correct 62 ms 2548 KB Output is correct
23 Correct 68 ms 2944 KB Output is correct
24 Correct 65 ms 2804 KB Output is correct
25 Correct 60 ms 2680 KB Output is correct
26 Correct 63 ms 2548 KB Output is correct
27 Correct 71 ms 2904 KB Output is correct
28 Correct 73 ms 2880 KB Output is correct
29 Correct 95 ms 2788 KB Output is correct
30 Correct 62 ms 2572 KB Output is correct
31 Correct 68 ms 3060 KB Output is correct
32 Correct 68 ms 2976 KB Output is correct
33 Correct 64 ms 2804 KB Output is correct
34 Correct 62 ms 2568 KB Output is correct

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 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 508 KB Output is correct
8 Correct 12 ms 828 KB Output is correct
9 Correct 22 ms 1236 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 15 ms 1064 KB Output is correct
12 Correct 22 ms 1280 KB Output is correct
13 Correct 21 ms 1348 KB Output is correct
14 Correct 22 ms 1336 KB Output is correct
15 Correct 60 ms 2676 KB Output is correct
16 Correct 62 ms 2676 KB Output is correct
17 Correct 55 ms 2608 KB Output is correct
18 Correct 56 ms 2420 KB Output is correct
19 Correct 62 ms 2844 KB Output is correct
20 Correct 61 ms 2804 KB Output is correct
21 Correct 59 ms 2676 KB Output is correct
22 Correct 62 ms 2548 KB Output is correct
23 Correct 68 ms 2944 KB Output is correct
24 Correct 65 ms 2804 KB Output is correct
25 Correct 60 ms 2680 KB Output is correct
26 Correct 63 ms 2548 KB Output is correct
27 Correct 71 ms 2904 KB Output is correct
28 Correct 73 ms 2880 KB Output is correct
29 Correct 95 ms 2788 KB Output is correct
30 Correct 62 ms 2572 KB Output is correct
31 Correct 68 ms 3060 KB Output is correct
32 Correct 68 ms 2976 KB Output is correct
33 Correct 64 ms 2804 KB Output is correct
34 Correct 62 ms 2568 KB Output is correct
35 Incorrect 67 ms 3100 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -