oj.uz

Submission #345724

# Submission time Handle Problem Language Result Execution time Memory
345724 2021-01-08T01:41:56 Z daniel920712 Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 2540 KB 
#include "elephants.h"
#include <map>
#include <algorithm>

using namespace std;
int n;
int all[150005];
map < int , int > con;
int l;
void init(int N, int l, int X[])
{
    int i;
    n = N;
    ::l=l;
    for(i=0;i<N;i++)
    {

        all[i]=X[i];
        con[X[i]]++;
    }
}

int update(int i, int y)
{
    int now=0;
    con[all[i]]--;
    if(con[all[i]]==0) con.erase(all[i]);
    con[y]++;
    all[i]=y;
    auto t=con.begin();
    while(t!=con.end())
    {
        now++;
        t=con.upper_bound(t->first+l);
    }
    return now;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 47.0

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

Subtask #5
0 / 3.0

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