답안 #743250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743250 2023-05-17T09:11:21 Z vjudge1 쌀 창고 (IOI11_ricehub) C++17
68 / 100
1000 ms 724 KB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> vec;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i=max(0, (R/2)-1000);i<min(R, (R/2)+1000);i++) {
    int now = 0;
    vec.clear();
    for(int j=0;j<R;j++) {
      vec.push_back(abs(X[j] - X[i]));
    }
    sort(vec.begin(), vec.end());
    long long cou = 0;
    for(auto t:vec) {
      cou += t;
      if (cou>B) break;
      now++;
    }
    ans = max(ans, now);
  }
  return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 3 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 6 ms 312 KB Output is correct
24 Correct 5 ms 212 KB Output is correct
25 Correct 6 ms 320 KB Output is correct
26 Correct 5 ms 312 KB Output is correct
27 Correct 6 ms 212 KB Output is correct
28 Correct 5 ms 308 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 16 ms 212 KB Output is correct
4 Correct 17 ms 328 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 11 ms 324 KB Output is correct
8 Correct 16 ms 328 KB Output is correct
9 Correct 6 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 16 ms 328 KB Output is correct
12 Correct 16 ms 212 KB Output is correct
13 Correct 21 ms 212 KB Output is correct
14 Correct 22 ms 324 KB Output is correct
15 Correct 5 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Correct 13 ms 324 KB Output is correct
18 Correct 13 ms 324 KB Output is correct
19 Correct 20 ms 328 KB Output is correct
20 Correct 22 ms 212 KB Output is correct
21 Correct 169 ms 340 KB Output is correct
22 Correct 163 ms 424 KB Output is correct
23 Correct 398 ms 420 KB Output is correct
24 Correct 387 ms 416 KB Output is correct
25 Correct 366 ms 340 KB Output is correct
26 Correct 360 ms 416 KB Output is correct
27 Correct 273 ms 340 KB Output is correct
28 Correct 273 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -