# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
465412 | JovanB | Dancing Elephants (IOI11_elephants) | C++17 | 4155 ms | 17992 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.
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 150000;
const int K = 400;
int dp[N+5], dokle[N+5], pos[N+5];
vector <pair <int, int>> vec[N+5];
void Calc(int tr){
if(vec[tr].empty()) return;
int j = vec[tr].size() - 1;
for(int i=vec[tr].size()-1; i>=0; i--){
while(vec[tr][i].first + k - 1 < vec[tr][j].first) j--;
if(j == vec[tr].size() - 1){
dp[vec[tr][i].second] = 1;
dokle[vec[tr][i].second] = vec[tr][i].first + k - 1;
}
else{
dp[vec[tr][i].second] = dp[vec[tr][j+1].second] + 1;
dokle[vec[tr][i].second] = dokle[vec[tr][j+1].second];
}
}
}
void Build(const vector <pair <int, int>> &v){
for(int i=1; i<=n; i++) vec[i].clear();
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... |