Submission #964815

#TimeUsernameProblemLanguageResultExecution timeMemory
964815Trisanu_DasDancing Elephants (IOI11_elephants)C++17
50 / 100
9027 ms8804 KiB
#pragma optimize("Ofast") #include <bits/stdc++.h> using namespace std; int l, a[150005], a_[150005], n; void init(int N, int L, int X[]){ n = N; l = L; a_[0] = INT_MIN, a_[n + 1] = INT_MAX; for(int i = 0; i < n; i++) a_[i + 1] = a[i] = X[i]; } int update(int idx, int val){ int i = 0; while(a_[i] != a[idx]) i++; a_[i] = a[idx] = val; while(a_[i - 1] > a_[i]) swap(a_[i - 1], a_[i]), i--; while(a_[i + 1] < a_[i]) swap(a_[i + 1], a_[i]), i++; int ans = 1, last = a_[1]; for(int i = 2; i <= n; i++) if(a_[i] - last > l) ++ans, last = a_[i]; return ans; }

Compilation message (stderr)

elephants.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Ofast")
      |
#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...