제출 #1096175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096175		MtSaka	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9087 ms	2396 KiB

elephants

#include "elephants.h"
#include"bits/stdc++.h"
#define overload(a,b,c,d,...) d
#define rep1(a) for(ll _=0;_<(ll)a;++_)
#define rep2(i,a) for(ll i=0;i<(ll)(a);++i)
#define rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i,a) for(ll i=(ll)(a)-1;i>=0;--i)
#define rrep2(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);--i)
#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll=long long;
using ull=unsigned long long;
using i128=__int128_t;
using ld=long double;
using vi=vector<int>;
using vl=vector<ll>;
template<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}
template<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}

int n;
multiset<int>st;
vector<int>x;
int l;
void init(int N, int L, int X[])
{
  n=N;
  x=vector<int>(X,X+N);
  st=multiset<int>(X,X+N);
  l=L;
}

int update(int i, int y)
{
  st.erase(st.find(x[i]));
  x[i]=y;
  st.insert(y);
  auto it=st.begin();
  int ans=0;
  while(true){
    ans++;
    it=st.upper_bound(*it+l);
    if(it==st.end())break;
  }
  return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3