oj.uz

답안 #1078897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078897 2024-08-28T07:52:24 Z LittleOrange 송신탑 (IOI22_towers) C++17
0 / 100
 518 ms 2004 KB 
#include "towers.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = int;
const ll big = 1e9+10;
ll n;
vector<ll> h;
//ll mx;
vector<ll> ps;
struct obj{
  ll v,c;
  bool operator<(const obj &o) const{
    return v<o.v;
  }
  bool operator>(const obj &o) const{
    return v>o.v;
  }
};

void init(int N, std::vector<int> H) {
  n = N;
  h = H;
  //for(ll i = 0;i<n;i++) if((i==0||(h[i-1]<h[i]))&&(i==n-1||h[i]>h[i+1])) mx = i;
  ps.push_back(0);
  for(ll i = 2;i<n;i++){
    if (h[i]>h[i-1]!=h[i-1]>h[i-2]){
      ps.push_back(i-1);
    }
  }
  ps.push_back(n-1);
  //for(auto [u,v] : ps) cerr << "[" << u << "," << v << "]" << " ";cerr << "\n";
}

int max_towers(int L, int R, int D) {
  ll l = L, r = R, d = D;
  ll ans = 1;
  auto it0 = lower_bound(ps.begin(),ps.end(),r);
  ll rf = it0-ps.begin();
  auto it1 = lower_bound(ps.begin(),ps.end(),l+1);
  ll lf = it1-ps.begin();
  //cerr << lf << " " << rf << "\n";
  return (rf-lf+1)/2+1;
  /*vector<obj> a,b;
  a.push_back({0,0});
  b.push_back({big,0});
  for(ll i = l;i<=r;i++){
    ll cur = 0;
    auto it = lower_bound(b.begin(),b.end(),obj({h[i]-1,0}),greater<obj>());
    --it;
    cur = (*it).c;
    ans = max(ans,cur+1);
    obj oa = {h[i],cur+1};
    if (a.size()<=oa.c) a.push_back(oa);
    else a[oa.c] = min(a[oa.c],oa);
    auto it0 = lower_bound(a.begin(),a.end(),obj({h[i]-d+1,0}));
    --it0;
    obj ob = {h[i]-d,(*it0).c};
    if (b.size()<=ob.c) b.push_back(ob);
    else b[ob.c] = max(b[ob.c],ob);
    ans = max(ans,cur+1);
    //cerr << "a:";for(auto [u,v] : a) cerr << "(" << u <<"," << v << ") ";cerr << "\n";
    //cerr << "b:";for(auto [u,v] : b) cerr << "(" << u <<"," << v << ") ";cerr << "\n";
  }*/
  return ans;
}

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:28:13: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
   28 |     if (h[i]>h[i-1]!=h[i-1]>h[i-2]){
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:37:20: warning: unused variable 'd' [-Wunused-variable]
   37 |   ll l = L, r = R, d = D;
      |                    ^

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 1112 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '17'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '17'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 518 ms 2004 KB 4th lines differ - on the 1st token, expected: '13956', found: '13957'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 192 ms 600 KB 1st lines differ - on the 1st token, expected: '7197', found: '8004'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '17'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 300 ms 1112 KB 2nd lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -