oj.uz

답안 #1069350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069350 2024-08-21T20:03:50 Z MrPavlito Gap (APIO16_gap) C++17
30 / 100
 40 ms 4568 KB 
#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

long long findGap(int T, int N)
{
	if(T == 1)
    {
        long long l = 0;
        long long r = inf;
        long long rez = 0;
        vector<long long> nizl;
        vector<long long> nizr;
        while(nizl.size() + nizr.size() < N && l<=r)
        {
            long long a;
            long long b;
            MinMax(l, r, &a ,&b);
            if(a==-1)break;
            l = a+1;
            r = b-1;
            if(a!=b)
            {
                nizl.push_back(a);
                nizr.push_back(b);
            }
            else nizl.pb(a);
        }
        reverse(all(nizr));
        vector<long long> merged(nizl.size()+ nizr.size());
        merge(all(nizl), all(nizr), merged.begin());
        for(int i=0; i<N-1; i++) rez = max(rez, merged[i+1] - merged[i]);
        return rez;
    }
    else
    {
        long long l = 0;
        long long r = inf;
        long long rez = 0;
        vector<long long> niz;
        MinMax(l, r, &l ,&r);
        if(N==2)return r-l;
        long long razlika = (r-l-1+N-1) / (N-1)+1;
        if(razlika == 0)razlika++;
        for(long long i=l+1; i<r; i+= razlika)
        {
            long long a;
            long long b;
            MinMax(i, min(i+razlika, r-1), &a ,&b);
            if(a==-1)continue;
            niz.pb(a);
            if(a!=b)niz.pb(b);
        }
        sort(all(niz));
        for(int i=0; i<niz.size()-1; i++) rez = max(rez, niz[i+1] - niz[i]);
        return rez;

    }
}

/*
2 4
2 3 6 8
*/

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:26:41: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         while(nizl.size() + nizr.size() < N && l<=r)
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
gap.cpp:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int i=0; i<niz.size()-1; i++) rez = max(rez, niz[i+1] - niz[i]);
      |                      ~^~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 9 ms 3020 KB Output is correct
17 Correct 7 ms 2904 KB Output is correct
18 Correct 9 ms 2904 KB Output is correct
19 Correct 7 ms 2904 KB Output is correct
20 Correct 6 ms 2904 KB Output is correct
21 Correct 26 ms 4568 KB Output is correct
22 Correct 26 ms 4476 KB Output is correct
23 Correct 27 ms 4456 KB Output is correct
24 Correct 26 ms 4508 KB Output is correct
25 Correct 24 ms 4476 KB Output is correct
26 Correct 26 ms 4480 KB Output is correct
27 Correct 26 ms 4468 KB Output is correct
28 Correct 26 ms 4468 KB Output is correct
29 Correct 26 ms 4468 KB Output is correct
30 Correct 27 ms 4468 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 9 ms 2904 KB Output is correct
17 Correct 9 ms 2904 KB Output is correct
18 Correct 9 ms 2904 KB Output is correct
19 Correct 12 ms 2904 KB Output is correct
20 Correct 5 ms 2488 KB Output is correct
21 Correct 36 ms 3784 KB Output is correct
22 Correct 38 ms 3784 KB Output is correct
23 Correct 37 ms 3784 KB Output is correct
24 Correct 37 ms 3792 KB Output is correct
25 Correct 38 ms 3944 KB Output is correct
26 Correct 38 ms 3784 KB Output is correct
27 Correct 40 ms 3964 KB Output is correct
28 Correct 37 ms 3784 KB Output is correct
29 Correct 39 ms 3784 KB Output is correct
30 Correct 21 ms 3160 KB Output is correct
31 Incorrect 0 ms 2392 KB Output isn't correct
32 Incorrect 0 ms 2392 KB Output isn't correct