Submission #1060192

# Submission time Handle Problem Language Result Execution time Memory
1060192 2024-08-15T11:25:10 Z ali2241 Global Warming (CEOI18_glo) C++17
10 / 100
2000 ms 7876 KB
#include <bits/stdc++.h>
#define int long long

using namespace std;

void fun() {
    int n, x;
    cin >> n >> x;
    int arr[n];
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    int mx = 0;
    for (int i = (-x); i <= x; ++i) {
        vector<int> lis;
        vector<int> ar;
        for (int j = 0; j < n; ++j) {
            int a = arr[j], b = arr[j] + i;
            if (b > a) {
                swap(a, b);
            }
            ar.push_back(a);
            ar.push_back(b);
        }
        for (int j = 0; j < 2 * n; ++j) {
            int a = ar[j];
            int p1 = lower_bound(lis.begin(), lis.end(), a) - lis.begin();
            if (p1 == lis.size() or lis.empty()) {
                lis.push_back(a);
            }
            else {
                lis[p1] = a;
            }
        }
        mx = max(mx, (int)lis.size());
    }
    cout << mx << "\n";
}
 
int32_t main() {
    fun();
}

Compilation message

glo.cpp: In function 'void fun()':
glo.cpp:28:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             if (p1 == lis.size() or lis.empty()) {
      |                 ~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 63 ms 6340 KB Output is correct
2 Correct 62 ms 6704 KB Output is correct
3 Correct 67 ms 7108 KB Output is correct
4 Correct 60 ms 7208 KB Output is correct
5 Correct 47 ms 7876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 50 ms 2612 KB Output is correct
2 Correct 50 ms 2608 KB Output is correct
3 Correct 57 ms 2632 KB Output is correct
4 Incorrect 42 ms 2624 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2021 ms 4836 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -