oj.uz

답안 #897506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897506 2024-01-03T10:28:02 Z ThylOne 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 1000 ms 716 KB 
#include "ricehub.h"
#include<bits/stdc++.h>

using namespace std;
vector<int> pos;
long long budget;
int limit;
bool existWithT(int T){
  int sum = 0;

  for(int i=0;i<T;i++)
    sum+=pos[i];
  
  auto computeScore = [&](int x,int l,int r){
    int re = 0;
    for(int i = l;i<=r;i++){
      re+=abs(x-pos[i]);
    }
    return re;
  };
  auto findGoodSegment = [&](int l,int r){
    int bestInf = double(sum)/double(T);
    int bestSup = ceil(double(sum)/double(T));
    
    if(computeScore(bestInf,l,r)<=budget)return true;
    if(computeScore(bestSup,l,r)<=budget)return true;
    return false;
  };
  if(findGoodSegment(0,T-1))return true;
  for(int right=T;right<pos.size();right++){
    sum-=pos[right-T];
    sum+=pos[right];
    if(findGoodSegment(right-T+1,right))return true;
  }
  return false;
}
int besthub(int R, int L, int X[], long long B)
{

  budget = B;
  pos.resize(R);
  limit = L;
  for(int i = 0;i<R;i++){
    pos[i] = X[i];
  }
  sort(pos.begin(),pos.end());
  for(int i=R;i>=1;i--){
    if(existWithT(i)){
      return i;
    }
  }
  
  
  return 1;
}

Compilation message

ricehub.cpp: In function 'bool existWithT(int)':
ricehub.cpp:30:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for(int right=T;right<pos.size();right++){
      |                   ~~~~~^~~~~~~~~~~

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 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 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 348 KB Output is correct
12 Correct 0 ms 444 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 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 32 ms 348 KB Output is correct
22 Correct 32 ms 448 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Incorrect 17 ms 452 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 33 ms 348 KB Output is correct
6 Correct 34 ms 344 KB Output is correct
7 Correct 255 ms 436 KB Output is correct
8 Correct 251 ms 436 KB Output is correct
9 Correct 31 ms 344 KB Output is correct
10 Correct 31 ms 344 KB Output is correct
11 Correct 130 ms 436 KB Output is correct
12 Correct 127 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 452 KB Output is correct
16 Correct 21 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Execution timed out 1022 ms 344 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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