oj.uz

답안 #646909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646909 2022-10-01T01:47:54 Z LeonaRaging Exam (eJOI20_exam) C++14
77 / 100
 193 ms 98660 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 1e5 + 4;
const int INF = 1e9;
const int N = 5005;

int n, a[maxn], b[maxn], L[maxn], R[maxn], dp[N][N];
set<int> mySet;

void Sub2() {
    int res = 0, pre = 0;
    for (int i = 1; i <= n; i++)
        if (a[i] == b[i]) {
            res += R[i] - max(pre, L[i]) - 1;
            pre = R[i];
            i = R[i] - 1;
        }
    cout << res;
}

void Sub4() {

}

void Sub6() {
    int res = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            if (a[i] == b[j]) {
                if (L[i] < j && j < R[i])
                    dp[i][j] = dp[i][j - 1] + 1;
            }
            dp[i][j] = max({dp[i][j], dp[i][j - 1], dp[i - 1][j]});
            res = max(res, dp[i][j]);
        }
    cout << res << '\n';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        mySet.insert(b[i]);
    }
    stack<int> st;
    st.push(0);
    a[0] = a[n + 1] = INF + 1;
    for (int i = 1; i <= n; i++) {
        while (a[st.top()] <= a[i])
            st.pop();
        L[i] = st.top();
        st.push(i);
    }
    stack<int>().swap(st);
    st.push(n + 1);
    for (int i = n; i >= 1; i--) {
        while (a[st.top()] <= a[i])
            st.pop();
        R[i] = st.top();
        st.push(i);
    }
    if (mySet.size() == 1) Sub2();
    else if (n > 5000) Sub4();
    else { 
        Sub6();
    }
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 13 ms 2016 KB Output is correct
4 Correct 10 ms 1868 KB Output is correct
5 Correct 24 ms 1876 KB Output is correct
6 Correct 14 ms 1996 KB Output is correct
7 Correct 13 ms 1796 KB Output is correct
8 Correct 22 ms 1800 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 3288 KB Output is correct
3 Correct 32 ms 24132 KB Output is correct
4 Correct 151 ms 94568 KB Output is correct
5 Correct 158 ms 98596 KB Output is correct
6 Correct 193 ms 98632 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 3288 KB Output is correct
9 Correct 32 ms 24132 KB Output is correct
10 Correct 151 ms 94568 KB Output is correct
11 Correct 158 ms 98596 KB Output is correct
12 Correct 193 ms 98632 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 1228 KB Output is correct
22 Correct 10 ms 8344 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 166 ms 98368 KB Output is correct
25 Correct 157 ms 98392 KB Output is correct
26 Correct 160 ms 98364 KB Output is correct
27 Correct 158 ms 98352 KB Output is correct
28 Correct 159 ms 98660 KB Output is correct
29 Correct 165 ms 98508 KB Output is correct
30 Correct 173 ms 98552 KB Output is correct
31 Correct 158 ms 98468 KB Output is correct
32 Correct 159 ms 98492 KB Output is correct