제출 #94417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94417		Kastanda	Longest beautiful sequence (IZhO17_subsequence)	C++11	23 / 100	6052 ms	1816 KiB

subsequence

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = 100005;
int n, ts, A[N], K[N], dp[N], P[N], R[N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &A[i]);
    for (int i = 1; i <= n; i++)
        scanf("%d", &K[i]);

    int nw = 0;
    for (int i = 1; i <= n; i++)
    {
        int k = K[i];
        int &Mx = dp[i], &a = A[i], &p = P[i];
        for (int j = i - 1; j; j--)
            if (__builtin_popcount(a & A[j]) == k && Mx < dp[j])
                {Mx = dp[j]; p = j;}
        dp[i] ++;
        if (dp[i] > dp[nw])
            nw = i;
    }
    while (nw)
    {
        R[ts ++] = nw;
        nw = P[nw];
    }
    printf("%d\n", ts);
    for (int i = ts - 1; ~i; i--)
        printf("%d ", R[i]);
    return 0;
}

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

subsequence.cpp: In function 'int main()':
subsequence.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
subsequence.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]);
         ~~~~~^~~~~~~~~~~~~
subsequence.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &K[i]);
         ~~~~~^~~~~~~~~~~~~

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