Submission #1239965

#TimeUsernameProblemLanguageResultExecution timeMemory
1239965countlessDancing Elephants (IOI11_elephants)C++20
26 / 100
9092 ms1604 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define sp <<" "<< #define endl "\n" int n, l; vector<int> x, r; void init(int N, int L, int X[]) { n = N, l = L; x.resize(N); for (int i = 0; i < N; i++) { x[i] = X[i]; } } int update(int i, int y) { x[i] = y; r = x; sort(r.begin(), r.end()); int cnt = 1; int at = r[0]; for (int i = 1; i < n; i++) { if (r[i] <= at + l) continue; cnt++; at = r[i]; } return cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...