oj.uz

답안 #40679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40679 2018-02-06T18:39:35 Z Hassoony Gap (APIO16_gap) C++14
0 / 100
 71 ms 2796 KB 
#include <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"

static void my_assert(int k){ if (!k) exit(1); }

static int subtask_num, N;
static long long A[100001];
static long long call_count;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=1e5+9;

vector<ll>v;
ll findGap(int T, int N){
    ll l=0,r=1e18;
    MinMax(l,r,&l,&r);
    v.push_back(l);
    v.push_back(r);
    l++;r--;
    while(1){
        if(l!=-1&&l<=r){
            MinMax(l,r,&l,&r);
            if(l==-1)break;
            v.push_back(l);
            v.push_back(r);
            l++;r--;
        }
        else break;
    }
    sort(v.begin(),v.end());
    ll ans=0;
    for(int i=0;i+1<v.size();i++){
        ans=max(ans,v[i+1]-v[i]);
    }
    return ans;
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:37:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i+1<v.size();i++){
                    ^
gap.cpp: At global scope:
gap.cpp:7:13: warning: 'void my_assert(int)' defined but not used [-Wunused-function]
 static void my_assert(int k){ if (!k) exit(1); }
             ^
gap.cpp:9:12: warning: 'subtask_num' defined but not used [-Wunused-variable]
 static int subtask_num, N;
            ^
gap.cpp:9:25: warning: 'N' defined but not used [-Wunused-variable]
 static int subtask_num, N;
                         ^
gap.cpp:10:18: warning: 'A' defined but not used [-Wunused-variable]
 static long long A[100001];
                  ^
gap.cpp:11:18: warning: 'call_count' defined but not used [-Wunused-variable]
 static long long call_count;
                  ^

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Incorrect 1 ms 496 KB Output isn't correct
7 Incorrect 1 ms 532 KB Output isn't correct
8 Incorrect 1 ms 604 KB Output isn't correct
9 Incorrect 2 ms 620 KB Output isn't correct
10 Correct 1 ms 620 KB Output is correct
11 Incorrect 2 ms 624 KB Output isn't correct
12 Incorrect 2 ms 624 KB Output isn't correct
13 Incorrect 2 ms 624 KB Output isn't correct
14 Incorrect 2 ms 624 KB Output isn't correct
15 Incorrect 3 ms 624 KB Output isn't correct
16 Incorrect 16 ms 1132 KB Output isn't correct
17 Incorrect 16 ms 1132 KB Output isn't correct
18 Incorrect 17 ms 1136 KB Output isn't correct
19 Incorrect 18 ms 1136 KB Output isn't correct
20 Correct 12 ms 1264 KB Output is correct
21 Incorrect 61 ms 2532 KB Output isn't correct
22 Incorrect 60 ms 2532 KB Output isn't correct
23 Incorrect 60 ms 2536 KB Output isn't correct
24 Incorrect 61 ms 2536 KB Output isn't correct
25 Incorrect 55 ms 2536 KB Output isn't correct
26 Incorrect 63 ms 2536 KB Output isn't correct
27 Incorrect 61 ms 2536 KB Output isn't correct
28 Incorrect 71 ms 2536 KB Output isn't correct
29 Incorrect 64 ms 2536 KB Output isn't correct
30 Correct 52 ms 2536 KB Output is correct
31 Correct 1 ms 2536 KB Output is correct
32 Correct 2 ms 2536 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2536 KB Output is correct
2 Partially correct 1 ms 2536 KB Partially correct
3 Partially correct 1 ms 2536 KB Partially correct
4 Partially correct 1 ms 2536 KB Partially correct
5 Partially correct 2 ms 2536 KB Partially correct
6 Partially correct 2 ms 2536 KB Partially correct
7 Partially correct 1 ms 2536 KB Partially correct
8 Partially correct 1 ms 2536 KB Partially correct
9 Partially correct 2 ms 2536 KB Partially correct
10 Partially correct 2 ms 2536 KB Partially correct
11 Partially correct 2 ms 2536 KB Partially correct
12 Partially correct 2 ms 2536 KB Partially correct
13 Partially correct 2 ms 2536 KB Partially correct
14 Partially correct 2 ms 2536 KB Partially correct
15 Partially correct 3 ms 2536 KB Partially correct
16 Partially correct 15 ms 2536 KB Partially correct
17 Partially correct 16 ms 2536 KB Partially correct
18 Partially correct 18 ms 2536 KB Partially correct
19 Partially correct 15 ms 2536 KB Partially correct
20 Partially correct 13 ms 2536 KB Partially correct
21 Incorrect 62 ms 2536 KB Expected int32, but "2500100001" found
22 Incorrect 63 ms 2536 KB Expected int32, but "2500100001" found
23 Incorrect 63 ms 2536 KB Expected int32, but "2500100001" found
24 Incorrect 61 ms 2536 KB Expected int32, but "2500100001" found
25 Incorrect 54 ms 2536 KB Expected int32, but "2500100001" found
26 Incorrect 60 ms 2576 KB Expected int32, but "2500100001" found
27 Incorrect 61 ms 2796 KB Expected int32, but "2500100001" found
28 Incorrect 60 ms 2796 KB Expected int32, but "2500100001" found
29 Incorrect 63 ms 2796 KB Expected int32, but "2500100001" found
30 Incorrect 47 ms 2796 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2796 KB Partially correct
32 Partially correct 1 ms 2796 KB Partially correct