# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
124231 | 2019-07-02T20:28:39 Z | KieranHorgan | 코끼리 (Dancing Elephants) (IOI11_elephants) | C++17 | 9000 ms | 2552 KB |
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n; vector<int> a; vector<int> isABegin; vector<pair<int,int>> listOfBegins; set<pair<int,int>> pos; int L; void init(int N, int L_, int X[]) { L = L_; n = N; a.resize(n); isABegin.resize(n); for(int i = 0; i < n; i++) { a[i] = X[i]; pos.insert({a[i], i}); } } bool first = 1; int update(int i, int y) { pos.erase(make_pair(a[i], i)); a[i] = y; pos.insert(make_pair(a[i], i)); auto it = pos.begin(); int l = it->first + L+1; int ans = 1; for(auto p: pos) { int i = p.second; int x = p.first; if(x >= l) { l = x + L + 1; ans++; } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Execution timed out | 9030 ms | 2552 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Execution timed out | 9030 ms | 2552 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Execution timed out | 9030 ms | 2552 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |