oj.uz

Submission #525466

# Submission time Handle Problem Language Result Execution time Memory
525466 2022-02-11T17:54:22 Z ammar2000 Global Warming (CEOI18_glo) C++17
38 / 100
 2000 ms 3048 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,x,a[SI];
vector < ll > LIS;
int main()
{
   ll ans=0;
   fast
   cin>>n>>x;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int r=0;r<n;r++)
   {
     LIS.clear();
     a[r]-=x;
     for (int i=0;i<n;i++)
     {
        ll j=lower_bound(LIS.begin(),LIS.end(),a[i])-LIS.begin();
        if (j==LIS.size())
          LIS.pb(a[i]);
        else LIS[j]=a[i];
     }
   ans=max(ans,(ll)LIS.size());
   if (x==0)
    break;
   }
   cout <<ans<<"\n";
   // use scanf not cin
   return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:34:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         if (j==LIS.size())
      |             ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 16 ms 336 KB Output is correct
20 Correct 14 ms 324 KB Output is correct
21 Correct 14 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 12 ms 348 KB Output is correct
24 Correct 12 ms 348 KB Output is correct
25 Correct 8 ms 316 KB Output is correct
26 Correct 9 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2016 KB Output is correct
2 Correct 28 ms 1868 KB Output is correct
3 Correct 28 ms 1784 KB Output is correct
4 Correct 29 ms 1880 KB Output is correct
5 Correct 18 ms 3048 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2054 ms 1100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 16 ms 336 KB Output is correct
20 Correct 14 ms 324 KB Output is correct
21 Correct 14 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 12 ms 348 KB Output is correct
24 Correct 12 ms 348 KB Output is correct
25 Correct 8 ms 316 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 34 ms 2016 KB Output is correct
28 Correct 28 ms 1868 KB Output is correct
29 Correct 28 ms 1784 KB Output is correct
30 Correct 29 ms 1880 KB Output is correct
31 Correct 18 ms 3048 KB Output is correct
32 Execution timed out 2082 ms 716 KB Time limit exceeded
33 Halted 0 ms 0 KB -