oj.uz

Submission #156602

# Submission time Handle Problem Language Result Execution time Memory
156602 2019-10-06T15:21:05 Z dolphingarlic Global Warming (CEOI18_glo) C++14
27 / 100
 54 ms 3204 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

vector<int> red_lis, all_lis;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    FOR(i, 0, n) {
        int a;
        cin >> a;
        int red_dist = (red_lis.size() ? lower_bound(red_lis.begin(), red_lis.end(), a - m) - red_lis.begin() : 0);
        if (red_dist == red_lis.size()) red_lis.push_back(a - m);
        else red_lis[red_dist] = a - m;

        int all_dist = (all_lis.size() ? lower_bound(all_lis.begin(), all_lis.end(), a) - all_lis.begin() : 0);
        if (all_dist == all_lis.size()) all_lis.push_back(a);
        else all_lis[all_dist] = a;

        if (red_dist > all_lis.size()) all_lis.push_back(a - m);
        else all_lis[red_dist] = a - m;

        // for (int j : red_lis) cout << j << ' ';
        // cout << "| ";
        // for (int j : all_lis) cout << j << ' ';
        // cout << '\n';
    }

    cout << all_lis.size();
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:17:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (red_dist == red_lis.size()) red_lis.push_back(a - m);
             ~~~~~~~~~^~~~~~~~~~~~~~~~~
glo.cpp:21:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (all_dist == all_lis.size()) all_lis.push_back(a);
             ~~~~~~~~~^~~~~~~~~~~~~~~~~
glo.cpp:24:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (red_dist > all_lis.size()) all_lis.push_back(a - m);
             ~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2328 KB Output is correct
2 Correct 53 ms 2304 KB Output is correct
3 Correct 53 ms 2268 KB Output is correct
4 Correct 54 ms 2296 KB Output is correct
5 Correct 36 ms 2540 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 760 KB Output is correct
2 Correct 14 ms 888 KB Output is correct
3 Correct 14 ms 760 KB Output is correct
4 Correct 10 ms 1016 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1296 KB Output is correct
2 Correct 27 ms 1400 KB Output is correct
3 Correct 54 ms 2280 KB Output is correct
4 Correct 36 ms 2540 KB Output is correct
5 Correct 20 ms 1524 KB Output is correct
6 Correct 35 ms 2544 KB Output is correct
7 Correct 37 ms 3204 KB Output is correct
8 Correct 23 ms 1272 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct