oj.uz

답안 #1048657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048657 2024-08-08T08:57:31 Z AndreasK 쌀 창고 (IOI11_ricehub) C++14
42 / 100
 1000 ms 940 KB 
#include <ricehub.h>
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  int mx=0;
    for (int c=1;c<=L;c++){
        vector <int> a;
        for (int r=0;r<R;r++)
            a.push_back(abs(X[r]-c));
        sort(a.begin(),a.end());
        int ttl=0;
        int b=B;
        for (int r=0;r<R;r++){
            if (a[r]<=b){
                b-=a[r];
                ttl++;
            }
        }
        mx=max(mx,ttl);
    }
    return mx;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 54 ms 448 KB Output is correct
24 Correct 56 ms 592 KB Output is correct
25 Correct 52 ms 348 KB Output is correct
26 Correct 53 ms 348 KB Output is correct
27 Correct 44 ms 344 KB Output is correct
28 Correct 45 ms 344 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 348 KB Output is correct
2 Correct 12 ms 456 KB Output is correct
3 Execution timed out 1067 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1063 ms 940 KB Time limit exceeded
2 Halted 0 ms 0 KB -