oj.uz

Submission #763353

# Submission time Handle Problem Language Result Execution time Memory
763353 2023-06-22T08:34:06 Z giaminh2211 Financial Report (JOI21_financial) C++14
5 / 100
 121 ms 6440 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int d;
// Function to find the length of the longest increasing subsequence
int findLongestIncreasingSubsequence(const vector<int>& arr) {
    int n = arr.size();
    vector<int> lis;
    
    for (int num : arr) {
        auto it =  lower_bound(lis.begin(), lis.end(), num);
        if (it == lis.end()) {
            lis.push_back(num);
        } else {
            *it = num;
        }
    }

    return lis.size();
}

int main() {
    int n;
    cin >> n >> d;

    vector<int> arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }

    int length = findLongestIncreasingSubsequence(arr);
    cout << length << endl;

    return 0;
}

Compilation message

Main.cpp: In function 'int findLongestIncreasingSubsequence(const std::vector<int>&)':
Main.cpp:10:9: warning: unused variable 'n' [-Wunused-variable]
   10 |     int n = arr.size();
      |         ^

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1456 KB Output is correct
2 Correct 79 ms 1456 KB Output is correct
3 Incorrect 95 ms 4132 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 1464 KB Output is correct
2 Correct 95 ms 1460 KB Output is correct
3 Correct 97 ms 4300 KB Output is correct
4 Correct 98 ms 4272 KB Output is correct
5 Correct 121 ms 4900 KB Output is correct
6 Correct 97 ms 4392 KB Output is correct
7 Correct 92 ms 6440 KB Output is correct
8 Correct 86 ms 4400 KB Output is correct
9 Correct 89 ms 4896 KB Output is correct
10 Correct 95 ms 4404 KB Output is correct
11 Correct 98 ms 4260 KB Output is correct
12 Correct 86 ms 4404 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -