oj.uz

답안 #23298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23298 2017-05-05T23:40:29 Z repeating Gap (APIO16_gap) C++11
30 / 100
 2000 ms 524288 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)

using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
long long findGap(int ,int );
ll a[300006];
long long findGap(int t,int n){
    if(t==1){
        ll l=0,r=1e18;
        ll res=0;
        ll i=0,j=n-1;
        W(i<=j){
            MinMax(l,r,&l,&r);
            a[i]=l;
            a[j]=r;
            r--,l++;
            i++,j--;
        }
        for(int i=1;i<n;i++)res=max(res,a[i]-a[i-1]);
        R res;
    }
    else{
        vector<ll> arr;
        vector<pll> v[3];
        v[0].pb({0,1e18});
        ll x,y;
        ll cur=0;
        W(arr.SI!=n){
            ll sum;
            for(int i=0;i<v[cur].SI;i++){
                sum+=v[cur][i].S-v[cur][i].F+1;
            }
            ll len=sum/10000000;
            ll lef;
            for(int i=0;i<v[cur].SI;i++){
                lef=v[cur][i].F;
                W(lef<=v[cur][i].S){
                    MinMax(lef,min(lef+len,v[cur][i].S),&x,&y);
                    if(x==-1)C;
                    arr.pb(x);
                    if(x!=y)arr.pb(y);
                    x++,y--;
                    if(x<=y)v[cur^1].pb({x,y});
                }
            }
            v[cur].clear();
            cur^=1;
        }
        sort(arr.begin(),arr.end());
        ll res=0;
        for(int i=1;i<n;i++)
            res=max(res,arr[i]-arr[i-1]);
        R res;
    }
}
//int main(){
//    cout<<findGap(1,4);
//}
//void MinMax(ll s,ll t,ll *mn,ll *mx){
//    cout<<s<<" "<<t<<endl;
//    cin>>*mn>>*mx;
//}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:42:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         W(arr.SI!=n){
                 ^
gap.cpp:44:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v[cur].SI;i++){
                          ^
gap.cpp:49:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v[cur].SI;i++){
                          ^
gap.cpp:45:47: warning: 'sum' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 sum+=v[cur][i].S-v[cur][i].F+1;
                                               ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7492 KB Output is correct
2 Correct 0 ms 7492 KB Output is correct
3 Correct 0 ms 7492 KB Output is correct
4 Correct 0 ms 7492 KB Output is correct
5 Correct 0 ms 7492 KB Output is correct
6 Correct 0 ms 7492 KB Output is correct
7 Correct 0 ms 7492 KB Output is correct
8 Correct 0 ms 7492 KB Output is correct
9 Correct 0 ms 7492 KB Output is correct
10 Correct 0 ms 7492 KB Output is correct
11 Correct 0 ms 7492 KB Output is correct
12 Correct 0 ms 7492 KB Output is correct
13 Correct 0 ms 7492 KB Output is correct
14 Correct 0 ms 7492 KB Output is correct
15 Correct 0 ms 7492 KB Output is correct
16 Correct 9 ms 7492 KB Output is correct
17 Correct 9 ms 7492 KB Output is correct
18 Correct 9 ms 7492 KB Output is correct
19 Correct 13 ms 7492 KB Output is correct
20 Correct 9 ms 7492 KB Output is correct
21 Correct 56 ms 7492 KB Output is correct
22 Correct 49 ms 7492 KB Output is correct
23 Correct 73 ms 7492 KB Output is correct
24 Correct 66 ms 7492 KB Output is correct
25 Correct 53 ms 7492 KB Output is correct
26 Correct 53 ms 7492 KB Output is correct
27 Correct 49 ms 7492 KB Output is correct
28 Correct 53 ms 7492 KB Output is correct
29 Correct 53 ms 7492 KB Output is correct
30 Correct 33 ms 7492 KB Output is correct
31 Correct 0 ms 7492 KB Output is correct
32 Correct 0 ms 7492 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2000 ms 7492 KB Execution timed out
2 Execution timed out 2000 ms 7492 KB Execution timed out
3 Execution timed out 2000 ms 7492 KB Execution timed out
4 Execution timed out 2000 ms 7492 KB Execution timed out
5 Memory limit exceeded 499 ms 524288 KB Memory limit exceeded
6 Execution timed out 2000 ms 7492 KB Execution timed out
7 Execution timed out 2000 ms 7492 KB Execution timed out
8 Execution timed out 2000 ms 7492 KB Execution timed out
9 Execution timed out 2000 ms 7492 KB Execution timed out
10 Memory limit exceeded 676 ms 524288 KB Memory limit exceeded
11 Execution timed out 2000 ms 7492 KB Execution timed out
12 Execution timed out 2000 ms 7492 KB Execution timed out
13 Execution timed out 2000 ms 7492 KB Execution timed out
14 Execution timed out 2000 ms 7492 KB Execution timed out
15 Memory limit exceeded 1103 ms 524288 KB Memory limit exceeded
16 Execution timed out 2000 ms 7492 KB Execution timed out
17 Execution timed out 2000 ms 7492 KB Execution timed out
18 Execution timed out 2000 ms 7492 KB Execution timed out
19 Execution timed out 2000 ms 7492 KB Execution timed out
20 Memory limit exceeded 1499 ms 524288 KB Memory limit exceeded
21 Execution timed out 2000 ms 7492 KB Execution timed out
22 Execution timed out 2000 ms 7492 KB Execution timed out
23 Execution timed out 2000 ms 7492 KB Execution timed out
24 Execution timed out 2000 ms 7492 KB Execution timed out
25 Memory limit exceeded 1759 ms 524288 KB Memory limit exceeded
26 Execution timed out 2000 ms 7492 KB Execution timed out
27 Execution timed out 2000 ms 7492 KB Execution timed out
28 Execution timed out 2000 ms 7492 KB Execution timed out
29 Execution timed out 2000 ms 7492 KB Execution timed out
30 Memory limit exceeded 1739 ms 524288 KB Memory limit exceeded
31 Memory limit exceeded 696 ms 524288 KB Memory limit exceeded
32 Execution timed out 2000 ms 524288 KB Execution timed out