oj.uz

Submission #846969

# Submission time Handle Problem Language Result Execution time Memory
846969 2023-09-08T19:13:15 Z SUNWOOOOOOOO Financial Report (JOI21_financial) C++17
5 / 100
 46 ms 4432 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 300005;
int n, d, A[mxN], lis[mxN];

int main()
{
    scanf("%d %d", &n, &d);
    for (int i = 1; i <= n; i++) scanf("%d", &A[i]);

    int ans = 0;
    lis[ans] = -1;
    for (int i = 1; i <= n; i++){
        if (A[i] > lis[ans]) lis[++ans] = A[i];
        else {
            int idx = lower_bound(lis, lis + ans, A[i]) - lis;
            lis[idx] = A[i];
        }
    }

    printf("%d\n", ans);

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:9:39: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     for (int i = 1; i <= n; i++) scanf("%d", &A[i]);
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2392 KB Output is correct
2 Correct 27 ms 2392 KB Output is correct
3 Incorrect 36 ms 4188 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 24 ms 2392 KB Output is correct
2 Correct 34 ms 2392 KB Output is correct
3 Correct 40 ms 4176 KB Output is correct
4 Correct 39 ms 4372 KB Output is correct
5 Correct 46 ms 4352 KB Output is correct
6 Correct 38 ms 4176 KB Output is correct
7 Correct 24 ms 4432 KB Output is correct
8 Correct 26 ms 4184 KB Output is correct
9 Correct 30 ms 4432 KB Output is correct
10 Correct 36 ms 4176 KB Output is correct
11 Correct 41 ms 4184 KB Output is correct
12 Correct 26 ms 4180 KB Output is correct

Subtask #6
0 / 35.0

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