oj.uz

Submission #411605

# Submission time Handle Problem Language Result Execution time Memory
411605 2021-05-25T15:04:13 Z aris12345678 Exam (eJOI20_exam) C++14
12 / 100
 259 ms 1048 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1e5+5;
int a[mxN], b[mxN];

bool sub2(int n) {
    for(int i = 1; i < n; i++) {
        if(b[i] != b[i-1])
            return false;
    }
    return true;
}

int main() {
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    for(int i = 0; i < n; i++)
        scanf("%d", &b[i]);
    if(sub2(n)) {
        int i = 0, j = 0, mx = 0, ans = 0;
        while(j < n) {
            if(a[j] > b[0] && mx == b[0])
            ans += (j-i), mx = 0;
            while(a[j] > b[0])
                j++, i = j;
            mx = max(mx, a[j++]);
        }
        if(mx == b[0])
            ans += (j-i);
        printf("%d\n", ans);
    } else {
        int ans = 0;
        for(int mask = 0; mask < 1 << n; mask++) {
            int res = 0, prev_i = 0;
            map<int, int> left, right;
            for(int i = 0; i < n; i++) {
                if(mask&(1 << i)) {
                    for(int j = prev_i+1; j < i; j++) {
                        if(a[j] < a[i])
                            left[b[j]]++;
                    }
                    for(int j = i+1; j < n; j++) {
                        if(mask&(1 << j)) break;
                        if(a[j] < a[i])
                            right[b[j]]++;
                    }
                    res += left[a[i]]+right[a[i]];
                    left.clear();
                    right.clear();
                    prev_i = i;
                }
            }
            left.clear();
            right.clear();
            ans = max(ans, res);
        }
        for(int i = 0; i < n; i++) {
            if(a[i] == b[i])
                ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
exam.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
exam.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         scanf("%d", &b[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 2 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Correct 29 ms 984 KB Output is correct
4 Correct 19 ms 972 KB Output is correct
5 Correct 33 ms 1048 KB Output is correct
6 Correct 22 ms 972 KB Output is correct
7 Correct 19 ms 1020 KB Output is correct
8 Correct 27 ms 972 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 259 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 2 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 2 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -