oj.uz

답안 #76382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
76382 2018-09-13T08:56:11 Z vex Gap (APIO16_gap) C++14
30 / 100
 59 ms 39412 KB 
#include <bits/stdc++.h>
#include<gap.h>
#define maxn 100005
#define INF 1e18 + 1000
using namespace std;

int n;
long long a[maxn];

long long findGap(int t,int n)
{
    if(t==1)
    {
        int br=1;
        long long mn,mx;
        a[0]=0;
        a[n+1]=INF;
        while(br<=(n+1)/2)
        {
            MinMax(a[br-1]+1,a[n+2-br]-1,&mn,&mx);
            a[br]=mn;
            a[n+1-br]=mx;
            br++;
        }
        
        long long sol=0;
        for(int i=1;i<n;i++)
        {
            if(a[i+1]-a[i]>sol)sol=a[i+1]-a[i];
        }
        return sol;
    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 660 KB Output is correct
13 Correct 3 ms 832 KB Output is correct
14 Correct 3 ms 840 KB Output is correct
15 Correct 3 ms 884 KB Output is correct
16 Correct 16 ms 1688 KB Output is correct
17 Correct 15 ms 2148 KB Output is correct
18 Correct 16 ms 2612 KB Output is correct
19 Correct 16 ms 3204 KB Output is correct
20 Correct 11 ms 3300 KB Output is correct
21 Correct 59 ms 6480 KB Output is correct
22 Correct 56 ms 8260 KB Output is correct
23 Correct 56 ms 10008 KB Output is correct
24 Correct 57 ms 11892 KB Output is correct
25 Correct 48 ms 13096 KB Output is correct
26 Correct 56 ms 14952 KB Output is correct
27 Correct 58 ms 16812 KB Output is correct
28 Correct 58 ms 18656 KB Output is correct
29 Correct 58 ms 20516 KB Output is correct
30 Correct 40 ms 21208 KB Output is correct
31 Correct 3 ms 21208 KB Output is correct
32 Correct 2 ms 21208 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 21208 KB Output isn't correct
2 Incorrect 2 ms 21208 KB Output isn't correct
3 Incorrect 2 ms 21208 KB Output isn't correct
4 Incorrect 2 ms 21208 KB Output isn't correct
5 Incorrect 2 ms 21208 KB Output isn't correct
6 Incorrect 2 ms 21208 KB Output isn't correct
7 Incorrect 2 ms 21208 KB Output isn't correct
8 Incorrect 2 ms 21208 KB Output isn't correct
9 Incorrect 2 ms 21208 KB Output isn't correct
10 Incorrect 2 ms 21208 KB Output isn't correct
11 Incorrect 4 ms 21208 KB Output isn't correct
12 Incorrect 3 ms 21208 KB Output isn't correct
13 Incorrect 2 ms 21208 KB Output isn't correct
14 Incorrect 3 ms 21208 KB Output isn't correct
15 Incorrect 3 ms 21208 KB Output isn't correct
16 Incorrect 10 ms 21208 KB Output isn't correct
17 Incorrect 9 ms 21208 KB Output isn't correct
18 Incorrect 12 ms 21544 KB Output isn't correct
19 Incorrect 9 ms 22008 KB Output isn't correct
20 Incorrect 6 ms 22088 KB Output isn't correct
21 Incorrect 31 ms 24548 KB Output isn't correct
22 Incorrect 31 ms 26464 KB Output isn't correct
23 Incorrect 31 ms 28236 KB Output isn't correct
24 Incorrect 30 ms 30128 KB Output isn't correct
25 Incorrect 21 ms 31448 KB Output isn't correct
26 Incorrect 30 ms 33172 KB Output isn't correct
27 Incorrect 31 ms 35032 KB Output isn't correct
28 Incorrect 29 ms 36876 KB Output isn't correct
29 Incorrect 31 ms 38844 KB Output isn't correct
30 Incorrect 16 ms 39412 KB Output isn't correct
31 Incorrect 2 ms 39412 KB Output isn't correct
32 Incorrect 2 ms 39412 KB Output isn't correct