제출 #85691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85691		farukkastamonuda	Longest beautiful sequence (IZhO17_subsequence)	C++14	100 / 100	4638 ms	132692 KiB

subsequence

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};
 
template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
 
template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}
 
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
 
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;
 
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
 
int N;
int arr[MAXN];
int want[MAXN];
int popcount[1025];
pii dp[MAXN];
pii best[1025][1025][11];
vector<int> ans;
 
int32_t main()
{
	// ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
        for (int i = 0; i <= (1 << 10); i++)
        {
                popcount[i] = __builtin_popcount(i);
        }
        readi(N);
        for (int i = 0; i < N; i++)
        {
                readi(arr[i]);
        }
        for (int i = 0; i < N; i++)
        {
                readi(want[i]);
        }
        for (int i = 0; i < N; i++)
        {
                pii lmao = {1, -1};
                for (int j = 0; j < 1024; j++)
                {
                        int leaves = want[i] - (popcount[j & (arr[i] >> 10)]);
                        if (leaves < 0 || leaves > 10) continue;
                        ckmax(lmao, best[j][arr[i] & 1023][leaves]);
                }
                dp[i] = lmao;
                pii cur = MP(dp[i].fi + 1, i);
                for (int j = 0; j < 1024; j++)
                {
                        ckmax(best[(arr[i] >> 10)][j][popcount[j & arr[i]]], cur);
                }
        }
        int u = N - 1;
        for (int i = 0; i < N; i++)
        {
                if (dp[i] > dp[u])
                {
                        u = i;
                }
        }
        while(u != -1)
        {
                ans.PB(u);
                u = dp[u].se;
        }
        reverse(ans.begin(), ans.end());
        printi(ans.size()); putchar('\n');
        printi(ans[0] + 1);
        for (int i = 1; i < ans.size(); i++)
        {
                putchar(' '); printi(ans[i] + 1);
        }
        putchar('\n');
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

subsequence.cpp: In function 'int32_t main()':
subsequence.cpp:202:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 1; i < ans.size(); i++)
                         ~~^~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 16 / 16
• Subtask 3: 17 / 17
• Subtask 4: 60 / 60