oj.uz

답안 #441538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441538 2021-07-05T10:40:29 Z elazarkoren Exam (eJOI20_exam) C++17
0 / 100
 1000 ms 25332 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#define x first
#define y second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()
using namespace std;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 10;

int b[MAX_N];

int n;

void update(int l, int r, vi &v) {
    if (l > r) swap(l, r);
    int x = 0;
    for (int i = l; i <= r; i++) {
        chkmax(x, v[i]);
    }
    for (int i = l; i <= r; i++) {
        v[i] = x;
    }
}

int Count(vi &v) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (v[i] == b[i]) ans++;
    }
    return ans;
}

int ans = 0;

set<pair<vi, vb>> visit;

void Solve(vi &curr, vb &visited, int i) {
    if (!visit.insert({curr, visited}).y) return;
    chkmax(ans, Count(curr));
    if (i == n) return;
    for (int j = 0; j < n; j++) {
        if (!visited[j]) {
            for (int k = j + 1; k < n; k++) {
                vi next = curr;
                update(j, k, next);
                visited[j] = true;
                Solve(next, visited, i);
                visited[j] = false;
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    vi a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    vb visited(n);
    Solve(a, visited, 0);
//    vi per(2 * n);
//    for (int i = 0; i < n; i++) per[i] = i;
//    for (int i = n; i < 2 * n; i++) per[i] = i - n;
//    do {
//        vi curr = a;
//        for (int i = 0; i < 2 * n; i += 2) {
//            update(per[i], per[i + 1], curr);
//            chkmax(ans, Count(curr));
//        }
//    } while (next_permutation(all(per)));
    cout << ans;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 33 ms 684 KB Output is correct
5 Correct 94 ms 1476 KB Output is correct
6 Execution timed out 1088 ms 19796 KB Time limit exceeded

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1075 ms 25332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 33 ms 684 KB Output is correct
5 Correct 94 ms 1476 KB Output is correct
6 Execution timed out 1088 ms 19796 KB Time limit exceeded

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 33 ms 684 KB Output is correct
5 Correct 94 ms 1476 KB Output is correct
6 Execution timed out 1088 ms 19796 KB Time limit exceeded