답안 #164096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164096 2019-11-17T12:55:19 Z errorgorn Global Warming (CEOI18_glo) C++14
28 / 100
2000 ms 1104 KB
#include <cstdio>
#include <vector>
using namespace std;
int n,k;
int arr[200005];

int test(int i){
    vector<int> v;
    vector<int>::iterator it;
    v.push_back(arr[0]);
    for (int x=1;x<i;x++){
        if (v.back()<arr[x]) v.push_back(arr[x]);
        else{
            it=lower_bound(v.begin(),v.end(),arr[x]);
            v[it-v.begin()]=arr[x];
        }
    }
    for (int x=i;x<n;x++){
        if (v.back()<arr[x]+k) v.push_back(arr[x]+k);
        else{
            it=lower_bound(v.begin(),v.end(),arr[x]+k);
            v[it-v.begin()]=arr[x]+k;
        }
    }

    return v.size();
}

int main(){
    scanf("%d%d",&n,&k);
    for (int x=0;x<n;x++) scanf("%d",&arr[x]);
    int best=-1;
    for (int x=1;x<=n;x++){
        best=max(best,test(x));
    }

    printf("%d\n",best);
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~
glo.cpp:31:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int x=0;x<n;x++) scanf("%d",&arr[x]);
                           ~~~~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 26 ms 256 KB Output is correct
20 Correct 22 ms 464 KB Output is correct
21 Correct 22 ms 376 KB Output is correct
22 Correct 22 ms 256 KB Output is correct
23 Correct 10 ms 256 KB Output is correct
24 Correct 10 ms 256 KB Output is correct
25 Correct 8 ms 256 KB Output is correct
26 Correct 11 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2039 ms 1104 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2055 ms 508 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 632 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 26 ms 256 KB Output is correct
20 Correct 22 ms 464 KB Output is correct
21 Correct 22 ms 376 KB Output is correct
22 Correct 22 ms 256 KB Output is correct
23 Correct 10 ms 256 KB Output is correct
24 Correct 10 ms 256 KB Output is correct
25 Correct 8 ms 256 KB Output is correct
26 Correct 11 ms 376 KB Output is correct
27 Execution timed out 2039 ms 1104 KB Time limit exceeded
28 Halted 0 ms 0 KB -