oj.uz

Submission #173904

# Submission time Handle Problem Language Result Execution time Memory
173904 2020-01-05T18:56:54 Z stefdasca Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 3320 KB 
#include<bits/stdc++.h>

using namespace std;

int n, lg;

int vals[150002], srt[150002];
void init(int N, int L, int X[])
{
    n = N;
    lg = L;
    for(int i = 1; i <= N; ++i)
        srt[i] = X[i-1], vals[i] = X[i-1];
    sort(srt + 1, srt + n + 1);
    srt[n+1] = 2100000000;
}

int binsearch(int val)
{
    int st = 1;
    int dr = n;
    int ans = 0;
    while(st <= dr)
    {
        int mid = (st + dr) / 2;
        if(srt[mid] <= val)
            ans = mid, st = mid + 1;
        else
            dr = mid - 1;
    }
    return ans;
}
int nw[150002];
int update(int xx, int y)
{
    ++xx;
    if(n == 2)
    {
        vals[xx] = y;
        if(abs(vals[1] - vals[2]) > lg)
            return 2;
        return 1;
    }
    int aa = 0;
    for(int i = 1; i <= n; ++i)
        if(srt[i] < y && srt[i] != vals[xx])
            nw[++aa] = srt[i];
    nw[++aa] = y;
    for(int i = 1; i <= n; ++i)
        if(srt[i] > y && srt[i] != vals[xx])
            nw[++aa] = srt[i];
    vals[xx] = y;
    for(int i = 1; i <= n; ++i)
        srt[i] = nw[i];
    int ans = 0;
    int st = 0;
    for(int i = 1; i <= n;)
    {
        ++ans;
        st = srt[i];
        while(i <= n && srt[i] - st <= lg)
            ++i;
    }
  //  for(int i = 1; i <= n; ++i)
  //      cout << srt[i] << " ";
  //  cout << '\n';
    return ans;
}

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 380 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 380 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 380 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 Correct 4754 ms 1188 KB Output is correct
8 Correct 6699 ms 2292 KB Output is correct
9 Execution timed out 9015 ms 3320 KB Time limit exceeded
10 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 380 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 Correct 4754 ms 1188 KB Output is correct
8 Correct 6699 ms 2292 KB Output is correct
9 Execution timed out 9015 ms 3320 KB Time limit exceeded
10 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 380 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 Correct 4754 ms 1188 KB Output is correct
8 Correct 6699 ms 2292 KB Output is correct
9 Execution timed out 9015 ms 3320 KB Time limit exceeded
10 Halted 0 ms 0 KB -