oj.uz

Submission #149888

# Submission time Handle Problem Language Result Execution time Memory
149888 2019-09-01T07:20:45 Z USA1(#3634, ecnerwala, scott_wu, ksun48) Wine Tasting (FXCUP4_wine) C++17
75 / 100
 12 ms 1012 KB 
#include "taster.h"
#include "bartender.h"
#include <bits/stdc++.h>

namespace {

using namespace std;

using big = __int128_t;

const int FOUR = 5;
const int THREE = 4;

const int TWELVE = 11;

big ep(int n, vector<int> perm){
	assert((int)perm.size() == n);
	big res = 0;
	for(int i = 0; i < n; i++){
		res *= (n - i);
		res += perm[i];
		for(int j = i+1; j < n; j++){
			if(perm[j] > perm[i]) perm[j] -= 1;
		}
	}
	return res;
}

vector<int> dp(int n, big val){
	vector<int> perm(n, 0);
	for(int i = n-1; i >= 0; i--){
		int ind = val % (n - i);
		val /= (n - i);
		perm[i] = ind;
		for(int j = i + 1; j < n; j++){
			if(perm[j] >= perm[i]) perm[j] += 1;
		}
	}
	return perm;
}

vector<int> encode_permutation(vector<int> perm, int fours, int threes){
	big a = 1;
	for(int i = 1; i <= fours; i++) a *= big(i);
	big c = 1;
	for(int i = 0; i < fours; i++) c *= FOUR;
	for(int i = 0; i < threes; i++) c *= THREE;
	assert(a <= c);

	assert(dp(fours, ep(fours, perm)) == perm);
	big val = ep(fours, perm);
	vector<int> z;
	for(int i = 0; i < threes; i++){
		z.push_back(int(val % THREE)); val /= THREE;
	}
	for(int i = 0; i < fours; i++){
		z.push_back(int(val % FOUR)); val /= FOUR;
	}
	assert(val == 0);
	reverse(z.begin(), z.end());
	return z;
}


vector<int> decode_permutation(vector<int> info, int fours, int threes){
	int n = (int)info.size();
	assert(n == fours + threes);
	big r = 0;
	for(int i = 0; i < fours; i++) r = r * FOUR + info[i];
	for(int i = 0; i < threes; i++) r = r * THREE + info[fours + i];

	vector<int> perm = dp(fours, r);
	assert(ep(fours, perm) == r);
	return perm;
}

vector<int> blendwines(int k, vector<int> r){
	for(int& x : r) x -= 1;
	int n = (int)r.size();
	int num_big = min(TWELVE, n); // num_big
	int num_small = n - num_big;
	vector<int> small_perm;
	for(int a : r){
		if(a < num_small) small_perm.push_back(a);
	}
	assert((int)small_perm.size() == num_small);

	vector<int> info = encode_permutation(small_perm, num_small, num_big);
	assert(decode_permutation(info, num_small, num_big) == small_perm);

	int j = 0;
	vector<int> a(n);
	for(int i = 0; i < n; i++){
		if(r[i] < num_small){
			a[i] = THREE + 1 + info[j];
			j += 1;
		}
	}
	for(int i = 0; i < n; i++){
		if(r[i] >= num_small){
			a[i] = 1 + info[j];
			j += 1;
		}
	}
	return a;
}

vector<int> merge_sort(vector<int> x){
	if(x.size() <= 1) return x;
	vector<int> a, b;
	int n = (int)x.size();
	for(int i = 0; i < n/2; i++) a.push_back(x[i]);
	for(int i = n/2; i < n; i++) b.push_back(x[i]);
	a = merge_sort(a);
	b = merge_sort(b);
	int i = 0;
	int j = 0;
	vector<int> res;
	while(i < (int)a.size() && j < (int)b.size()){
		if(Compare(a[i], b[j]) == -1){
			res.push_back(a[i]);
			i += 1;
		} else {
			res.push_back(b[j]);
			j += 1;
		}
	}
	for(int k = i; k < (int)a.size(); k++) res.push_back(a[k]);
	for(int k = j; k < (int)b.size(); k++) res.push_back(b[k]);
	return res;
}

vector<int> sortwines(int k, vector<int> a) {
	int n = (int)a.size();
	int num_big = min(TWELVE, n); // num_big
	int num_small = n - num_big;
	vector<int> info;
	for(int i = 0; i < n; i++) if(a[i] > THREE) info.push_back(a[i] - THREE - 1);
	assert((int)info.size() == num_small);
	for(int i = 0; i < n; i++) if(a[i] <= THREE) info.push_back(a[i] - 1);
	assert((int)info.size() == n);

	vector<int> perm = decode_permutation(info, num_small, num_big);
	assert(encode_permutation(perm, num_small, num_big) == info);
	int j = 0;
	vector<int> r(n, -1);

	vector<int> unknowns;
	for(int i = 0; i < n; i++){
		if(a[i] > THREE){
			r[i] = perm[j];
			j += 1;
		} else {
			unknowns.push_back(i);
		}
	}
	assert((int)unknowns.size() == num_big);
	mt19937 mt(48);
	shuffle(unknowns.begin(), unknowns.end(), mt);
	unknowns = merge_sort(unknowns);
	for(int i = 0; i < (int)unknowns.size(); i++){
		r[unknowns[i]] = i + num_small;
	}
	for(int& x : r) x += 1;
	return r;
}
}

vector<int> BlendWines(int k, vector<int> r){
	return blendwines(k, r);
}

#include "taster.h"
#include "bartender.h"
#include <bits/stdc++.h>

namespace {

using namespace std;

using big = __int128_t;

const int FOUR = 5;
const int THREE = 4;

const int TWELVE = 11;

big ep(int n, vector<int> perm){
	assert((int)perm.size() == n);
	big res = 0;
	for(int i = 0; i < n; i++){
		res *= (n - i);
		res += perm[i];
		for(int j = i+1; j < n; j++){
			if(perm[j] > perm[i]) perm[j] -= 1;
		}
	}
	return res;
}

vector<int> dp(int n, big val){
	vector<int> perm(n, 0);
	for(int i = n-1; i >= 0; i--){
		int ind = val % (n - i);
		val /= (n - i);
		perm[i] = ind;
		for(int j = i + 1; j < n; j++){
			if(perm[j] >= perm[i]) perm[j] += 1;
		}
	}
	return perm;
}

vector<int> encode_permutation(vector<int> perm, int fours, int threes){
	big a = 1;
	for(int i = 1; i <= fours; i++) a *= big(i);
	big c = 1;
	for(int i = 0; i < fours; i++) c *= FOUR;
	for(int i = 0; i < threes; i++) c *= THREE;
	assert(a <= c);

	assert(dp(fours, ep(fours, perm)) == perm);
	big val = ep(fours, perm);
	vector<int> z;
	for(int i = 0; i < threes; i++){
		z.push_back(int(val % THREE)); val /= THREE;
	}
	for(int i = 0; i < fours; i++){
		z.push_back(int(val % FOUR)); val /= FOUR;
	}
	assert(val == 0);
	reverse(z.begin(), z.end());
	return z;
}


vector<int> decode_permutation(vector<int> info, int fours, int threes){
	int n = (int)info.size();
	assert(n == fours + threes);
	big r = 0;
	for(int i = 0; i < fours; i++) r = r * FOUR + info[i];
	for(int i = 0; i < threes; i++) r = r * THREE + info[fours + i];

	vector<int> perm = dp(fours, r);
	assert(ep(fours, perm) == r);
	return perm;
}

vector<int> blendwines(int k, vector<int> r){
	for(int& x : r) x -= 1;
	int n = (int)r.size();
	int num_big = min(TWELVE, n); // num_big
	int num_small = n - num_big;
	vector<int> small_perm;
	for(int a : r){
		if(a < num_small) small_perm.push_back(a);
	}
	assert((int)small_perm.size() == num_small);

	vector<int> info = encode_permutation(small_perm, num_small, num_big);
	assert(decode_permutation(info, num_small, num_big) == small_perm);

	int j = 0;
	vector<int> a(n);
	for(int i = 0; i < n; i++){
		if(r[i] < num_small){
			a[i] = THREE + 1 + info[j];
			j += 1;
		}
	}
	for(int i = 0; i < n; i++){
		if(r[i] >= num_small){
			a[i] = 1 + info[j];
			j += 1;
		}
	}
	return a;
}

vector<int> merge_sort(vector<int> x){
	if(x.size() <= 1) return x;
	vector<int> a, b;
	int n = (int)x.size();
	for(int i = 0; i < n/2; i++) a.push_back(x[i]);
	for(int i = n/2; i < n; i++) b.push_back(x[i]);
	a = merge_sort(a);
	b = merge_sort(b);
	int i = 0;
	int j = 0;
	vector<int> res;
	while(i < (int)a.size() && j < (int)b.size()){
		if(Compare(a[i], b[j]) == -1){
			res.push_back(a[i]);
			i += 1;
		} else {
			res.push_back(b[j]);
			j += 1;
		}
	}
	for(int k = i; k < (int)a.size(); k++) res.push_back(a[k]);
	for(int k = j; k < (int)b.size(); k++) res.push_back(b[k]);
	return res;
}

vector<int> sortwines(int k, vector<int> a) {
	int n = (int)a.size();
	int num_big = min(TWELVE, n); // num_big
	int num_small = n - num_big;
	vector<int> info;
	for(int i = 0; i < n; i++) if(a[i] > THREE) info.push_back(a[i] - THREE - 1);
	assert((int)info.size() == num_small);
	for(int i = 0; i < n; i++) if(a[i] <= THREE) info.push_back(a[i] - 1);
	assert((int)info.size() == n);

	vector<int> perm = decode_permutation(info, num_small, num_big);
	assert(encode_permutation(perm, num_small, num_big) == info);
	int j = 0;
	vector<int> r(n, -1);

	vector<int> unknowns;
	for(int i = 0; i < n; i++){
		if(a[i] > THREE){
			r[i] = perm[j];
			j += 1;
		} else {
			unknowns.push_back(i);
		}
	}
	assert((int)unknowns.size() == num_big);
	mt19937 mt(48);
	shuffle(unknowns.begin(), unknowns.end(), mt);
	unknowns = merge_sort(unknowns);
	for(int i = 0; i < (int)unknowns.size(); i++){
		r[unknowns[i]] = i + num_small;
	}
	for(int& x : r) x += 1;
	return r;
}
}

vector<int> SortWines(int k, vector<int> r){
	return sortwines(k, r);
}

Compilation message

bartender.cpp:133:13: warning: 'std::vector<int> {anonymous}::sortwines(int, std::vector<int>)' defined but not used [-Wunused-function]
 vector<int> sortwines(int k, vector<int> a) {
             ^~~~~~~~~

taster.cpp:77:13: warning: 'std::vector<int> {anonymous}::blendwines(int, std::vector<int>)' defined but not used [-Wunused-function]
 vector<int> blendwines(int k, vector<int> r){
             ^~~~~~~~~~

Subtask #1
75.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 780 KB Correct
2 Correct 8 ms 780 KB Correct
3 Correct 9 ms 908 KB Correct
4 Correct 10 ms 908 KB Correct
5 Correct 9 ms 772 KB Correct
6 Correct 10 ms 772 KB Correct
7 Correct 9 ms 772 KB Correct
8 Correct 9 ms 644 KB Correct
9 Correct 9 ms 908 KB Correct
10 Correct 8 ms 772 KB Correct
11 Correct 10 ms 772 KB Correct
12 Correct 9 ms 772 KB Correct
13 Correct 8 ms 644 KB Correct
14 Correct 10 ms 772 KB Correct
15 Correct 9 ms 644 KB Correct
16 Correct 9 ms 908 KB Correct
17 Correct 10 ms 908 KB Correct
18 Correct 10 ms 908 KB Correct
19 Correct 10 ms 772 KB Correct
20 Correct 9 ms 908 KB Correct
21 Correct 9 ms 772 KB Correct
22 Correct 10 ms 772 KB Correct
23 Correct 10 ms 884 KB Correct
24 Correct 9 ms 772 KB Correct
25 Correct 9 ms 908 KB Correct
26 Correct 9 ms 772 KB Correct
27 Correct 10 ms 772 KB Correct
28 Correct 9 ms 908 KB Correct
29 Correct 9 ms 772 KB Correct
30 Correct 10 ms 772 KB Correct
31 Correct 10 ms 780 KB Correct
32 Correct 10 ms 772 KB Correct
33 Correct 10 ms 772 KB Correct
34 Correct 9 ms 908 KB Correct
35 Correct 10 ms 772 KB Correct
36 Correct 10 ms 908 KB Correct
37 Correct 9 ms 908 KB Correct
38 Correct 10 ms 908 KB Correct
39 Correct 10 ms 772 KB Correct
40 Correct 9 ms 772 KB Correct
41 Correct 9 ms 908 KB Correct
42 Correct 9 ms 908 KB Correct
43 Correct 9 ms 772 KB Correct
44 Correct 9 ms 772 KB Correct
45 Correct 10 ms 928 KB Correct
46 Correct 9 ms 780 KB Correct
47 Correct 10 ms 772 KB Correct
48 Correct 10 ms 908 KB Correct
49 Correct 10 ms 772 KB Correct
50 Correct 9 ms 780 KB Correct
51 Correct 10 ms 772 KB Correct
52 Correct 9 ms 644 KB Correct
53 Correct 10 ms 644 KB Correct
54 Correct 10 ms 908 KB Correct
55 Correct 10 ms 644 KB Correct
56 Correct 8 ms 772 KB Correct
57 Correct 10 ms 772 KB Correct
58 Correct 9 ms 780 KB Correct
59 Correct 9 ms 780 KB Correct
60 Correct 10 ms 772 KB Correct
61 Correct 10 ms 780 KB Correct
62 Correct 10 ms 772 KB Correct
63 Correct 10 ms 908 KB Correct
64 Correct 8 ms 644 KB Correct
65 Correct 10 ms 772 KB Correct
66 Correct 10 ms 908 KB Correct
67 Correct 9 ms 772 KB Correct
68 Correct 9 ms 644 KB Correct
69 Correct 10 ms 772 KB Correct
70 Correct 9 ms 772 KB Correct
71 Correct 9 ms 908 KB Correct
72 Correct 8 ms 644 KB Correct
73 Correct 10 ms 844 KB Correct
74 Correct 9 ms 772 KB Correct
75 Correct 10 ms 772 KB Correct
76 Correct 9 ms 780 KB Correct
77 Correct 9 ms 844 KB Correct
78 Correct 10 ms 772 KB Correct
79 Correct 10 ms 772 KB Correct
80 Correct 9 ms 1012 KB Correct
81 Correct 9 ms 780 KB Correct
82 Correct 8 ms 644 KB Correct
83 Correct 10 ms 908 KB Correct
84 Correct 9 ms 656 KB Correct
85 Correct 9 ms 772 KB Correct
86 Correct 10 ms 908 KB Correct
87 Correct 10 ms 1008 KB Correct
88 Correct 11 ms 884 KB Correct
89 Correct 10 ms 772 KB Correct
90 Correct 12 ms 784 KB Correct
91 Correct 9 ms 788 KB Correct
92 Correct 10 ms 880 KB Correct
93 Partially correct 10 ms 908 KB Wrong
94 Partially correct 9 ms 776 KB Wrong
95 Partially correct 10 ms 784 KB Wrong
96 Partially correct 10 ms 880 KB Wrong
97 Partially correct 10 ms 888 KB Wrong
98 Partially correct 9 ms 788 KB Wrong
99 Partially correct 9 ms 740 KB Wrong
100 Partially correct 9 ms 772 KB Wrong
101 Partially correct 12 ms 784 KB Wrong
102 Correct 12 ms 644 KB Correct
103 Correct 10 ms 780 KB Correct
104 Correct 10 ms 908 KB Correct
105 Correct 10 ms 788 KB Correct
106 Correct 9 ms 880 KB Correct
107 Partially correct 10 ms 772 KB Wrong
108 Partially correct 10 ms 772 KB Wrong
109 Partially correct 10 ms 644 KB Wrong
110 Partially correct 10 ms 780 KB Wrong
111 Partially correct 10 ms 908 KB Wrong
112 Partially correct 8 ms 772 KB Wrong
113 Partially correct 10 ms 644 KB Wrong
114 Partially correct 10 ms 1012 KB Wrong
115 Partially correct 11 ms 908 KB Wrong
116 Partially correct 11 ms 772 KB Wrong
117 Correct 10 ms 964 KB Correct
118 Partially correct 11 ms 784 KB Wrong
119 Partially correct 10 ms 644 KB Wrong
120 Partially correct 11 ms 784 KB Wrong