답안 #538361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538361 2022-03-16T16:21:04 Z terrasphere Global Warming (CEOI18_glo) C++17
38 / 100
2000 ms 4552 KB
#include <bits/stdc++.h>

using namespace std;

long long n,x;

long long LIS(vector<long long> vec)
{
    vector<long long> lis;
    for(int i=0;i<n;i++)
    {
        if(lis.empty() || lis.back()<vec[i])
            lis.push_back(vec[i]);
        else
            lis[lower_bound(lis.begin(),lis.end(),vec[i])-lis.begin()]=vec[i];
    }
    return lis.size();
}

int main()
{
    scanf("%lld%lld",&n,&x);
    vector<long long> v;
    v.resize(n);
    for(int i=0;i<n;i++)
        scanf("%lld",&v[i]);
    long long answer=0;
    if(x==0)
    {
        printf("%lld\n",LIS(v));
        return 0;
    }
    for(int i=0;i<n;i++)
    {
        v[i]-=x;
        answer=max(answer,LIS(v));
    }
    for(int i=0;i<n;i++)
        v[i]+=x;
    for(int i=n-1;i>0;i--)
    {
        v[i]+=x;
        answer=max(answer,LIS(v));
    }
    printf("%lld\n",answer);
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%lld%lld",&n,&x);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
glo.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         scanf("%lld",&v[i]);
      |         ~~~~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 248 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 248 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 40 ms 212 KB Output is correct
20 Correct 34 ms 212 KB Output is correct
21 Correct 37 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 17 ms 212 KB Output is correct
24 Correct 17 ms 320 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 12 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 3404 KB Output is correct
2 Correct 37 ms 3396 KB Output is correct
3 Correct 36 ms 3428 KB Output is correct
4 Correct 35 ms 3408 KB Output is correct
5 Correct 23 ms 4552 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 ms 1100 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2087 ms 1876 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 248 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 40 ms 212 KB Output is correct
20 Correct 34 ms 212 KB Output is correct
21 Correct 37 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 17 ms 212 KB Output is correct
24 Correct 17 ms 320 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 12 ms 212 KB Output is correct
27 Correct 38 ms 3404 KB Output is correct
28 Correct 37 ms 3396 KB Output is correct
29 Correct 36 ms 3428 KB Output is correct
30 Correct 35 ms 3408 KB Output is correct
31 Correct 23 ms 4552 KB Output is correct
32 Execution timed out 2075 ms 1100 KB Time limit exceeded
33 Halted 0 ms 0 KB -