oj.uz

Submission #376759

# Submission time Handle Problem Language Result Execution time Memory
376759 2021-03-12T03:27:21 Z Kevin_Zhang_TW Minerals (JOI19_minerals) C++17
40 / 100
 73 ms 4512 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "minerals.h"

random_device rd;
mt19937 gen(rd());

// Query(int index) ;
// Answer(int A, int B) ;

int cnt ;
int qry(int ind) { return Query(ind); }
void ans(int a, int b) { Answer(a, b); }

void dc(vector<int> ids) {
	if (ids.empty()) return;
	shuffle(AI(ids), gen);
	if (ids.size() == 2) {
		ans(ids[0], ids[1]);
		return;
	}
	int n = ids.size();

	debug(AI(ids));

	vector<int> stay(n), thd;
	vector<vector<int>> thing;

	auto check = [&](int l, int r) {
		chmin(r, n);
		chmin(l, n);
		int lst = 0;
		for (int i = l;i < r;++i) {
			int now = qry(ids[i]);
			if (now == lst) stay[i] = true;
			lst = now;
		}
		for (int i = l;i < r;++i) {
			int now = qry(ids[i]);
			if (now == lst) stay[i] = true;
			lst = now;
		}
		vector<int> old;
		for (int i = l;i < r;++i) {
			if (stay[i]) old.pb(ids[i]);
			else thd.pb(ids[i]);
		}
		thing.pb(old);
	};

	int len = max(1, n / 3);


	//check(0, m), check(m, n);

	check(0, len + len);

	for (int i = len + len;i < n;++i)
		thd.pb(ids[i]);

	thing.pb(thd);


	DE(n, thing[0].size(), thing[1].size());

	for (auto vec : thing)
		dc(vec);

}
void Solve(int N) {
	vector<int> ids(N+N); iota(AI(ids), 1);
//	DE(2 * (N*2) * __lg(N*2));
//	return;
	dc(ids);
}

Compilation message

minerals.cpp: In function 'void dc(std::vector<int>)':
minerals.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
minerals.cpp:38:2: note: in expansion of macro 'debug'
   38 |  debug(AI(ids));
      |  ^~~~~
minerals.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
minerals.cpp:78:2: note: in expansion of macro 'DE'
   78 |  DE(n, thing[0].size(), thing[1].size());
      |  ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 492 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 10 ms 876 KB Output is correct
4 Correct 22 ms 1388 KB Output is correct
5 Correct 41 ms 2156 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 620 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 22 ms 1388 KB Output is correct
9 Correct 41 ms 2156 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 26 ms 1620 KB Output is correct
12 Correct 44 ms 2284 KB Output is correct
13 Correct 40 ms 2196 KB Output is correct
14 Correct 40 ms 2216 KB Output is correct
15 Incorrect 73 ms 4512 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -