oj.uz

답안 #376713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376713 2021-03-12T02:27:45 Z fhvirus Minerals (JOI19_minerals) C++17
75 / 100
 44 ms 6228 KB 
#include "minerals.h"
 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) begin(x),end(x)
template<class I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<class I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr<<endl;}
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<class I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
 
void solve(vector<int> &a, vector<int> &b, bool in){
	debug("solving:");
	DE(AI(a)); DE(AI(b));
	assert(a.size() == b.size());
 
	if(a.size() < 1 or b.size() < 1){
		return;
	}
	if(a.size() == 1 and b.size() == 1){
		Answer(a[0], b[0]);
		return;
	}
	vector<int> la, lb, ra, rb;
	int h = 1<<(__lg(a.size()) - 1);
	h = a.size() - h;
	for(int i = 0; i < h; ++i) la.pb(a[i]);
	for(int i = h; i < a.size(); ++i) lb.pb(a[i]);
 
	int ls, cs;
	for(int i: la) cs = Query(i);
 
	for(int i: b){
		ls = cs;
		cs = Query(i);
		if(cs == ls ^ in) ra.pb(i);
		else rb.pb(i);
	}
 
	DE(AI(la)); DE(AI(lb));
	DE(AI(ra)); DE(AI(rb));
 
	solve(la, ra, !in);
	solve(lb, rb,  in);
}
 
void Solve(int N) {
	vector<int> hulan;
	for(int i = 1; i <= N * 2; ++i) hulan.pb(i);
	vector<vector<int>> as, bs;
	vector<int> a, b;
	int ls = 0, cs;
	for(int i: hulan){
		cs = Query(i);
		if(cs == ls) b.pb(i);
		else a.pb(i);

		if(a.size() == b.size()){
			as.pb(a);
			bs.pb(b);
			a.clear();
			b.clear();
		}

		ls = cs;
	}
 	for(int i = 0; i < as.size(); ++i)
 		solve(as[i], bs[i], true);
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&, bool)':
minerals.cpp:22:20: warning: statement has no effect [-Wunused-value]
   22 | #define debug(...) 0
      |                    ^
minerals.cpp:27:2: note: in expansion of macro 'debug'
   27 |  debug("solving:");
      |  ^~~~~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:28:2: note: in expansion of macro 'DE'
   28 |  DE(AI(a)); DE(AI(b));
      |  ^~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:28:13: note: in expansion of macro 'DE'
   28 |  DE(AI(a)); DE(AI(b));
      |             ^~
minerals.cpp:42:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i = h; i < a.size(); ++i) lb.pb(a[i]);
      |                 ~~^~~~~~~~~~
minerals.cpp:50:9: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   50 |   if(cs == ls ^ in) ra.pb(i);
      |      ~~~^~~~~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:54:2: note: in expansion of macro 'DE'
   54 |  DE(AI(la)); DE(AI(lb));
      |  ^~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:54:14: note: in expansion of macro 'DE'
   54 |  DE(AI(la)); DE(AI(lb));
      |              ^~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:55:2: note: in expansion of macro 'DE'
   55 |  DE(AI(ra)); DE(AI(rb));
      |  ^~
minerals.cpp:23:17: warning: statement has no effect [-Wunused-value]
   23 | #define DE(...) 0
      |                 ^
minerals.cpp:55:14: note: in expansion of macro 'DE'
   55 |  DE(AI(ra)); DE(AI(rb));
      |              ^~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:81:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |   for(int i = 0; i < as.size(); ++i)
      |                  ~~^~~~~~~~~~~
minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&, bool)':
minerals.cpp:50:9: warning: 'cs' may be used uninitialized in this function [-Wmaybe-uninitialized]
   50 |   if(cs == ls ^ in) ra.pb(i);
      |      ~~~^~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 4 ms 620 KB Output is correct
4 Correct 7 ms 1004 KB Output is correct
5 Correct 14 ms 1508 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct
19 Correct 44 ms 3428 KB Output is correct
20 Correct 44 ms 3300 KB Output is correct
21 Correct 20 ms 6228 KB Output is correct
22 Correct 36 ms 3172 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct
19 Correct 44 ms 3428 KB Output is correct
20 Correct 44 ms 3300 KB Output is correct
21 Correct 20 ms 6228 KB Output is correct
22 Correct 36 ms 3172 KB Output is correct
23 Incorrect 40 ms 3428 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct
19 Correct 44 ms 3428 KB Output is correct
20 Correct 44 ms 3300 KB Output is correct
21 Correct 20 ms 6228 KB Output is correct
22 Correct 36 ms 3172 KB Output is correct
23 Incorrect 40 ms 3428 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct
19 Correct 44 ms 3428 KB Output is correct
20 Correct 44 ms 3300 KB Output is correct
21 Correct 20 ms 6228 KB Output is correct
22 Correct 36 ms 3172 KB Output is correct
23 Incorrect 40 ms 3428 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 14 ms 1508 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 16 ms 1540 KB Output is correct
13 Correct 9 ms 2532 KB Output is correct
14 Correct 12 ms 1516 KB Output is correct
15 Correct 39 ms 3204 KB Output is correct
16 Correct 42 ms 3300 KB Output is correct
17 Correct 20 ms 5972 KB Output is correct
18 Correct 32 ms 3044 KB Output is correct
19 Correct 44 ms 3428 KB Output is correct
20 Correct 44 ms 3300 KB Output is correct
21 Correct 20 ms 6228 KB Output is correct
22 Correct 36 ms 3172 KB Output is correct
23 Incorrect 40 ms 3428 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -