답안 #492151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492151 2021-12-05T17:41:12 Z jeroenodb Global Warming (CEOI18_glo) C++14
10 / 100
101 ms 2364 KB
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
int main() {
    int n,x; cin >> n >> x;
    vi dp,dp2;
    while(n--) {
        int a; cin >> a;
        // dp2 can be made better with a normally
        auto it = lower_bound(all(dp2),a);
        if(it==dp2.end()) dp2.push_back(a);
        else *it=a;
        // now make dp2 better with special transition
        int j = lower_bound(all(dp),a+x)-dp.begin();
        if(j==dp2.size()) dp2.push_back(a);
        else dp2[j] = min(dp2[j],a);
        // normal transition for dp
        it = lower_bound(all(dp),a);
        if(it==dp.end()) dp.push_back(a);
        else *it=a;


    }
    cout << dp2.size() << '\n';
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:23:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if(j==dp2.size()) dp2.push_back(a);
      |            ~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 2212 KB Output is correct
2 Correct 89 ms 2188 KB Output is correct
3 Correct 101 ms 2180 KB Output is correct
4 Correct 88 ms 2196 KB Output is correct
5 Correct 61 ms 2364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 664 KB Output is correct
2 Correct 23 ms 716 KB Output is correct
3 Correct 22 ms 776 KB Output is correct
4 Correct 15 ms 844 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 1160 KB Output is correct
2 Correct 47 ms 1220 KB Output is correct
3 Incorrect 95 ms 2196 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -