oj.uz

Submission #1069280

# Submission time Handle Problem Language Result Execution time Memory
1069280 2024-08-21T18:43:50 Z MrPavlito Gap (APIO16_gap) C++17
30 / 100
 2000 ms 524288 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+2) / (N-2);
        if(razlika == 0)razlika++;
        for(int i=l+1; i<=r; i+= razlika)
        {
            long long a;
            long long b;
            MinMax(i, min(i+razlika, r), &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;

    }
}

/*
1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 2392 KB Output is correct
6 Correct 0 ms 2388 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 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 7 ms 3040 KB Output is correct
17 Correct 7 ms 2900 KB Output is correct
18 Correct 8 ms 2904 KB Output is correct
19 Correct 7 ms 2892 KB Output is correct
20 Correct 5 ms 2904 KB Output is correct
21 Correct 35 ms 4460 KB Output is correct
22 Correct 26 ms 4476 KB Output is correct
23 Correct 29 ms 4492 KB Output is correct
24 Correct 27 ms 4476 KB Output is correct
25 Correct 25 ms 4468 KB Output is correct
26 Correct 26 ms 4476 KB Output is correct
27 Correct 32 ms 4468 KB Output is correct
28 Correct 26 ms 4472 KB Output is correct
29 Correct 27 ms 2676 KB Output is correct
30 Correct 23 ms 4476 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Runtime error 1073 ms 524288 KB Execution killed with signal 9
3 Runtime error 1092 ms 524288 KB Execution killed with signal 9
4 Runtime error 1114 ms 524288 KB Execution killed with signal 9
5 Correct 1 ms 2392 KB Output is correct
6 Runtime error 1614 ms 524288 KB Execution killed with signal 9
7 Runtime error 983 ms 524288 KB Execution killed with signal 9
8 Execution timed out 3074 ms 2392 KB Time limit exceeded
9 Runtime error 1520 ms 524288 KB Execution killed with signal 9
10 Correct 1 ms 2392 KB Output is correct
11 Execution timed out 3063 ms 2392 KB Time limit exceeded
12 Execution timed out 2558 ms 524288 KB Time limit exceeded
13 Execution timed out 2449 ms 524288 KB Time limit exceeded
14 Runtime error 1337 ms 524288 KB Execution killed with signal 9
15 Execution timed out 3067 ms 133876 KB Time limit exceeded
16 Execution timed out 3023 ms 2392 KB Time limit exceeded
17 Execution timed out 3014 ms 2392 KB Time limit exceeded
18 Execution timed out 3076 ms 2392 KB Time limit exceeded
19 Execution timed out 3033 ms 2392 KB Time limit exceeded
20 Partially correct 5 ms 2392 KB Partially correct
21 Execution timed out 2384 ms 524288 KB Time limit exceeded
22 Execution timed out 3068 ms 2644 KB Time limit exceeded
23 Execution timed out 3071 ms 2648 KB Time limit exceeded
24 Execution timed out 2278 ms 524288 KB Time limit exceeded
25 Execution timed out 3041 ms 134212 KB Time limit exceeded
26 Execution timed out 3078 ms 265648 KB Time limit exceeded
27 Execution timed out 3014 ms 265544 KB Time limit exceeded
28 Execution timed out 3032 ms 265472 KB Time limit exceeded
29 Execution timed out 3023 ms 2648 KB Time limit exceeded
30 Partially correct 28 ms 3152 KB Partially correct
31 Runtime error 1172 ms 524288 KB Execution killed with signal 9
32 Execution timed out 3034 ms 341292 KB Time limit exceeded