oj.uz

Submission #1007368

# Submission time Handle Problem Language Result Execution time Memory
1007368 2024-06-24T17:26:25 Z c2zi6 Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 11056 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "elephants.h"

int n;
int l;
int a[60000];
int b[60000];

void init(int N, int L, int X[]) {
    n = N;
    l = L;
    rep(i, n) b[i] = a[i] = X[i];
    sort(b, b + n);
}

stack<int> st;
void replace(int x, int y) {
    while (b[n-1] > x) {
        st.push(b[--n]);
    }
    --n;
    while (n && b[n-1] > y) {
        st.push(b[--n]);
    }
    while (st.size() && st.top() < y) {
        b[n++] = st.top();
        st.pop();
    }
    b[n++] = y;
    while (st.size()) {
        b[n++] = st.top();
        st.pop();
    }
}

int update(int i, int y) {
    replace(a[i], y);
    a[i] = y;
    int R = -1e9;
    int ans = 0;
    for (int x : b) {
        if (x > R) ++ans, R = x+l;
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8652 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8652 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 2947 ms 10740 KB Output is correct
8 Correct 4139 ms 10832 KB Output is correct
9 Correct 6275 ms 11056 KB Output is correct
10 Execution timed out 9053 ms 10840 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8652 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 2947 ms 10740 KB Output is correct
8 Correct 4139 ms 10832 KB Output is correct
9 Correct 6275 ms 11056 KB Output is correct
10 Execution timed out 9053 ms 10840 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8652 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 2947 ms 10740 KB Output is correct
8 Correct 4139 ms 10832 KB Output is correct
9 Correct 6275 ms 11056 KB Output is correct
10 Execution timed out 9053 ms 10840 KB Time limit exceeded
11 Halted 0 ms 0 KB -