oj.uz

답안 #209889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209889 2020-03-15T20:58:22 Z Nucleist 쌀 창고 (IOI11_ricehub) C++14
100 / 100
 23 ms 760 KB 
#include "ricehub.h"
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
int besthub(int R,int L,int X[],ll B)
{
    int ans=0;
    ll low=0;
    ll high=R;
    while(low<=high)
    {
        ll med=(low+high)/2;
        ll cord=(med-1)/2;
        ll before=(cord);
        ll after=(med-before-1);
        ll cur=0;
        ll best=INF*pow(10,9);
        //debug(med);
        for (ll i = 0; i < med; ++i)
        {
            cur+=abs(X[i]-X[cord]);
        }
        //debug(cur);
        best=min(best,cur);
        for (ll i = med; i < R; ++i)
        {
            cur-=abs(X[cord]-X[i-med]);
            cord++;
            cur+=(before-1)*(X[cord]-X[cord-1]);
            cur-=(after-1)*(X[cord]-X[cord-1]);
            cur+=abs(X[i]-X[cord]);
            //debug(cur);
            best=min(best,cur);
        }
        if(best<=B)
        {
            ans=med;
            low=med+1;
        }
        else
        {
            high=med-1;
        }
    }
    return ans;
}
//code the AC sol !
// BS/queue/map

Compilation message

ricehub.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
ricehub.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 6 ms 256 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 256 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 23 ms 760 KB Output is correct
4 Correct 21 ms 760 KB Output is correct
5 Correct 13 ms 504 KB Output is correct
6 Correct 13 ms 504 KB Output is correct
7 Correct 20 ms 760 KB Output is correct
8 Correct 19 ms 760 KB Output is correct
9 Correct 12 ms 504 KB Output is correct
10 Correct 13 ms 504 KB Output is correct
11 Correct 23 ms 760 KB Output is correct
12 Correct 23 ms 760 KB Output is correct
13 Correct 14 ms 504 KB Output is correct
14 Correct 14 ms 508 KB Output is correct
15 Correct 18 ms 632 KB Output is correct
16 Correct 18 ms 632 KB Output is correct
17 Correct 21 ms 632 KB Output is correct
18 Correct 21 ms 632 KB Output is correct
19 Correct 21 ms 632 KB Output is correct
20 Correct 22 ms 760 KB Output is correct