oj.uz

답안 #346330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346330 2021-01-09T11:44:38 Z jenishmonpara Global Warming (CEOI18_glo) C++14
100 / 100
 68 ms 7912 KB 
#include <bits/stdc++.h>
using namespace std;
long double PI = acos(-1);
long double DEL = 1e-10;
int M =  1e9 + 7;
const int N = 3e5 + 10;

#define ftt cin>>t;for(int tt=1;tt<=t;++tt)
#define all(a) a.begin(),a.end()
#define vpii vector<pair<int,int>>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define vi vector<int>
#define sq(a) ((a)*(a))
#define double long double
#define dbg cout<<"\nhi\n";
#define int long long
#define nl cout<<"\n"
#define sp <<" "<<
#define S second
#define F first

int fpow(int x, int n)
{
      int res = 1;
      x %= M;
      while(n)
      {
            if(n&1)res = res * x % M;
            x = x * x % M;
            n>>=1;
      }
      return res;
}
int gcd(int a,int b)
{
      if(b == 0)return a;
      return gcd(b,a % b);
}
int lcm(int a,int b)
{
      return a*(b/gcd(a,b));
}
void create_fac(int n)
{
      vector<int> fac(N),inv(N);
      fac[0] = inv[0] = 1;
      for(int i=1;i<=n;i++)
      {
            fac[i] = fac[i-1]*i % M;
            inv[i] = fpow(fac[i],M-2);
      }
}
int ncr(int n,int r)
{
      vector<int> fac(N),inv(N);
      return fac[n] * (inv[r] * inv[n-r] % M) % M;
      return fac[n] * (fpow(fac[r],M-2) * fpow(fac[n-r],M-2) % M ) % M;
}
void sieve (int n)      // linear sieve
{
      vector <int> primes;
      bool iscomp[N];
      for (int i = 2; i <= n; ++i)
      {
            if (!iscomp[i]) primes.push_back(i);
            for (int j = 0; j < primes.size() && i * primes[j] <= n; ++j)
            {
                  iscomp[i * primes[j]] = true;
                  if (i % primes[j] == 0) break;
            }
      }
}

// you can also use __int128
// priority_queue<int,vector<int>,greater<int>>
// bitset<100>(x).count()
//**************************************** CHECK CONSTRAINTS ***********************************************
int cnt, sum, mid, mx, mn, ans, a[N], b[N];
int n, m, d, i, j, k, l[N], p, q, r[N], t, w, x, y, z;
string s;


int32_t main()
{
      ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
      cin>>n>>x;
      for(int i=1;i<=n;i++)cin>>a[i];
      vi lis;
      for(int i=1;i<=n;i++)
      {
            int pos = lower_bound(all(lis),a[i]) - lis.begin();
            if(pos == lis.size())lis.push_back(a[i]);
            lis[pos] = a[i];
            l[i] = pos + 1;
      }
      ans = 0;
      lis.clear();
      for(int i=n;i>0;i--)
      {
            int pos = lower_bound(all(lis),-a[i]+x) - lis.begin();
            r[i] = pos;
            pos = lower_bound(all(lis),-a[i]) - lis.begin();
            if(pos == lis.size())lis.push_back(-a[i]);
            lis[pos] = -a[i];
            ans = max(ans,r[i] + l[i]);
            //cout<<i sp l[i] sp r[i];nl;
      }
      cout<<ans;
}

/*
 8 10
 7 3 5 12 2 7 3 4

 */

Compilation message

glo.cpp: In function 'void sieve(long long int)':
glo.cpp:67:31: 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]
   67 |             for (int j = 0; j < primes.size() && i * primes[j] <= n; ++j)
      |                             ~~^~~~~~~~~~~~~~~
glo.cpp: In function 'int32_t main()':
glo.cpp:93:20: 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]
   93 |             if(pos == lis.size())lis.push_back(a[i]);
      |                ~~~~^~~~~~~~~~~~~
glo.cpp:104:20: 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]
  104 |             if(pos == lis.size())lis.push_back(-a[i]);
      |                ~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 7020 KB Output is correct
2 Correct 61 ms 7000 KB Output is correct
3 Correct 61 ms 7020 KB Output is correct
4 Correct 68 ms 7020 KB Output is correct
5 Correct 34 ms 7164 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2028 KB Output is correct
2 Correct 15 ms 2028 KB Output is correct
3 Correct 15 ms 2028 KB Output is correct
4 Correct 9 ms 2160 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 8 ms 2160 KB Output is correct
7 Correct 12 ms 2028 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3820 KB Output is correct
2 Correct 26 ms 3692 KB Output is correct
3 Correct 52 ms 7020 KB Output is correct
4 Correct 35 ms 7144 KB Output is correct
5 Correct 16 ms 3820 KB Output is correct
6 Correct 30 ms 6888 KB Output is correct
7 Correct 35 ms 7528 KB Output is correct
8 Correct 22 ms 3692 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 61 ms 7020 KB Output is correct
28 Correct 61 ms 7000 KB Output is correct
29 Correct 61 ms 7020 KB Output is correct
30 Correct 68 ms 7020 KB Output is correct
31 Correct 34 ms 7164 KB Output is correct
32 Correct 15 ms 2028 KB Output is correct
33 Correct 15 ms 2028 KB Output is correct
34 Correct 15 ms 2028 KB Output is correct
35 Correct 9 ms 2160 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 8 ms 2160 KB Output is correct
38 Correct 12 ms 2028 KB Output is correct
39 Correct 25 ms 3820 KB Output is correct
40 Correct 26 ms 3692 KB Output is correct
41 Correct 52 ms 7020 KB Output is correct
42 Correct 35 ms 7144 KB Output is correct
43 Correct 16 ms 3820 KB Output is correct
44 Correct 30 ms 6888 KB Output is correct
45 Correct 35 ms 7528 KB Output is correct
46 Correct 22 ms 3692 KB Output is correct
47 Correct 29 ms 3692 KB Output is correct
48 Correct 30 ms 3692 KB Output is correct
49 Correct 60 ms 7020 KB Output is correct
50 Correct 34 ms 7272 KB Output is correct
51 Correct 29 ms 5736 KB Output is correct
52 Correct 33 ms 7272 KB Output is correct
53 Correct 34 ms 7272 KB Output is correct
54 Correct 39 ms 7912 KB Output is correct
55 Correct 49 ms 7020 KB Output is correct