Submission #466697

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
466697	2021-08-20 09:16:47	Valaki2	Exam (eJOI20_exam)	C++14	39 / 100	61 ms	2508 KiB

exam

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
vector<int> b;
void solve_bf() {
    set<int> a_set;
    vector<bool> possible(1 + n, false);
    for(int i = 1; i <= n; ++i) a_set.insert(a[i]);
    for(int i = 1; i <= n; ++i) if(a_set.count(b[i])) possible[i] = true;
    int ans = 0;
    vector<bool> cur(1 + n, false);
    for(int mask = 0; mask < (1 << n); ++mask) {
        bool ok = true;
        for(int i = 0; i < n; ++i) {
            if(mask & (1 << i)) {
                cur[i + 1] = true;
                if(!possible[i + 1]) ok = false;
            } else {
                cur[i + 1] = false;
            }
        }
        if(!ok) continue;
        for(int i = 1; i <= n; ++i) {
            if(!cur[i]) continue;
            bool done = false;
            for(int j = i; j >= 1; --j) {
                if(a[j] > b[i] || (cur[j] && b[j] < b[i])) break;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 12 / 12
• Subtask 3: 13 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22