Submission #71492

#TimeUsernameProblemLanguageResultExecution timeMemory
71492FLDutchman코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9061 ms4312 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; typedef int INT; #define FOR(i,l,r) for(int i = (l); i < (r); i++) #define snd second #define fst first #define V vector #define pb push_back typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> ii; typedef vector<ii> vii; int N, L; int *X; set<int> s; void init(int n, int l, int x[]) { X = x; N = n; L = l; FOR(i, 0, N) s.insert(X[i]); } int update(int i, int y){ s.erase(X[i]); X[i] = y; s.insert(y); int last = *s.begin(); int cnt = 1; for(int k : s){ if(last+L < k) { last = k; cnt++; } } 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...