oj.uz

Submission #27050

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

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

vector<int> mrg(int r, const vector<int> &a, const vector<int> &b){
	vector<int> ret;
	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];
	int t[3] = {r, a[2 * x], a[2 * x + 1]};
	sort(t, t + 3);
	if(t[0] != a[2 * x + 1]){
		mp[x][r] = mrg(t[0], f(2 * x, r + a[2 * x] - t[0]), f(2 * x + 1, a[2 * x + 1]));
	}
	else{
		mp[x][r] = min(mrg(t[0], f(2 * x, r), f(2 * x + 1, a[2 * x])),
				  	   mrg(t[0], f(2 * x, a[2 * x]), f(2 * x + 1, r)));
	}
	return mp[x][r];
}

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, const std::vector<int>&, const 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:35:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
swap.cpp:36: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 15340 KB Output is correct
2 Correct 3 ms 15340 KB Output is correct
3 Correct 0 ms 15340 KB Output is correct
4 Correct 0 ms 15340 KB Output is correct
5 Correct 0 ms 15340 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15340 KB Output is correct
2 Correct 3 ms 15340 KB Output is correct
3 Correct 0 ms 15340 KB Output is correct
4 Correct 0 ms 15340 KB Output is correct
5 Correct 0 ms 15340 KB Output is correct
6 Correct 6 ms 15340 KB Output is correct
7 Correct 3 ms 15340 KB Output is correct
8 Correct 3 ms 15340 KB Output is correct
9 Correct 6 ms 15340 KB Output is correct
10 Correct 3 ms 15340 KB Output is correct
11 Correct 3 ms 15472 KB Output is correct
12 Correct 6 ms 15604 KB Output is correct
13 Correct 9 ms 15472 KB Output is correct
14 Correct 6 ms 15864 KB Output is correct
15 Correct 6 ms 15868 KB Output is correct
16 Correct 116 ms 30860 KB Output is correct
17 Correct 99 ms 30048 KB Output is correct
18 Correct 103 ms 30768 KB Output is correct
19 Correct 779 ms 89600 KB Output is correct
20 Correct 856 ms 88780 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15340 KB Output is correct
2 Correct 3 ms 15340 KB Output is correct
3 Correct 0 ms 15340 KB Output is correct
4 Correct 0 ms 15340 KB Output is correct
5 Correct 0 ms 15340 KB Output is correct
6 Correct 6 ms 15340 KB Output is correct
7 Correct 3 ms 15340 KB Output is correct
8 Correct 3 ms 15340 KB Output is correct
9 Correct 6 ms 15340 KB Output is correct
10 Correct 3 ms 15340 KB Output is correct
11 Correct 3 ms 15472 KB Output is correct
12 Correct 6 ms 15604 KB Output is correct
13 Correct 9 ms 15472 KB Output is correct
14 Correct 6 ms 15864 KB Output is correct
15 Correct 6 ms 15868 KB Output is correct
16 Correct 116 ms 30860 KB Output is correct
17 Correct 99 ms 30048 KB Output is correct
18 Correct 103 ms 30768 KB Output is correct
19 Correct 779 ms 89600 KB Output is correct
20 Correct 856 ms 88780 KB Output is correct
21 Correct 463 ms 82908 KB Output is correct
22 Correct 489 ms 83372 KB Output is correct
23 Correct 503 ms 83140 KB Output is correct
24 Execution timed out 1000 ms 251312 KB Execution timed out
25 Halted 0 ms 0 KB -