제출 #36355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36355		funcsr	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9000 ms	25224 KiB

elephants

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include "elephants.h"
using namespace std;
#define INF 1145141919
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define _1 first
#define _2 second
typedef pair<int, int> P;

int N, L;
int A[150000];
multiset<int> B;

void init(int n, int l, int X[]) {
  N = n, L = l;
  rep(i, N) A[i] = X[i], B.insert(X[i]);
}

int update(int i, int y) {
  B.erase(B.find(A[i]));
  B.insert(A[i] = y);
  int until = *B.begin()+L, c = 1;
  for (int b : B) {
    if (b > until) until = b+L, c++;
  }
  return c;
}

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