답안 #466242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466242	2021-08-18T11:40:57 Z	idas	Exam (eJOI20_exam)	C++11	13 / 100	193 ms	98408 KB

exam

#include<bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define PB push_back
#define F first
#define S second

const int INF=1e9;
const long long LINF=1e18;

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef map<int, int> mii;

void setIO()
{
    FAST_IO;
}

void setIO (string s) {
    setIO();
 	freopen((s+".in").c_str(),"r",stdin);
 	freopen((s+".out").c_str(),"w",stdout);
}

const int N=5e3+10;
int n, a[N], b[N], t[2*N], dp[N][N];

void build()
{
    for(int i=n-1; i>=0; i--) t[i]=max(t[i<<1], t[i<<1|1]);
}

int get(int l, int r)
{
    int ret=0;
    for(l+=n, r+=n; l<r; l>>=1, r>>=1){
        if(l&1) ret=max(ret, t[l++]);
        if(r&1) ret=max(ret, t[--r]);
    }
    return ret;
}

int main()
{
    setIO();
    cin >> n;
    FOR(i, 0, n)
    {
        cin >> a[i+1];
        t[i+n]=a[i+1];
    }
    FOR(i, 0, n) cin >> b[i+1];
    build();

    FOR(i, 1, n+1)
    {
        FOR(j, 1, n+1)
        {
            if(a[i]==b[j]){
                int mx=get(min(i-1, j-1), max(i, j));
                if(mx==a[i]){
                    dp[i][j]=1;
                }
            }
            dp[i][j]+=max(dp[i-1][j], max(dp[i][j-1], dp[i-1][j-1]));
        }
    }

    cout << dp[n][n];
}

Compilation message

exam.cpp: In function 'void setIO(std::string)':
exam.cpp:24:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
exam.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen((s+".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Incorrect	1 ms	332 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8212 KB	Output is correct
2	Runtime error	5 ms	460 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	4 ms	3276 KB	Output is correct
3	Correct	36 ms	24000 KB	Output is correct
4	Correct	178 ms	94676 KB	Output is correct
5	Correct	193 ms	98364 KB	Output is correct
6	Correct	191 ms	98408 KB	Output is correct