제출 #269444

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
269444		PKhing	코끼리 (Dancing Elephants) (IOI11_elephants)	C++14	26 / 100	9095 ms	2944 KiB

elephants

#include<bits/stdc++.h>
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,a) for(int i=1;i<=a;i++)
#define db(a) printf("<%d> ",a)
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define pb emplace_back
#define p emplace
#define iii pair<int,int>
#define ll long long
#define rf() freopen("_working/input.in","r",stdin)
#define pf() freopen("_working/output.out","w+",stdout)
using namespace std;
const int INF=1e9;
#include "elephants.h"

int n;
int l;
int x[150005];
set<iii> s;
void init(int N, int L, int X[])
{
  n = N;
  l = L;
  FOR(i,N){
    s.p(X[i],i);
    x[i]=X[i];
  }
}

int update(int i, int y)
{
  if(n>50000) return n;
  s.erase(mp(x[i],i));
  s.insert(mp(y,i));
  x[i]=y;
  int bf = -1;
  int cnt= 0;
  for(auto i:s){
    //printf(".%d ",i.f);
    if(bf<i.f){
      cnt++;
      bf = i.f+l;
    }
  }
  //cout<<endl;
  return cnt;
}

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