oj.uz

Submission #130284

# Submission time Handle Problem Language Result Execution time Memory
130284 2019-07-14T16:52:47 Z UserIsUndefined Rice Hub (IOI11_ricehub) C++11
68 / 100
 1000 ms 2172 KB 
#include <bits/stdc++.h>
#include <iostream>     
#include <algorithm>
#include <vector>
 
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
 
 
int X[100005];
int D[100005];
bool visited[100005];
 
int gethalf(int n){
    int hal = (n)/2;
    D[0] = hal;
    int ind = 1;
 
    for (int i = 1 ; i < n/2+2 ; i++){
    if (hal+i < n){
        D[ind] = hal+i;
        ind++;
    }
    if (hal-i >= 0){
        D[ind] = hal-i;
        ind++;
    }
    }
 
 
}
 
int besthub(int n, int L, int X[], long long B){
    int maxx = 0;
 
    gethalf(n);
 
 
 
    for (int h = 0 ; h < n ; h++){
        long long bud = B;
        int g = D[h];
        int i = g;
        int j = g+1;
        int cont = 0;
 
        while ((i >= 0)||(j < n)){
            long long absi = abs(X[g] - X[i]);
            long long absj = abs(X[g] - X[j]);
            if (i < 0)absi = LONG_MAX;
            if (j >= n)absj = LONG_MAX;
 
            if (bud-min(absi,absj) < 0)break;
 
            if (absi < absj){
                i--;
                bud-= absi;
                cont++;
            }
            else {
                j++;
                bud-= absj;
                cont++;
            }
 
        }
        maxx = max(maxx,cont);
        if (maxx == n)break;
 
 
    }
    return maxx;
 
}

Compilation message

ricehub.cpp: In function 'int gethalf(int)':
ricehub.cpp:31:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 400 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 372 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 8 ms 376 KB Output is correct
21 Correct 7 ms 432 KB Output is correct
22 Correct 7 ms 452 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 98 ms 376 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 147 ms 376 KB Output is correct
27 Correct 55 ms 456 KB Output is correct
28 Correct 54 ms 376 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 632 KB Output is correct
2 Correct 10 ms 636 KB Output is correct
3 Correct 17 ms 2172 KB Output is correct
4 Execution timed out 1073 ms 2168 KB Time limit exceeded
5 Halted 0 ms 0 KB -