oj.uz

Submission #131266

# Submission time Handle Problem Language Result Execution time Memory
131266 2019-07-16T21:53:38 Z arthurconmy Dancing Elephants (IOI11_elephants) C++14
26 / 100
 19 ms 2020 KB 
/* Arthur Conmy / arthurconmy */
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>

#ifndef ARTHUR_LOCAL
	#include "elephants.h"
#endif

using namespace std;

const int MAXN=100;
int n,l;
int cur_pos[MAXN];

void init(int N, int L, int X[])
{
	n = N;
	l = L;

	for(int i=0; i<n; i++)
	{
		cur_pos[i]=X[i];
	}
}

int update(int i, int y)
{
	cur_pos[i]=y;

	vector<int> pos;

	for(int i=0; i<n; i++)
	{
		pos.push_back(cur_pos[i]);
	}

	sort(pos.begin(),pos.end());

	int cur_start=pos[0];
	int cur_end=pos[0]+l;
	int shots=1;

	for(int i=1; i<n; i++)
	{
		if(pos[i]>cur_end)
		{
			shots++;
			cur_start=pos[i];
			cur_end=pos[i]+l;
		}
	}

	return shots;
}

Compilation message

elephants.cpp: In function 'int update(int, int)':
elephants.cpp:50:6: warning: variable 'cur_start' set but not used [-Wunused-but-set-variable]
  int cur_start=pos[0];
      ^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 19 ms 2020 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 19 ms 2020 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 19 ms 2020 KB Output isn't correct
8 Halted 0 ms 0 KB -