Submission #1093961

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1093961	2024-09-28T07:03:33 Z	Aviansh	Dancing Elephants (IOI11_elephants)	C++17	50 / 100	9000 ms	1628 KB

elephants

#include <algorithm>
#include "elephants.h"

int n;
int l;
int *x;
int uni[70000];
int siz = 0;

void init(int N, int L, int X[])
{
    n = N;
    l=L;
    x=X;
    for(int i = 0;i<n;i++){
        uni[siz]=x[i];
        siz++;
    }
    std::sort(uni,uni+siz);
}

void rem(int ind){
    for(int i = ind+1;i<siz;i++){
        uni[i-1]=uni[i];
    }
    siz--;
}

void add(int ind , int val){
    siz++;
    for(int i = siz;i>ind;i--){
        uni[i]=uni[i-1];
    }
    uni[ind]=val;
}

int update(int i, int y)
{
    for(int e = 0;e<siz;e++){
        if(uni[e]==x[i]){
            rem(e);
            break;
        }
    }
    x[i]=y;
    if(uni[siz-1]<x[i]){
        add(siz,x[i]);
    }
    else{
        for(int e = 0;e<siz;e++){
            if(uni[e]>=x[i]){
                add(e,x[i]);
                break;
            }
        }
    }
    int ans = 1;
    int las = uni[0];
    for(int i = 0;i<siz;i++){
        int curr = uni[i];
        if(curr-las>l){
            las=curr;
            ans++;
        }
    }
    return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	0 ms	348 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

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	962 ms	1116 KB	Output is correct
8	Correct	2110 ms	1112 KB	Output is correct
9	Correct	2559 ms	1368 KB	Output is correct
10	Correct	1841 ms	1624 KB	Output is correct
11	Correct	1792 ms	1372 KB	Output is correct
12	Correct	6048 ms	1408 KB	Output is correct
13	Correct	2007 ms	1372 KB	Output is correct

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	962 ms	1116 KB	Output is correct
8	Correct	2110 ms	1112 KB	Output is correct
9	Correct	2559 ms	1368 KB	Output is correct
10	Correct	1841 ms	1624 KB	Output is correct
11	Correct	1792 ms	1372 KB	Output is correct
12	Correct	6048 ms	1408 KB	Output is correct
13	Correct	2007 ms	1372 KB	Output is correct
14	Correct	1281 ms	1388 KB	Output is correct
15	Correct	4706 ms	1428 KB	Output is correct
16	Execution timed out	9054 ms	1628 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	962 ms	1116 KB	Output is correct
8	Correct	2110 ms	1112 KB	Output is correct
9	Correct	2559 ms	1368 KB	Output is correct
10	Correct	1841 ms	1624 KB	Output is correct
11	Correct	1792 ms	1372 KB	Output is correct
12	Correct	6048 ms	1408 KB	Output is correct
13	Correct	2007 ms	1372 KB	Output is correct
14	Correct	1281 ms	1388 KB	Output is correct
15	Correct	4706 ms	1428 KB	Output is correct
16	Execution timed out	9054 ms	1628 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-