oj.uz

Submission #64634

# Submission time Handle Problem Language Result Execution time Memory
64634 2018-08-05T08:27:19 Z zetapi Dancing Elephants (IOI11_elephants) C++14
0 / 100
 3 ms 560 KB 
#include <elephants.h>

#include <bits/stdc++.h>
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e6;

multiset<int> st;

int N,L,arr[MAX];

void init(int n, int l, int X[])
{
  	N=n;
  	L=l;
  	for(int A=1;A<=N;A++)
    {
  		arr[A]=X[A-1];
      	st.insert(arr[A]);
    }
  	return ;
}

int update(int i, int y)
{
	i++;
  	st.erase(st.find(arr[i]));
  	arr[i]=y;
  	st.insert(arr[i]);
  	int res=1,cur=*st.begin();
  	for(auto A:st)
  	{
  		if(A-cur+1>L)
  		{
  			res++;
  			cur=A;
  		}
  	}
  	return res;
}

/*signed main()
{
	ios_base::sync_with_stdio(false);

	
	return 0;
}*/

Subtask #1
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 Incorrect 3 ms 560 KB Output isn't correct

Subtask #2
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 Incorrect 3 ms 560 KB Output isn't 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 Incorrect 3 ms 560 KB Output isn't correct

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 Incorrect 3 ms 560 KB Output isn't correct

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 Incorrect 3 ms 560 KB Output isn't correct