oj.uz

답안 #376725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376725 2021-03-12T02:43:17 Z Kevin_Zhang_TW Minerals (JOI19_minerals) C++17
40 / 100
 53 ms 3204 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 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(), m = n / 2;

	debug(AI(ids));




	vector<int> stay(n), thd;

	auto check = [&](int l, int r) {

		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]);
		}
		dc(old);
	};

	check(0, m), check(m, n);
	dc(thd);

}
void Solve(int N) {
	vector<int> ids(N+N); iota(AI(ids), 1);
	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:37:2: note: in expansion of macro 'debug'
   37 |  debug(AI(ids));
      |  ^~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 7 ms 620 KB Output is correct
4 Correct 15 ms 1004 KB Output is correct
5 Correct 31 ms 1644 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 7 ms 620 KB Output is correct
8 Correct 15 ms 1004 KB Output is correct
9 Correct 31 ms 1644 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 19 ms 1132 KB Output is correct
12 Correct 29 ms 1644 KB Output is correct
13 Correct 29 ms 1516 KB Output is correct
14 Correct 29 ms 1512 KB Output is correct
15 Incorrect 53 ms 3204 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -