oj.uz

Submission #392935

# Submission time Handle Problem Language Result Execution time Memory
392935 2021-04-22T10:23:03 Z Hazem Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 3300 KB 
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

const int N1 = 2e5+10;

int n,l;
set<int>st;
int val[N1];

void init(int N, int L, int X[])
{	
	n = N,l = L;
	for(int i=0;i<n;i++)
		st.insert(X[i]),val[i] = X[i];
}

int update(int i, int y)
{
	st.erase(st.find(val[i]));
	st.insert(y);
	val[i] = y;
	
	vector<int>vec;
	for(auto x:st)
		vec.push_back(x);
	
	int ret = 0,cur = -1;
	for(auto x:vec)
		if(x>cur)ret++,cur = x+l;
		
	return ret;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 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 1 ms 332 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 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 1 ms 332 KB Output is correct
7 Correct 6731 ms 2612 KB Output is correct
8 Execution timed out 9027 ms 3300 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 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 1 ms 332 KB Output is correct
7 Correct 6731 ms 2612 KB Output is correct
8 Execution timed out 9027 ms 3300 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 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 1 ms 332 KB Output is correct
7 Correct 6731 ms 2612 KB Output is correct
8 Execution timed out 9027 ms 3300 KB Time limit exceeded
9 Halted 0 ms 0 KB -