oj.uz

답안 #677566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677566 2023-01-03T17:44:04 Z ThegeekKnight16 쌀 창고 (IOI11_ricehub) C++17
17 / 100
 1000 ms 1740 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
    int resp = 0;

    for (int i = 1; i <= R; i++)
    {

        int p = i; int q = i+1;
        int sum = 0; int respi = 0;
        while (p >= 1 && q <= R)
        {
            int desq = abs(X[i] - X[p]); int ddir = abs(X[q] - X[i]);
            if (desq < ddir)
            {
                if (sum + desq > B) break;
                sum += desq;
                p--;
                respi++;
            }
            else
            {
                if (sum + ddir > B) break;
                sum += ddir;
                q++;
                respi++;
            }
        }
        // cerr << i << " " << sum << " " << respi << '\n';
        resp = max(resp, respi);
    }

    return resp;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 216 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 428 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Execution timed out 1088 ms 1740 KB Time limit exceeded
4 Halted 0 ms 0 KB -