| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 335876 | 2020-12-14T07:40:06 Z | sumit_kk10 | 쌀 창고 (IOI11_ricehub) | C++14 | 18 ms | 1772 KB |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
long long int besthub(int r, int l, int a[], long long int b){
long long int ans = 1;
int j = (r/2) - 1, k = (r/2) + 1, i = r/2;
long long int budget = b, how_many = 1;
while(budget >= 0){
if(j < 0 and k >= r) break;
if(abs(a[j] - a[i]) <= abs(a[k] - a[i]) and abs(a[j] - a[i]) <= budget and j >= 0){
budget -= abs(a[j] - a[i]);
++how_many;
--j;
}
else if(abs(a[k] - a[i]) <= abs(a[j] - a[i]) and abs(a[k] - a[i]) <= budget and k < r){
budget -= abs(a[k] - a[i]);
++how_many;
++k;
}
else
break;
}
return how_many;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 364 KB | Output is correct |
| 2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
| 3 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 364 KB | Output is correct |
| 2 | Correct | 1 ms | 364 KB | Output is correct |
| 3 | Correct | 1 ms | 364 KB | Output is correct |
| 4 | Correct | 1 ms | 364 KB | Output is correct |
| 5 | Correct | 1 ms | 364 KB | Output is correct |
| 6 | Correct | 1 ms | 364 KB | Output is correct |
| 7 | Correct | 1 ms | 364 KB | Output is correct |
| 8 | Correct | 1 ms | 364 KB | Output is correct |
| 9 | Correct | 1 ms | 364 KB | Output is correct |
| 10 | Correct | 1 ms | 364 KB | Output is correct |
| 11 | Correct | 1 ms | 364 KB | Output is correct |
| 12 | Correct | 1 ms | 364 KB | Output is correct |
| 13 | Correct | 1 ms | 364 KB | Output is correct |
| 14 | Correct | 1 ms | 364 KB | Output is correct |
| 15 | Correct | 1 ms | 364 KB | Output is correct |
| 16 | Correct | 1 ms | 364 KB | Output is correct |
| 17 | Correct | 1 ms | 364 KB | Output is correct |
| 18 | Correct | 1 ms | 364 KB | Output is correct |
| 19 | Incorrect | 1 ms | 364 KB | Output isn't correct |
| 20 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 364 KB | Output is correct |
| 2 | Correct | 1 ms | 364 KB | Output is correct |
| 3 | Correct | 1 ms | 364 KB | Output is correct |
| 4 | Correct | 1 ms | 364 KB | Output is correct |
| 5 | Correct | 1 ms | 364 KB | Output is correct |
| 6 | Correct | 1 ms | 364 KB | Output is correct |
| 7 | Correct | 1 ms | 364 KB | Output is correct |
| 8 | Correct | 1 ms | 364 KB | Output is correct |
| 9 | Correct | 1 ms | 364 KB | Output is correct |
| 10 | Correct | 1 ms | 364 KB | Output is correct |
| 11 | Correct | 1 ms | 364 KB | Output is correct |
| 12 | Correct | 1 ms | 364 KB | Output is correct |
| 13 | Correct | 1 ms | 364 KB | Output is correct |
| 14 | Correct | 1 ms | 504 KB | Output is correct |
| 15 | Incorrect | 1 ms | 364 KB | Output isn't correct |
| 16 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 364 KB | Output is correct |
| 2 | Correct | 3 ms | 492 KB | Output is correct |
| 3 | Correct | 17 ms | 1772 KB | Output is correct |
| 4 | Correct | 17 ms | 1772 KB | Output is correct |
| 5 | Correct | 7 ms | 876 KB | Output is correct |
| 6 | Correct | 7 ms | 876 KB | Output is correct |
| 7 | Correct | 14 ms | 1516 KB | Output is correct |
| 8 | Correct | 14 ms | 1516 KB | Output is correct |
| 9 | Correct | 6 ms | 748 KB | Output is correct |
| 10 | Correct | 6 ms | 748 KB | Output is correct |
| 11 | Incorrect | 18 ms | 1772 KB | Output isn't correct |
| 12 | Halted | 0 ms | 0 KB | - |