oj.uz

답안 #553165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553165 2022-04-25T01:02:34 Z farhan132 Global Warming (CEOI18_glo) C++17
100 / 100
 67 ms 6304 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e5 + 5;

ll res[N] , a[N];

void solve(){

  vector < ll > v;

  ll n, x; cin >> n >> x;

  for(ll i = 1; i <= n; i++){
    cin >> a[i];
    res[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
    auto it = lower_bound(v.begin(), v.end(), a[i]);
    if(it == v.end()){
        v.pb(a[i]);
    }else{
        *it = a[i];
    }
  }
  ll ans = v.size();
  v.clear();
  for(ll i = n; i >= 1; i--){
    ll k = lower_bound(v.begin(), v.end(), -a[i]) - v.begin();
    ans = max(ans, k + res[i]);
    auto it = lower_bound(v.begin(), v.end(), -a[i]-x);
    if(it == v.end()){
        v.pb(-a[i]-x);
    }else{
        *it = (-a[i]-x);
    }
  }
  cout << ans << '\n';

  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:117:15: warning: unused variable 'CT' [-Wunused-variable]
  117 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 5336 KB Output is correct
2 Correct 53 ms 5388 KB Output is correct
3 Correct 54 ms 5380 KB Output is correct
4 Correct 67 ms 5312 KB Output is correct
5 Correct 33 ms 5448 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1524 KB Output is correct
2 Correct 12 ms 1504 KB Output is correct
3 Correct 12 ms 1524 KB Output is correct
4 Correct 8 ms 1644 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 12 ms 1624 KB Output is correct
7 Correct 11 ms 1548 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2928 KB Output is correct
2 Correct 22 ms 2776 KB Output is correct
3 Correct 47 ms 5380 KB Output is correct
4 Correct 33 ms 5460 KB Output is correct
5 Correct 18 ms 2916 KB Output is correct
6 Correct 28 ms 5372 KB Output is correct
7 Correct 30 ms 5920 KB Output is correct
8 Correct 19 ms 2856 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 52 ms 5336 KB Output is correct
28 Correct 53 ms 5388 KB Output is correct
29 Correct 54 ms 5380 KB Output is correct
30 Correct 67 ms 5312 KB Output is correct
31 Correct 33 ms 5448 KB Output is correct
32 Correct 14 ms 1524 KB Output is correct
33 Correct 12 ms 1504 KB Output is correct
34 Correct 12 ms 1524 KB Output is correct
35 Correct 8 ms 1644 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 12 ms 1624 KB Output is correct
38 Correct 11 ms 1548 KB Output is correct
39 Correct 23 ms 2928 KB Output is correct
40 Correct 22 ms 2776 KB Output is correct
41 Correct 47 ms 5380 KB Output is correct
42 Correct 33 ms 5460 KB Output is correct
43 Correct 18 ms 2916 KB Output is correct
44 Correct 28 ms 5372 KB Output is correct
45 Correct 30 ms 5920 KB Output is correct
46 Correct 19 ms 2856 KB Output is correct
47 Correct 25 ms 2824 KB Output is correct
48 Correct 24 ms 2832 KB Output is correct
49 Correct 54 ms 5368 KB Output is correct
50 Correct 31 ms 5436 KB Output is correct
51 Correct 27 ms 4436 KB Output is correct
52 Correct 35 ms 5624 KB Output is correct
53 Correct 28 ms 5572 KB Output is correct
54 Correct 34 ms 6304 KB Output is correct
55 Correct 42 ms 5320 KB Output is correct