답안 #968827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968827 2024-04-24T06:59:43 Z vjudge1 Global Warming (CEOI18_glo) C++17
15 / 100
2000 ms 3164 KB
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> dp;

int lis(int tt[],int n,int a,int b,int x){
    int t[n+1];
    for(int i=1;i<=n;++i) t[i]=tt[i];
    for(int i=a;i<=b;++i){
        t[i]+=x;
    }
    dp.clear();
    for(int i=1;i<=n;++i){
        int idx=lower_bound(dp.begin(),dp.end(),t[i])-dp.begin();
        if(idx==dp.size()) dp.push_back(t[i]);
        else dp[idx]=t[i];
    }
    return dp.size();
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int n,x; cin >> n >> x;
    int t[n+1];
    for(int i=1;i<=n;++i) cin >> t[i];
    int maxi=0;
    for(int p=-abs(x);p<=abs(x);++p){
        for(int s=1;s<=n;++s){
            for(int e=s;e<=n;++e){
                //cout << s << " " << e << " " << p << " " << lis(t,n,s,e,p) << endl;
                maxi=max(lis(t,n,s,e,p),maxi);
            }
        }
    }
    cout << maxi;
}

Compilation message

glo.cpp: In function 'int lis(int*, int, int, int, int)':
glo.cpp:17:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         if(idx==dp.size()) dp.push_back(t[i]);
      |            ~~~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 13 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 52 ms 432 KB Output is correct
15 Correct 17 ms 444 KB Output is correct
16 Correct 16 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 13 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 52 ms 432 KB Output is correct
15 Correct 17 ms 444 KB Output is correct
16 Correct 16 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Execution timed out 2066 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2053 ms 3164 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2047 ms 1116 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2043 ms 1876 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 13 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 52 ms 432 KB Output is correct
15 Correct 17 ms 444 KB Output is correct
16 Correct 16 ms 452 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Execution timed out 2066 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -