oj.uz

Submission #29061

# Submission time Handle Problem Language Result Execution time Memory
29061 2017-07-18T07:53:57 Z inqr Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 25228 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace  std;
int n,l,up;
int elepos[150005];
multiset < int > line;
void init(int N, int L, int X[])
{
  	n = N;
  	l = L;
  	for(int i=0;i<N;i++){
  		elepos[i]=X[i];
  		line.insert(X[i]);
  	}
  	line.insert(INT_MAX);
}

int shoot(){
	int camnum=0;
	int covered=*line.begin();
	multiset<int>::iterator it=line.begin();
	while(*it!=INT_MAX){
		//printf("%d DB camnum=%d covered=%d it=%d \n",up,camnum,covered,*it);
		camnum++;
		covered+=l;
		it=line.upper_bound(covered);
		covered=*it;
		//printf("%d 	 DB camnum=%d covered=%d it=%d \n",up,camnum,covered,*it);
	}
	return camnum;
}

int update(int i, int y)
{
	line.erase(line.find(elepos[i]));
	elepos[i]=y;
	line.insert(elepos[i]);
	up++;
  	return shoot();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9000 ms 18892 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9000 ms 19024 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9000 ms 25228 KB Execution timed out
2 Halted 0 ms 0 KB -