oj.uz

답안 #150903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150903 2019-09-01T10:23:57 Z fjzzq2002 포도주 시음 (FXCUP4_wine) C++17
100 / 100
 11 ms 1080 KB 
#include "bartender.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
std::vector<int> BlendWines(int K, std::vector<int> a){
	int N = a.size();
	int G=min(N,12);
	vector<int> s;
	for(int i=0;i<N;++i)
		if(a[i]>G)
			s.pb(a[i]-G);
	__int128 p=0;
	//encode this shit
	for(int j=0;j<s.size();++j)
	{
		int w=0;
		for(int k=0;k<j;++k)
			w+=s[k]<s[j];
		p=p*(j+1)+w;
	}
	vector<int> o(N);
	for(int i=0;i<N;++i)
	{
		int u=2;
		if(a[i]>G) u=5;
		int x=p%u; p/=u;
		if(a[i]>G)
			o[i]=x+3;
		else o[i]=x+1;
	}
	assert(p==0);
	return o;
}
#include "taster.h"
#include <bits/stdc++.h>
using namespace std;


typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
map<pii,int> sb;
int query(int p,int q)
{
	if(p>q) return !query(q,p);
	if(sb.count(pii(p,q)))
		return sb[pii(p,q)];
	return sb[pii(p,q)]=(Compare(p,q)==-1);
}

void sort(std::vector<int> &v) {
    if (v.size() == 1)
        return;
    std::vector<int> t;
    std::map<int, int> m;
    for (size_t i = 1; i < v.size(); i += 2) {
        if (!query(v[i - 1], v[i]))
            std::swap(v[i - 1], v[i]);
        t.push_back(v[i]), m[v[i]] = v[i - 1];
    }
    sort(t);
    int ex = v.size() & 1 ? v.back() : -1;
    v = t;
    v.insert(v.begin(), m[t[0]]);
    for (size_t p = 4, l = 1, r = 3; l < t.size(); p <<= 1, l = r, r = p - r)
        for (size_t i = std::min(r, t.size()) - 1, j = std::min(p, v.size()) - 1; i >= l; --i) {
            while (v[j] != t[i]) --j;
            v.insert(std::lower_bound(v.begin(), v.begin() + j, m[t[i]], query), m[t[i]]);
        }
    if (ex != -1)
        v.insert(std::lower_bound(v.begin(), v.end(), ex, query), ex);
}

//optimal sort end


#define pb push_back
#define SZ 666666
bool big[SZ];
int g[SZ],c[SZ];
std::vector<int> SortWines(int K, std::vector<int> o) {
	srand(123111111+__TIME__[7]*10000+__TIME__[6]*100
	+__TIME__[5]*11231+__TIME__[4]*1231+__TIME__[3]*123132
	+__TIME__[2]*12111+__TIME__[1]*11111+time(0));
	int N = o.size();
	vector<int> a(N);
	int G=min(N,12);
	__int128 p=0;
	for(int i=N-1;i>=0;--i)
	{
		int u,x;
		if(o[i]>=3)
			big[i]=1,u=5,x=o[i]-3;
		else u=2,x=o[i]-1;
		p=p*u+x;
	}
	#ifdef LOCAL
	cerr<<(long long)p<<"\n";
	#endif
	for(int i=N-G-1;i>=0;--i)
	{
		g[i]=p%(i+1); p/=i+1;
	}
	for(int i=0;i<=N-G-1;++i)
	{
		c[i]=g[i];
		for(int j=0;j<i;++j)
			if(c[j]>=g[i]) ++c[j];
	}
	int oo=0;
	for(int i=0;i<N;++i)
		if(big[i]) a[i]=c[oo++]+G+1;
	vector<int> S;
	for(int i=0;i<N;++i)
		if(!big[i]) S.pb(i);
	random_shuffle(S.begin(),S.end());
	sort(S);
	for(int i=0;i<S.size();++i)
		a[S[i]]=i+1;
	#ifdef LOCAL
	for(auto t:o)
		cout<<t<<",";
	cout<<"\n";
	for(auto t:a)
		cout<<t<<",";
	cout<<"\n";
	#endif
	return a;
}

Compilation message

bartender.cpp: In function 'std::vector<int> BlendWines(int, std::vector<int>)':
bartender.cpp:14:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<s.size();++j)
              ~^~~~~~~~~

taster.cpp: In function 'std::vector<int> SortWines(int, std::vector<int>)':
taster.cpp:87:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<S.size();++i)
              ~^~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1016 KB Correct
2 Correct 8 ms 772 KB Correct
3 Correct 10 ms 772 KB Correct
4 Correct 10 ms 780 KB Correct
5 Correct 10 ms 772 KB Correct
6 Correct 10 ms 644 KB Correct
7 Correct 10 ms 644 KB Correct
8 Correct 9 ms 772 KB Correct
9 Correct 10 ms 880 KB Correct
10 Correct 10 ms 772 KB Correct
11 Correct 10 ms 908 KB Correct
12 Correct 10 ms 772 KB Correct
13 Correct 10 ms 908 KB Correct
14 Correct 10 ms 908 KB Correct
15 Correct 9 ms 780 KB Correct
16 Correct 8 ms 644 KB Correct
17 Correct 8 ms 772 KB Correct
18 Correct 9 ms 776 KB Correct
19 Correct 10 ms 732 KB Correct
20 Correct 10 ms 884 KB Correct
21 Correct 10 ms 908 KB Correct
22 Correct 10 ms 908 KB Correct
23 Correct 10 ms 772 KB Correct
24 Correct 10 ms 804 KB Correct
25 Correct 10 ms 772 KB Correct
26 Correct 9 ms 908 KB Correct
27 Correct 10 ms 784 KB Correct
28 Correct 9 ms 772 KB Correct
29 Correct 10 ms 772 KB Correct
30 Correct 10 ms 908 KB Correct
31 Correct 10 ms 908 KB Correct
32 Correct 10 ms 780 KB Correct
33 Correct 10 ms 908 KB Correct
34 Correct 9 ms 772 KB Correct
35 Correct 10 ms 772 KB Correct
36 Correct 10 ms 772 KB Correct
37 Correct 9 ms 908 KB Correct
38 Correct 9 ms 644 KB Correct
39 Correct 10 ms 772 KB Correct
40 Correct 9 ms 644 KB Correct
41 Correct 9 ms 908 KB Correct
42 Correct 9 ms 772 KB Correct
43 Correct 8 ms 644 KB Correct
44 Correct 9 ms 772 KB Correct
45 Correct 10 ms 772 KB Correct
46 Correct 10 ms 772 KB Correct
47 Correct 8 ms 772 KB Correct
48 Correct 10 ms 644 KB Correct
49 Correct 9 ms 644 KB Correct
50 Correct 9 ms 772 KB Correct
51 Correct 10 ms 644 KB Correct
52 Correct 10 ms 908 KB Correct
53 Correct 10 ms 772 KB Correct
54 Correct 10 ms 908 KB Correct
55 Correct 9 ms 908 KB Correct
56 Correct 9 ms 644 KB Correct
57 Correct 9 ms 644 KB Correct
58 Correct 9 ms 772 KB Correct
59 Correct 10 ms 900 KB Correct
60 Correct 9 ms 772 KB Correct
61 Correct 9 ms 644 KB Correct
62 Correct 10 ms 976 KB Correct
63 Correct 9 ms 644 KB Correct
64 Correct 10 ms 772 KB Correct
65 Correct 9 ms 788 KB Correct
66 Correct 9 ms 644 KB Correct
67 Correct 9 ms 772 KB Correct
68 Correct 9 ms 772 KB Correct
69 Correct 9 ms 772 KB Correct
70 Correct 10 ms 1080 KB Correct
71 Correct 10 ms 772 KB Correct
72 Correct 9 ms 772 KB Correct
73 Correct 10 ms 884 KB Correct
74 Correct 9 ms 868 KB Correct
75 Correct 10 ms 908 KB Correct
76 Correct 9 ms 908 KB Correct
77 Correct 10 ms 908 KB Correct
78 Correct 9 ms 1036 KB Correct
79 Correct 9 ms 772 KB Correct
80 Correct 10 ms 772 KB Correct
81 Correct 10 ms 772 KB Correct
82 Correct 9 ms 772 KB Correct
83 Correct 10 ms 800 KB Correct
84 Correct 10 ms 772 KB Correct
85 Correct 9 ms 908 KB Correct
86 Correct 9 ms 772 KB Correct
87 Correct 9 ms 908 KB Correct
88 Correct 9 ms 772 KB Correct
89 Correct 10 ms 908 KB Correct
90 Correct 9 ms 772 KB Correct
91 Correct 10 ms 644 KB Correct
92 Correct 8 ms 644 KB Correct
93 Correct 10 ms 772 KB Correct
94 Correct 10 ms 644 KB Correct
95 Correct 9 ms 884 KB Correct
96 Correct 10 ms 908 KB Correct
97 Correct 10 ms 908 KB Correct
98 Correct 10 ms 772 KB Correct
99 Correct 10 ms 772 KB Correct
100 Correct 11 ms 884 KB Correct
101 Correct 10 ms 772 KB Correct
102 Correct 10 ms 772 KB Correct
103 Correct 10 ms 772 KB Correct
104 Correct 9 ms 908 KB Correct
105 Correct 9 ms 772 KB Correct
106 Correct 9 ms 772 KB Correct
107 Correct 9 ms 772 KB Correct
108 Correct 10 ms 880 KB Correct
109 Correct 10 ms 876 KB Correct
110 Correct 10 ms 780 KB Correct
111 Correct 10 ms 772 KB Correct
112 Correct 10 ms 788 KB Correct
113 Correct 9 ms 956 KB Correct
114 Correct 10 ms 908 KB Correct
115 Correct 10 ms 880 KB Correct
116 Correct 10 ms 864 KB Correct
117 Correct 11 ms 908 KB Correct
118 Correct 10 ms 932 KB Correct
119 Correct 9 ms 644 KB Correct
120 Correct 9 ms 644 KB Correct