oj.uz

답안 #1104231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104231 2024-10-23T09:41:53 Z manhlinh1501 Exam (eJOI20_exam) C++17
77 / 100
 83 ms 103240 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int MAXN = 2e5 + 5;
#define left ___left
#define right ___right
#define ALL(a) (a).begin(), (a).end()

using pii = pair<int, int>;
int N;
int a[MAXN];
int b[MAXN];
int left[MAXN];
int right[MAXN];

void compress() {
    map<int, int> comp;
    for(int i = 1; i <= N; i++) comp[a[i]] = 1;
    for(int i = 1; i <= N; i++) comp[b[i]] = 1;
    int c = 0;
    for(auto &[x, y] : comp) y = ++c;
    for(int i = 1; i <= N; i++) a[i] = comp[a[i]];
    for(int i = 1; i <= N; i++) b[i] = comp[b[i]];
}

namespace subtask2 {
    bool is_subtask() {
        for(int i = 1; i < N; i++) {
            if(b[i] != b[i + 1]) return false;
        }
        return true;
    }
    int cnt[MAXN];

    void solution() {
        if(is_subtask() == false) return;
        for(int i = 1; i <= N; i++) {
            if(a[i] == b[i]) {
                cnt[left[i]]++;
                cnt[right[i] + 1]--;
            }
        }
        for(int i = 1; i <= N; i++) cnt[i] += cnt[i - 1];
        int ans = 0;
        for(int i = 1; i <= N; i++) ans += (cnt[i] > 0);
        cout << ans;
        exit(0);
    }
}

namespace subtask3 {
    const int MAXN = 5e3 + 5;
    bool is_subtask() {
        return is_sorted(a + 1, a + N + 1);
    }
    int dp[MAXN][MAXN];

    void solution() {
        if(is_subtask() == false) return;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= i; j++) {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                if(a[i] == b[j])
                    dp[i][j] = max(dp[i][j], max(dp[i - 1][j - 1], dp[i][j - 1]) + 1);
            }
        }
        int ans = 0;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= i; j++)
                ans = max(ans, dp[i][j]);
        }
        cout << ans;
        exit(0);
    }
}

namespace subtask4 {
    bool is_subtask() {
        vector<int> b;
        for(int i = 1; i <= N; i++) b.emplace_back(a[i]);
        sort(ALL(b));
        for(int i = 1; i < N; i++) {
            if(b[i] == b[i - 1]) return false;
        }
        return true;
    }

    namespace BIT {
        int N;
        int tree[MAXN];

        void init(int _N) {
            N = _N;
        }
        void update(int x, int v) {
            for(; x <= N; x += (x & -x))
                tree[x] = max(tree[x], v);
        }

        int get(int x) {
            int res = 0;
            for(; x; x -= (x & -x))
                res = max(res, x);
            return res;
        }
    }

    int pos[MAXN];

    void solution() {
        if(is_subtask() == false) return;
        BIT::init(N);
        for(int i = 1; i <= N; i++) pos[a[i]] = i;
        int ans = 0;
        for(int i = 1; i <= N; i++) {
            int p = pos[b[i]];
            if(p == 0) continue;
            if(left[p] <= i and i <= right[p])
                BIT::update(p, BIT::get(p) + 1);
        }
        cout << BIT::get(N);
        exit(0);
    }
}

namespace subtask6 {
    const int MAXN = 5e3 + 5;

    int dp[MAXN][MAXN];

    bool is_subtask() {
        return N < MAXN;
    }

    void solution() {
        if(is_subtask() == false) return;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= N; j++) {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                if(a[i] == b[j] and left[i] <= j and j <= right[i])
                    dp[i][j] = max(dp[i][j], max(dp[i - 1][j - 1], dp[i][j - 1]) + 1);
            }
        }
        int ans = 0;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= N; j++)
                ans = max(ans, dp[i][j]);
        }
        cout << ans;
        exit(0);
    }
}

signed main() {
#define task "code"
    if(fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N;
    for(int i = 1; i <= N; i++) cin >> a[i];
    for(int i = 1; i <= N; i++) cin >> b[i];
    compress();
    for(int i = 1; i <= N; i++) {
        left[i] = i - 1;
        while(left[i] > 0 and a[left[i]] <= a[i])
            left[i] = left[left[i]];
    }
    for(int i = N; i >= 1; i--) {
        right[i] = i + 1;
        while(right[i] <= N and a[right[i]] <= a[i])
            right[i] = right[right[i]];
    }
    for(int i = 1; i <= N; i++) {
        left[i]++;
        right[i]--;
    }
    subtask2::solution();
    subtask3::solution();
    subtask6::solution();
    subtask4::solution();
    return (0 ^ 0);
}

Compilation message

exam.cpp: In function 'void subtask4::solution()':
exam.cpp:114:13: warning: unused variable 'ans' [-Wunused-variable]
  114 |         int ans = 0;
      |             ^~~
exam.cpp: In function 'int main()':
exam.cpp:157:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  157 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
exam.cpp:158:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  158 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 5 ms 4432 KB Output is correct
3 Correct 30 ms 8776 KB Output is correct
4 Correct 9 ms 4600 KB Output is correct
5 Correct 63 ms 9128 KB Output is correct
6 Correct 11 ms 4432 KB Output is correct
7 Correct 15 ms 4432 KB Output is correct
8 Correct 56 ms 7468 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 3 ms 6992 KB Output is correct
3 Correct 14 ms 23888 KB Output is correct
4 Correct 42 ms 75960 KB Output is correct
5 Correct 57 ms 78160 KB Output is correct
6 Correct 45 ms 78160 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 1 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4432 KB Output is correct
7 Correct 1 ms 4432 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4944 KB Output is correct
10 Correct 2 ms 5456 KB Output is correct
11 Correct 2 ms 5456 KB Output is correct
12 Correct 3 ms 5456 KB Output is correct
13 Correct 2 ms 5456 KB Output is correct
14 Correct 2 ms 5456 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 1 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4432 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 3 ms 6992 KB Output is correct
9 Correct 14 ms 23888 KB Output is correct
10 Correct 42 ms 75960 KB Output is correct
11 Correct 57 ms 78160 KB Output is correct
12 Correct 45 ms 78160 KB Output is correct
13 Correct 1 ms 4432 KB Output is correct
14 Correct 1 ms 4688 KB Output is correct
15 Correct 1 ms 4944 KB Output is correct
16 Correct 2 ms 5456 KB Output is correct
17 Correct 2 ms 5456 KB Output is correct
18 Correct 3 ms 5456 KB Output is correct
19 Correct 2 ms 5456 KB Output is correct
20 Correct 2 ms 5456 KB Output is correct
21 Correct 2 ms 5456 KB Output is correct
22 Correct 8 ms 12564 KB Output is correct
23 Correct 2 ms 4432 KB Output is correct
24 Correct 83 ms 102984 KB Output is correct
25 Correct 56 ms 102992 KB Output is correct
26 Correct 48 ms 102996 KB Output is correct
27 Correct 63 ms 102408 KB Output is correct
28 Correct 67 ms 102496 KB Output is correct
29 Correct 45 ms 78168 KB Output is correct
30 Correct 71 ms 102480 KB Output is correct
31 Correct 78 ms 102472 KB Output is correct
32 Correct 72 ms 102488 KB Output is correct