# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1137847 | eggx50000 | Taxis (POI13_tak) | C++20 | 83 ms | 4168 KiB |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
#include <random>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int n;
ll m, d, arr[500099];
int main()
{
scanf("%lld %lld %d", &m, &d, &n);
for(int i = 1; i <= n; i ++){
scanf("%lld", arr + i);
}
sort(arr + 1, arr + n + 1);
reverse(arr + 1, arr + n + 1);
ll h = 0;
int r = n + 1;
for(int i = 1; i <= n; i ++){
if(abs(d - h) > arr[i]) continue;
h += arr[i] - abs(d - h);
if(h >= m){
r = min(r, i);
break;
}
if(h >= d) break;
}
arr[0] = 3e18;
int c = 0;
for(int i = n; i >= 1; i --){
if(m - d <= arr[i] && arr[i] < arr[c]){
c = i;
break;
}
}
if(c){
h = 0;
int k = 1;
for(int i = 1; i <= n; i ++){
if(i == c) continue;
k ++;
h += arr[i] - abs(d - h);
if(arr[c] >= abs(d - h) + abs(h - m)){
r = min(r, k);
break;
}
}
}
if(r <= n) printf("%d", r);
else printf("0");
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |