oj.uz

Submission #1093943

# Submission time Handle Problem Language Result Execution time Memory
1093943 2024-09-28T06:29:04 Z Aviansh Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 4956 KB 
#include <bits/stdc++.h>
#include "elephants.h"

using namespace std;

int n;
int l;
int *x;
map<int,int>mp;

void init(int N, int L, int X[])
{
    n = N;
    l=L;
    x=X;
    for(int i = 0;i<n;i++){
        mp[x[i]]++;
    }
}

int update(int i, int y)
{
    mp[x[i]]--;
    if(mp[x[i]]==0){
        mp.erase(x[i]);
    }
    x[i]=y;
    mp[x[i]]++;
    int ans = 1;
    int las = (*mp.begin()).first;
    for(pair<int,int>p:mp){
        if(p.first-las>l){
            las=p.first;
            ans++;
        }
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3697 ms 2576 KB Output is correct
8 Correct 6000 ms 2904 KB Output is correct
9 Execution timed out 9032 ms 4956 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3697 ms 2576 KB Output is correct
8 Correct 6000 ms 2904 KB Output is correct
9 Execution timed out 9032 ms 4956 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3697 ms 2576 KB Output is correct
8 Correct 6000 ms 2904 KB Output is correct
9 Execution timed out 9032 ms 4956 KB Time limit exceeded
10 Halted 0 ms 0 KB -