Submission #1132429

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132429		steveonalex	Dancing Elephants (IOI11_elephants)	C++20	26 / 100	9088 ms	1604 KiB

elephants

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


#include "elephants.h"

int n, l;
vector<int> pos;
multiset<int> S;
void init(int N, int L, int X[]){
    n = N, l = L;
    pos.resize(n);
    for(int i= 0; i< n; ++i) pos[i] = X[i];
    for(int i: pos) S.insert(i);
}

int update(int i, int y){
    S.erase(S.find(pos[i]));
    pos[i] = y;
    S.insert(pos[i]);

    int ans = 0;
    int j = 0;
    while(true){
        auto it = S.lower_bound(j);
        if (it == S.end()) break;
        j = *it;
        j += l + 1;
        ans++;
    }
    return ans;
}


// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

//     clock_t start = clock();

//     int n, l; cin >> n >> l;
//     int x[n];
//     for(int i= 0; i < n; ++i) cin >> x[i];

//     init(n, l, x);

//     int q; cin >> q;
//     while(q--){
//         int i, y; cin >> i >> y;
//         cout << update(i, y) << "\n";
//     }


//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

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