Submission #941545

#	Time	Username	Problem	Language	Result	Execution time	Memory
941545		quanlt206	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9022 ms	10292 KiB

elephants

#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 150007;

int n, L, a[N], Q, x[N];


void init(int nn, int LL, int x[]) {
    n = nn;
    L = LL;
    REP(i, 0, n) a[i] = x[i];
}

int update(int i, int y) {
    a[i] = y;
    vector<int> b;
    REP(i, 0, n) b.push_back(a[i]);
    sort(all(b));
    int res = 0;
    i = 0;
    while (i < n) {
        res++;
        int j = i;
        while (j + 1 < n && b[i] + L >= b[j + 1]) j++;
        i = j + 1;
    }
    return res;
}

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