oj.uz

Submission #27037

# Submission time Handle Problem Language Result Execution time Memory
27037 2017-07-09T06:01:54 Z 김동현(#1117) Swap (BOI16_swap) C++14
48 / 100
 1000 ms 89380 KB 
#include <bits/stdc++.h>
using namespace std;

int n, sz, a[262144];
map<int, vector<int> > mp[262144];

vector<int> mrg(int r, vector<int> a, vector<int> b){
	vector<int> ret;
	if(r) ret.push_back(r);
	for(int i = 0, j = 1; i < a.size(); i += j, j *= 2){
		for(int k = 0; k < j; k++) ret.push_back(a[i + k]);
		for(int k = 0; k < j; k++) ret.push_back(b[i + k]);
	}
	return ret;
}

vector<int> f(int x, int r){
	if(x > sz / 2){
		vector<int> ret; ret.push_back(r); return ret;
	}
	if(mp[x].find(r) != mp[x].end()) return mp[x][r];
	vector<int> ret;
	int t[3] = {r, a[2 * x], a[2 * x + 1]};
	sort(t, t + 3);
	if(t[0] != a[2 * x + 1]){
		vector<int> lv = f(2 * x, r + a[2 * x] - t[0]);
		vector<int> rv = f(2 * x + 1, a[2 * x + 1]);
		ret = mrg(t[0], lv, rv);
	}
	else{
		vector<int> alv = f(2 * x, r), arv = f(2 * x + 1, a[2 * x]);
		vector<int> blv = f(2 * x, a[2 * x]), brv = f(2 * x + 1, r);
		if(mrg(0, alv, arv) < mrg(0, blv, brv))
			ret = mrg(a[2 * x + 1], alv, arv);
		else ret = mrg(a[2 * x + 1], blv, brv);
	}
	mp[x][r] = ret;
	return ret;
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", a + i);
	for(sz = 1; sz < n; sz = 2 * sz + 1);
	for(int i = n + 1; i <= sz; i++) a[i] = i;
	vector<int> ans = f(1, a[1]);
	for(int i = 0; i < n; i++) printf("%d ", ans[i]);
	puts("");
}

Compilation message

swap.cpp: In function 'std::vector<int> mrg(int, std::vector<int>, std::vector<int>)':
swap.cpp:10:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0, j = 1; i < a.size(); i += j, j *= 2){
                          ^
swap.cpp: In function 'int main()':
swap.cpp:42:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
swap.cpp:43:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= n; i++) scanf("%d", a + i);
                                                ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15344 KB Output is correct
2 Correct 0 ms 15344 KB Output is correct
3 Correct 0 ms 15344 KB Output is correct
4 Correct 3 ms 15344 KB Output is correct
5 Correct 3 ms 15344 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15344 KB Output is correct
2 Correct 0 ms 15344 KB Output is correct
3 Correct 0 ms 15344 KB Output is correct
4 Correct 3 ms 15344 KB Output is correct
5 Correct 3 ms 15344 KB Output is correct
6 Correct 3 ms 15344 KB Output is correct
7 Correct 0 ms 15344 KB Output is correct
8 Correct 6 ms 15344 KB Output is correct
9 Correct 0 ms 15344 KB Output is correct
10 Correct 3 ms 15344 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15344 KB Output is correct
2 Correct 0 ms 15344 KB Output is correct
3 Correct 0 ms 15344 KB Output is correct
4 Correct 3 ms 15344 KB Output is correct
5 Correct 3 ms 15344 KB Output is correct
6 Correct 3 ms 15344 KB Output is correct
7 Correct 0 ms 15344 KB Output is correct
8 Correct 6 ms 15344 KB Output is correct
9 Correct 0 ms 15344 KB Output is correct
10 Correct 3 ms 15344 KB Output is correct
11 Correct 3 ms 15476 KB Output is correct
12 Correct 3 ms 15608 KB Output is correct
13 Correct 3 ms 15476 KB Output is correct
14 Correct 13 ms 15868 KB Output is correct
15 Correct 6 ms 15868 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15344 KB Output is correct
2 Correct 0 ms 15344 KB Output is correct
3 Correct 0 ms 15344 KB Output is correct
4 Correct 3 ms 15344 KB Output is correct
5 Correct 3 ms 15344 KB Output is correct
6 Correct 3 ms 15344 KB Output is correct
7 Correct 0 ms 15344 KB Output is correct
8 Correct 6 ms 15344 KB Output is correct
9 Correct 0 ms 15344 KB Output is correct
10 Correct 3 ms 15344 KB Output is correct
11 Correct 3 ms 15476 KB Output is correct
12 Correct 3 ms 15608 KB Output is correct
13 Correct 3 ms 15476 KB Output is correct
14 Correct 13 ms 15868 KB Output is correct
15 Correct 6 ms 15868 KB Output is correct
16 Correct 149 ms 31148 KB Output is correct
17 Correct 129 ms 30156 KB Output is correct
18 Correct 129 ms 30704 KB Output is correct
19 Execution timed out 1000 ms 89380 KB Execution timed out
20 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15344 KB Output is correct
2 Correct 0 ms 15344 KB Output is correct
3 Correct 0 ms 15344 KB Output is correct
4 Correct 3 ms 15344 KB Output is correct
5 Correct 3 ms 15344 KB Output is correct
6 Correct 3 ms 15344 KB Output is correct
7 Correct 0 ms 15344 KB Output is correct
8 Correct 6 ms 15344 KB Output is correct
9 Correct 0 ms 15344 KB Output is correct
10 Correct 3 ms 15344 KB Output is correct
11 Correct 3 ms 15476 KB Output is correct
12 Correct 3 ms 15608 KB Output is correct
13 Correct 3 ms 15476 KB Output is correct
14 Correct 13 ms 15868 KB Output is correct
15 Correct 6 ms 15868 KB Output is correct
16 Correct 149 ms 31148 KB Output is correct
17 Correct 129 ms 30156 KB Output is correct
18 Correct 129 ms 30704 KB Output is correct
19 Execution timed out 1000 ms 89380 KB Execution timed out
20 Halted 0 ms 0 KB -