oj.uz

Submission #448603

# Submission time Handle Problem Language Result Execution time Memory
448603 2021-07-31T05:54:46 Z dxz05 Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 1488 KB 
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O2,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt")

#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 3e2;

int N, L;
int X[MAXN], A[MAXN];
void init(int _N, int _L, int _X[]){
    N = _N;
    L = _L;
    for (int i = 0; i < N; i++) X[i] = _X[i];

    for (int i = 0; i < N; i++) A[i] = X[i];

    sort(A, A + N);

}

int lastans = -1;

int update(int pos, int val){
    if (X[pos] == val && lastans != -1) return lastans;

    int ind = find(A, A + N, X[pos]) - A;
    A[ind] = val;

    if (X[pos] < val) {
        while (ind < N - 1 && A[ind] > A[ind + 1]) {
            swap(A[ind], A[ind + 1]);
            ind++;
        }
    } else {
        while (ind > 0 && A[ind] < A[ind - 1]) {
            swap(A[ind], A[ind - 1]);
            ind--;
        }
    }

    X[pos] = val;

    //for (int i = 0; i < N; i++) cerr << X[i] << ' '; cerr << endl;
    //for (int i = 0; i < N; i++) cerr << A[i] << ' '; cerr << endl << endl;

    int ans = 1, last = A[0];
    for (int i = 0; i < N; i++){
        if (A[i] - last > L){
            ans++;
            last = A[i];
        }
    }

    lastans = ans;
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 822 ms 1044 KB Output is correct
8 Correct 1355 ms 1212 KB Output is correct
9 Correct 1650 ms 1488 KB Output is correct
10 Execution timed out 9060 ms 1476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 822 ms 1044 KB Output is correct
8 Correct 1355 ms 1212 KB Output is correct
9 Correct 1650 ms 1488 KB Output is correct
10 Execution timed out 9060 ms 1476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 822 ms 1044 KB Output is correct
8 Correct 1355 ms 1212 KB Output is correct
9 Correct 1650 ms 1488 KB Output is correct
10 Execution timed out 9060 ms 1476 KB Time limit exceeded
11 Halted 0 ms 0 KB -