# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131266 | arthurconmy | Dancing Elephants (IOI11_elephants) | C++14 | 19 ms | 2020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* 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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |