# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
723349 | 2023-04-13T15:57:15 Z | Richem | Measures (CEOI22_measures) | C++14 | 1500 ms | 3624 KB |
#include <iostream> #include <vector> #include <algorithm> #define int long long using namespace std; int nbDebut, nbAjout, distMin; vector<int> pos; signed main() { cin >> nbDebut >> nbAjout >> distMin; for(int i = 0; i < nbDebut; i++) { int cur; cin >> cur; pos.push_back(cur); } for(int req = 0; req < nbAjout; req++) { int nouv; cin >> nouv; pos.push_back(nouv); sort(pos.begin(), pos.end()); int total = 0; for(int deb = 0; deb < pos.size(); deb++) { for(int fin = deb; fin < pos.size(); fin++) { total = max(total, (fin - deb) * distMin - pos[fin] + pos[deb]); } } cout << total/2; if(total % 2 == 1) { cout << ".5"; } cout << " "; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 212 KB | Output is correct |
2 | Correct | 22 ms | 212 KB | Output is correct |
3 | Correct | 23 ms | 212 KB | Output is correct |
4 | Correct | 22 ms | 212 KB | Output is correct |
5 | Correct | 22 ms | 212 KB | Output is correct |
6 | Correct | 22 ms | 212 KB | Output is correct |
7 | Correct | 22 ms | 212 KB | Output is correct |
8 | Correct | 23 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 212 KB | Output is correct |
2 | Correct | 22 ms | 212 KB | Output is correct |
3 | Correct | 23 ms | 212 KB | Output is correct |
4 | Correct | 22 ms | 212 KB | Output is correct |
5 | Correct | 22 ms | 212 KB | Output is correct |
6 | Correct | 22 ms | 212 KB | Output is correct |
7 | Correct | 22 ms | 212 KB | Output is correct |
8 | Correct | 23 ms | 212 KB | Output is correct |
9 | Execution timed out | 1571 ms | 3624 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1571 ms | 448 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1571 ms | 448 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |