oj.uz

Submission #183186

# Submission time Handle Problem Language Result Execution time Memory
183186 2020-01-10T05:36:40 Z tri Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 1580 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 1.5e5 + 100;

int pos[MAXN];
multiset<int> pts;

int L;

void init(int N, int iL, int X[]) {
    L = iL;
    for (int i = 0; i < N; i++) {
        pos[i] = X[i];
        pts.insert(X[i]);
    }
}

int lCnt = 0;

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

    int cnt = 0;
    if (lCnt >= 10000) {
        int nxt = *pts.begin() + L;
        int cnt = 1;

        for (int x : pts) {
            if (x > nxt) {
                nxt = x + L;
                cnt++;
            }
        }
        lCnt = cnt;
        return cnt;
    } else {
        auto it = pts.begin();
        while (it != pts.end()) {
            it = pts.upper_bound((*it) + L);
            cnt++;
        }
        lCnt = cnt;
    }

    return cnt;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Execution timed out 9045 ms 1580 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Execution timed out 9045 ms 1580 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Execution timed out 9045 ms 1580 KB Time limit exceeded
8 Halted 0 ms 0 KB -